On the largest component of the random graph at a nearcritical stage

DOI10.1006/jctb.2000.2033zbMath1028.05102OpenAlexW1977630939MaRDI QIDQ1850545

Boris G. Pittel

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2000.2033

zbMATH Keywords

limiting distribution

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items (17)

Large deviations for power-law thinned Lévy processes ⋮ Exceptional times of the critical dynamical Erdős-Rényi graph ⋮ The critical window in random digraphs ⋮ Unusually large components in near-critical Erdős–Rényi graphs via ballot theorems ⋮ An elementary approach to component sizes in critical random graphs ⋮ The probability of unusually large components for critical percolation on random \(d\)-regular graphs ⋮ The continuum limit of critical random graphs ⋮ Edge percolation on a random regular graph of low degree ⋮ Cluster tails for critical power-law inhomogeneous random graphs ⋮ The critical random graph, with martingales ⋮ Critical random graphs and the structure of a minimum spanning tree ⋮ Finite-pool queueing with heavy-tailed services ⋮ Survey of Scalings for the Largest Connected Component in Inhomogeneous Random Graphs ⋮ Critical epidemics, random graphs, and Brownian motion with a parabolic drift ⋮ The probability of unusually large components in the near-critical Erdős–Rényi graph ⋮ Expansion of Percolation Critical Points for Hamming Graphs ⋮ Critical behavior in inhomogeneous random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Wright and Stepanov-Wrigth coefficients
• Brownian excursions, critical random graphs and the multiplicative coalescent
• The number of connected sparsely edged graphs. III. Asymptotic results
• The Evolution of Random Graphs
• On Some Features of the Structure of a Random Graph Near a Critical Point
• On the random graph structure near the critical point
• Component behavior near the critical point of the random graph process
• On tree census and the giant component in sparse random graphs
• The asymptotic number of labeled connected graphs with a given number of vertices and edges
• The number of connected sparsely edged graphs
• The Structure of a Random Graph at the Point of the Phase Transition
• Components of Random Forests
• Enumerating graphs and Brownian motion
• On the Behavior of a Random Graph Near a Critical Point
• Linear probing: The probable largest search time grows logarithmically with the number of records
• The birth of the giant component
• On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$

This page was built for publication: On the largest component of the random graph at a nearcritical stage