A system of grabbing particles related to Galton-Watson trees
From MaRDI portal
Publication:3057065
DOI10.1002/rsa.20310zbMath1209.60048arXiv0804.0726MaRDI QIDQ3057065
Jean Bertoin, Vladas Sidoravićius, Maria Eulália Vares
Publication date: 24 November 2010
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0804.0726
05C80: Random graphs (graph-theoretic aspects)
82D60: Statistical mechanics of polymers
60K35: Interacting random processes; statistical mechanics type models; percolation theory
60J80: Branching processes (Galton-Watson, birth-and-death, etc.)
Related Items
Two solvable systems of coagulation equations with limited aggregations, Analytic results on the polymerisation random graph model, The structure of typical clusters in large sparse random configurations
Cites Work
- Unnamed Item
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- The structure of typical clusters in large sparse random configurations
- A critical point for random graphs with a given degree sequence
- The total progeny in a branching process and a related random walk