scientific article; zbMATH DE number 3978019
From MaRDI portal
Publication:3742402
zbMATH Open0605.60010MaRDI QIDQ3742402FDOQ3742402
Authors: V. F. Kolchin
Publication date: 1986
Title of this publication is not available (Why is that?)
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 unsatisfiability threshold revisited
- The order of a typical matrix with entries in a finite field
- Additive and multiplicative functions on random permutations
- Generalized allocation scheme with cell occupancies from a fixed finite set
- Optimal routing algorithms for mesh-connected processor arrays
- Structural transition in random mappings
- Local limit theorems for generalized scheme of allocation of particles into ordered cells
- The diameter of the uniform spanning tree of dense graphs
- Strata of random mappings---a combinatorial approach
- Decomposable branching processes with two types of particles
- On a likely shape of the random Ferrers diagram
- Sizes of trees in a random forest and configuration graphs
- Size distribution of the largest component of a random \(a\)-mapping
- The shape of unlabeled rooted random trees
- 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
- Local limit theorems for one class of distributions in probabilistic combinatorics
- Scaling limit for the ant in a simple high-dimensional labyrinth
- A functional limit theorem for decomposable branching processes with two particle types
- Linear recurrent relations, power series distributions, and generalized allocation scheme
- Size of the largest cluster under zero-range invariant measures
- A study of large fringe and non-fringe subtrees in conditional Galton-Watson trees
- Invariance principles for Galton-Watson trees conditioned on the number of leaves
- Random mappings with component sizes from a given set
- Limit Poisson law for the distribution of the number of components in generalized allocation scheme
- On a number of components in a random \(A\)-mapping
- 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
- Discrete limit laws for additive functions on the symmetric group
- Cutting down trees with a Markov chainsaw
- Predecessors and successors in random mappings with exchangeable in-degrees
- Branching random walks with acritical branching part
- Counting forests
- Large deviations of combinatorial distributions. II: Local limit theorems
- Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees
- Euler's constant: Euler's work and modern developments
- Periods of iterated rational functions
- A conditional Berry-Esseen inequality
- Runs in labelled trees and mappings
- A Vervaat-like path transformation for the reflected Brownian bridge conditioned on its local time at 0
- Coalescent random forests
- Distinct fringe subtrees in random trees
- Limit theorem for the size of an image of subset under compositions of random mappings
- 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
- On explosions in heavy-tailed branching random walks
- Asymptotic value distribution of additive functions defined on the symmetric group
- Random matrix theory over finite fields
- Occupancy distributions arising in sampling from Gibbs-Poisson abundance models
- 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
- Local properties of random mappings with exchangeable in-degrees
- Random deterministic automata
- Averaging sequences, deranged mappings, and a problem of Lampert and Slater
- An analytic method in probabilistic combinatorics
- On the purity of minor-closed classes of graphs
- 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
- Extrema of the Generalized Allocation Scheme Based on an $m$-Dependent Sequence
- Random maps with sociological flavor
- On some aspects of evolution of generalized allocation schemes
- On the joint distribution of the area and the number of peaks for Bernoulli excursions
- On the maximal size of tree in a random forest
- Probability that given vertices belong to the same connected component of random equiprobable mapping
- The Horton-Strahler number of conditioned 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
- Root estimation in Galton–Watson trees
- Tree/endofunction bijections and concentration inequalities
- Stream Ciphers Using a Random Update Function: Study of the Entropy of the Inner State
- Gibbs partitions: a comprehensive phase diagram
- Classical and almost sure local limit theorems
- Limit theorems for power-series distributions with finite radius of convergence
- Random trees have height \(O(\sqrt{n})\)
- The evolution of the random reversal graph
- Simply generated unrooted plane trees
- On the distribution of multiple power series regularly varying at the boundary point
- Abelian Theorem for the Regularly Varying Measure and Its Density in Orthant
- 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
- A conditional functional limit theorem for a decomposable branching process
- On the deepest cycle of a random mapping
- An analysis of budgeted parallel search on conditional Galton-Watson trees
- Speeding up non-Markovian first-passage percolation with a few extra edges
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)