scientific article; zbMATH DE number 3978019
From MaRDI portal
Publication:3742402
Central limit and other weak theorems (60F05) Applications of branching processes (60J85) Exact enumeration problems, generating functions (05A15) Research exposition (monographs, survey articles) pertaining to probability theory (60-02) Combinatorial probability (60C05) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)
Cited in
(89)- Leaf multiplicity in a Bienaym\'e-Galton-Watson tree
- Heavy subtrees of Galton-Watson trees with an application to Apollonian networks
- The order of a typical matrix with entries in a finite field
- Additive and multiplicative functions on random permutations
- The unsatisfiability threshold revisited
- Generalized allocation scheme with cell occupancies from a fixed finite set
- On the Number of Trees of a Given Size in a Galton--Watson Forest in the Critical Case
- Occupancy problems related to the generalized Stirling numbers
- Optimal routing algorithms for mesh-connected processor arrays
- Extrema of the Generalized Allocation Scheme Based on an $m$-Dependent Sequence
- Structural transition in random mappings
- Random maps with sociological flavor
- Local limit theorems for generalized scheme of allocation of particles into ordered cells
- Strata of random mappings---a combinatorial approach
- Decomposable branching processes with two types of particles
- On a likely shape of the random Ferrers diagram
- The diameter of the uniform spanning tree of dense graphs
- The shape of unlabeled rooted random trees
- Sizes of trees in a random forest and configuration graphs
- Size distribution of the largest component of a random \(a\)-mapping
- Random mappings with constraints on the cycle lengths
- Limit theorems for the logarithm of the order of a random \(A\)-mapping
- Critical random graphs: Diameter and mixing time
- On some aspects of evolution of generalized allocation schemes
- Local limit theorems for one class of distributions in probabilistic combinatorics
- Scaling limit for the ant in a simple high-dimensional labyrinth
- On the joint distribution of the area and the number of peaks for Bernoulli excursions
- A functional limit theorem for decomposable branching processes with two particle types
- The Horton-Strahler number of conditioned Galton-Watson trees
- Linear recurrent relations, power series distributions, and generalized allocation scheme
- On the maximal size of tree in a random forest
- Probability that given vertices belong to the same connected component of random equiprobable mapping
- Size of the largest cluster under zero-range invariant measures
- Invariance principles for Galton-Watson trees conditioned on the number of leaves
- A study of large fringe and non-fringe subtrees in conditional Galton-Watson trees
- Atypical Population Size in a Two-Type Decomposable Branching Process
- On the peel number and the leaf-height of Galton–Watson trees
- Random mappings with component sizes from a given set
- Tree/endofunction bijections and concentration inequalities
- Limit Poisson law for the distribution of the number of components in generalized allocation scheme
- Root estimation in Galton–Watson trees
- Stream Ciphers Using a Random Update Function: Study of the Entropy of the Inner State
- The two-parameter Poisson-Dirichlet point process
- Functional limit theorems for the decomposable branching process with two types of particles
- Images of a finite set under iterations of two random dependent mappings
- On a number of components in a random \(A\)-mapping
- Gibbs partitions: a comprehensive phase diagram
- Cutting down trees with a Markov chainsaw
- Discrete limit laws for additive functions on the symmetric group
- Predecessors and successors in random mappings with exchangeable in-degrees
- Branching random walks with acritical branching part
- Classical and almost sure local limit theorems
- Counting forests
- Large deviations of combinatorial distributions. II: Local limit theorems
- Limit theorems for power-series distributions with finite radius of convergence
- Random trees have height \(O(\sqrt{n})\)
- Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees
- Euler's constant: Euler's work and modern developments
- The evolution of the random reversal graph
- Periods of iterated rational functions
- A conditional Berry-Esseen inequality
- Simply generated unrooted plane trees
- Runs in labelled trees and mappings
- On the distribution of multiple power series regularly varying at the boundary point
- A Vervaat-like path transformation for the reflected Brownian bridge conditioned on its local time at 0
- Coalescent random forests
- Abelian Theorem for the Regularly Varying Measure and Its Density in Orthant
- Limit theorem for the size of an image of subset under compositions of random mappings
- Distinct fringe subtrees in random trees
- Vertices with fixed outdegrees in large Galton-Watson trees
- On limit behavior of maximum vertex degree in a conditional configuration graph near critical points
- Local limit approximations for Lagrangian distributions
- Limit behavior of order statistics on cycle lengths of random \(A\)-permutations
- Number of cells containing a given number of particles in a generalized allocation scheme
- On explosions in heavy-tailed branching random walks
- Asymptotic value distribution of additive functions defined on the symmetric group
- Occupancy distributions arising in sampling from Gibbs-Poisson abundance models
- A conditional functional limit theorem for a decomposable branching process
- Random matrix theory over finite fields
- An analysis of budgeted parallel search on conditional Galton-Watson trees
- Limit theorems for the maximal tree size of a Galton-Watson forest in the critical case
- On the order of random permutation with cycle weights
- On the deepest cycle of a random mapping
- Local properties of random mappings with exchangeable in-degrees
- Speeding up non-Markovian first-passage percolation with a few extra edges
- Averaging sequences, deranged mappings, and a problem of Lampert and Slater
- An analytic method in probabilistic combinatorics
- Random deterministic automata
- On the purity of minor-closed classes of graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3742402)
