The component sizes of a critical random graph with given degree sequence

DOI10.1214/13-AAP985zbMath1318.60015arXiv1012.2352MaRDI QIDQ473171

Adrien Joseph

Publication date: 21 November 2014

Published in: The Annals of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

Brownian motionpower lawscaling limitsexcursioncomponent sizescritical random graphrandom multigraph with given vertex degreessize-biased sampling

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Combinatorial probability (60C05)

Related Items (27)

Unusually large components in near-critical Erdős–Rényi graphs via ballot theorems ⋮ Mesoscopic scales in hierarchical configuration models ⋮ 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 ⋮ The probability of unusually large components for critical percolation on random \(d\)-regular graphs ⋮ Heavy-Traffic Analysis Through Uniform Acceleration of Queues with Diminishing Populations ⋮ Stable graphs: distributions and line-breaking construction ⋮ Largest component of subcritical random graphs with given degree sequence ⋮ Parking on Cayley trees and frozen Erdős-Rényi ⋮ Scaling Limits of Random Trees and Random Graphs ⋮ Big Jobs Arrive Early: From Critical Queues to Random Graphs ⋮ Heavy-tailed configuration models at criticality ⋮ Network models: structure and function. Abstracts from the workshop held December 10--16, 2017 ⋮ Critical random graphs and the differential equations technique ⋮ How to determine if a random graph with a fixed degree sequence has a giant component ⋮ The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs ⋮ Continuum limit of critical inhomogeneous random graphs ⋮ Critical random forests ⋮ Finite-pool queueing with heavy-tailed services ⋮ Geometry of the minimal spanning tree of a random 3-regular graph ⋮ The probability of unusually large components in the near-critical Erdős–Rényi graph ⋮ Expansion of Percolation Critical Points for Hamming Graphs ⋮ Component structure of the configuration model: Barely supercritical case ⋮ Universality for random surfaces in unconstrained genus ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scaling limits for critical inhomogeneous random graphs with finite third moments
• Novel scaling limits for critical inhomogeneous random graphs
• Generating simple random graphs with prescribed degree distribution
• On the largest component of a random graph with a subpower-law degree sequence in a subcritical phase
• The largest component in a subcritical random graph with a power law degree distribution
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The asymptotic number of labeled graphs with given degree sequences
• Brownian excursions, critical random graphs and the multiplicative coalescent
• The entrance boundary of the multiplicative coalescent
• Logarithmic combinatorial structures: A probabilistic approach
• The structure of typical clusters in large sparse random configurations
• Critical behavior in inhomogeneous random graphs
• Diffusion approximation for the components in critical inhomogeneous random graphs of rank 1.
• The Probability That a Random Multigraph is Simple
• A new approach to the giant component problem
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• A critical point for random graphs with a given degree sequence
• The Critical Phase for Random Graphs with a Given Degree Sequence

This page was built for publication: The component sizes of a critical random graph with given degree sequence