The structure of typical clusters in large sparse random configurations

DOI10.1007/s10955-009-9728-yzbMath1168.82028arXiv0811.2988MaRDI QIDQ2391040

Vladas Sidoravićius, Jean Bertoin

Publication date: 24 July 2009

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0811.2988

zbMATH Keywords

Galton-Watson tree; configuration model; Smoluchowski coagulation equations

Mathematics Subject Classification ID

82D60: Statistical mechanics of polymers

60J80: Branching processes (Galton-Watson, birth-and-death, etc.)

Related Items

The component sizes of a critical random graph with given degree sequence, Uniqueness of post-gelation solutions of a class of coagulation equations, Bootstrap percolation in living neural networks, Two solvable systems of coagulation equations with limited aggregations, A model for coagulation with mating, Analytic results on the polymerisation random graph model, First passage percolation on random graphs with finite mean degrees, RESILIENCE TO CONTAGION IN FINANCIAL NETWORKS, A system of grabbing particles related to Galton-Watson trees

Cites Work

• Unnamed Item
• Unnamed Item
• Spinal partitions and invariance under re-rooting of continuum random trees
• Generating simple random graphs with prescribed degree distribution
• Universality for the distance in finite variance random graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The asymptotic number of labeled graphs with given degree sequences
• Deterministic and stochastic models for coalescence (aggregation and coagulation): A review of the mean-field theory for probabilists
• Smoluchowski's coagulation equation: Uniqueness, nonuniqueness and a hydrodynamic limit for the stochastic coalescent
• Brownian excursions, critical random graphs and the multiplicative coalescent
• Distances in random graphs with finite mean and infinite variance degrees
• A system of grabbing particles related to Galton-Watson trees
• A new approach to the giant component problem
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• The Structure and Function of Complex Networks
• A critical point for random graphs with a given degree sequence
• The phase transition in inhomogeneous random graphs
• Distances in random graphs with finite variance degrees
• Thek-Core and Branching Processes
• Random Fragmentation and Coagulation Processes
• The total progeny in a branching process and a related random walk