The scaling window for a random graph with a given degree sequence

DOI10.1002/RSA.20394zbMath1247.05218arXiv0907.4211OpenAlexW2094948820MaRDI QIDQ2909244

No author found.

Publication date: 30 August 2012

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

double--jump threshold

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07)

Related Items (21)

SIR epidemics on random graphs with a fixed degree sequence ⋮ Tail bounds for the height and width of a random tree with a given degree sequence ⋮ Depth first exploration of a configuration model ⋮ Scale-free percolation ⋮ Universality for critical heavy-tailed network models: metric structure of maximal components ⋮ The probability of unusually large components for critical percolation on random \(d\)-regular graphs ⋮ Largest component of subcritical random graphs with given degree sequence ⋮ Random graphs with given vertex degrees and switchings ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Percolation on complex networks: theory and application ⋮ How to determine if a random graph with a fixed degree sequence has a giant component ⋮ Continuum limit of critical inhomogeneous random graphs ⋮ Novel scaling limits for critical inhomogeneous random graphs ⋮ Percolation on dense random graphs with given degrees ⋮ Random Graphs with a Fixed Maximum Degree ⋮ Bipartite and directed scale-free complex networks arising from zeta functions ⋮ Component structure of the configuration model: Barely supercritical case ⋮ Phase transition for the vacant set left by random walk on the giant component of a random graph ⋮ An old approach to the giant component problem ⋮ Percolation on Random Graphs with a Fixed Degree Sequence

Cites Work

• Unnamed Item
• Scaling limits for critical inhomogeneous random graphs with finite third moments
• Novel scaling limits for critical inhomogeneous random graphs
• The critical random graph, with martingales
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The asymptotic number of labeled graphs with given degree sequences
• Logarithmic combinatorial structures: A probabilistic approach
• A general critical condition for the emergence of a giant component in random graphs with given degrees
• A random graph model for massive graphs
• The transitive closure of a random digraph
• Concentration Inequalities and Martingale Inequalities: A Survey
• The Probability That a Random Multigraph is Simple
• A new approach to the giant component problem
• The Evolution of Random Graphs
• Component behavior near the critical point of the random graph process
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• The Structure of a Random Graph at the Point of the Phase Transition
• A critical point for random graphs with a given degree sequence
• The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence
• The phase transition in inhomogeneous random graphs
• The Critical Phase for Random Graphs with a Given Degree Sequence

This page was built for publication: The scaling window for a random graph with a given degree sequence