The Phase Transition in the Configuration Model
From MaRDI portal
Publication:2883867
DOI10.1017/S0963548311000666zbMath1241.05134arXiv1104.0613MaRDI QIDQ2883867
Publication date: 14 May 2012
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1104.0613
Related Items
Unusually large components in near-critical Erdős–Rényi graphs via ballot theorems, Mesoscopic scales in hierarchical configuration models, Depth first exploration of a configuration model, 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, Respondent-driven sampling on sparse Erdös-Rényi graphs, The probability of unusually large components for critical percolation on random \(d\)-regular graphs, Stable graphs: distributions and line-breaking construction, Largest component of subcritical random graphs with given degree sequence, Random graphs with given vertex degrees and switchings, Asymptotic normality in random graphs with given vertex degrees, Scaling Limits of Random Trees and Random Graphs, Heavy-tailed configuration models at criticality, Central limit theorems in the configuration model, Preferential attachment without vertex growth: emergence of the giant component, Critical random graphs and the differential equations technique, How to determine if a random graph with a fixed degree sequence has a giant component, Continuum limit of critical inhomogeneous random graphs, Asymptotics of trees with a prescribed degree sequence and applications, Exploring hypergraphs with martingales, Critical random forests, Giant Component in Random Multipartite Graphs with Given Degree Sequences, 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, Estimation of dense stochastic block models visited by random walks, Critical behavior in inhomogeneous random graphs, The eternal multiplicative coalescent encoding via excursions of Lévy-type processes, Limit theorems for assortativity and clustering in null models for scale-free networks, The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees, An old approach to the giant component problem, Percolation on Random Graphs with a Fixed Degree Sequence, Asymptotic normality of the size of the giant component in a random hypergraph, Critical percolation on random regular graphs
