The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs

DOI10.1007/s00440-017-0760-6zbMath1384.05138arXiv1508.04645OpenAlexW2963391247MaRDI QIDQ681525

Remco van der Hofstad, Sanchayan Sen, Shankar Bhamidi

Publication date: 12 February 2018

Published in: Probability Theory and Related Fields (Search for Journal in Brave)

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

zbMATH Keywords

multiplicative coalescentcritical random graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items

Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson trees, Critical percolation on scale-free random graphs: new universality class for the configuration model, Universality for critical heavy-tailed network models: metric structure of maximal components, A probabilistic approach to the leader problem in random graphs, On breadth‐first constructions of scaling limits of random graphs and random unicellular maps, Stable graphs: distributions and line-breaking construction, Parking on Cayley trees and frozen Erdős-Rényi, Multisource invasion percolation on the complete graph, Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes, Feller property of the multiplicative coalescent with linear deletion, Heavy-tailed configuration models at criticality, Scaling limit of dynamical percolation on critical Erdős-Rényi random graphs, Network models: structure and function. Abstracts from the workshop held December 10--16, 2017, Continuum limit of critical inhomogeneous random graphs, Geometry of the minimal spanning tree of a random 3-regular graph, Limits of multiplicative inhomogeneous random graphs and Lévy trees: limit theorems, The eternal multiplicative coalescent encoding via excursions of Lévy-type processes, Global lower mass-bound for critical configuration models in the heavy-tailed regime, Limits of multiplicative inhomogeneous random graphs and Lévy trees: the continuum graphs, The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees, RESEARCH ON RISK MEASUREMENT OF SUPPLY CHAIN FINANCE BASED ON FRACTAL THEORY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the Gromov-Hausdorff-Prokhorov distance between (locally) compact metric measure spaces
• The component sizes of a critical random graph with given degree sequence
• Hypercube percolation
• Critical random graphs: limiting constructions and distributional properties
• Scaling limits for critical inhomogeneous random graphs with finite third moments
• Continuum limit of critical inhomogeneous random graphs
• Novel scaling limits for critical inhomogeneous random graphs
• The gap between Gromov-Vague and Gromov-Hausdorff-vague topology
• The tight constant in the Dvoretzky-Kiefer-Wolfowitz inequality
• The continuum random tree. I
• Convergence in distribution of random metric measure spaces (\(\Lambda \)-coalescent measure trees)
• Generating simple random graphs with prescribed degree distribution
• Random trees and applications
• Brownian excursions, critical random graphs and the multiplicative coalescent
• The entrance boundary of the multiplicative coalescent
• Scaling limits of loop-erased random walks and uniform spanning trees
• The scaling limit of the minimum spanning tree of the complete graph
• Cluster tails for critical power-law inhomogeneous random graphs
• The genealogy of self-similar fragmentations with negative index as a continuum random tree
• Probabilistic and fractal aspects of Lévy trees
• Concentration around the mean for maxima of empirical processes
• Inhomogeneous continuum random trees and the entrance boundary of the additive coalescent
• Connected components in random graphs with given expected degree sequences
• The exploration process of inhomogeneous continuum random trees, and an extension of Jeulin's local time identity
• Limit distributions and random trees derived from the birthday problem with unequal probabilities
• Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson trees
• The continuum random tree. III
• The continuum limit of critical random graphs
• Random Graphs and Complex Networks
• Critical behavior in inhomogeneous random graphs
• Asymptotic equivalence and contiguity of some random graphs
• Statistical mechanics of complex networks
• An Elementary Proof of the Hitting Time Theorem
• OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS
• Component behavior near the critical point of the random graph process
• A family of random trees with random edge lengths
• The Structure of a Random Graph at the Point of the Phase Transition
• The Structure and Function of Complex Networks
• The Average Distance in a Random Graph with Given Expected Degrees
• The phase transition in inhomogeneous random graphs
• The average distances in random graphs with given expected degrees
• On a conditionally Poissonian graph process
• Random Fragmentation and Coagulation Processes
• The total progeny in a branching process and a related random walk
• The Multiplicative Process
• Explosive Percolation in Random Networks
• Networks
• Random mappings, forests, and subsets associated with Abel-Cayley-Hurwitz multinomial expansions