Asymptotic normality of the size of the giant component via a random walk
From MaRDI portal
Publication:765189
DOI10.1016/j.jctb.2011.04.003zbMath1237.05192arXiv1010.4595OpenAlexW3104497048MaRDI QIDQ765189
Publication date: 19 March 2012
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.4595
Related Items
Unusually large components in near-critical Erdős–Rényi graphs via ballot theorems, Respondent-driven sampling on sparse Erdös-Rényi graphs, The probability of unusually large components for critical percolation on random \(d\)-regular graphs, Local Limit Theorems for the Giant Component of Random Hypergraphs, Asymptotic normality in random graphs with given vertex degrees, Phase transitions in graphs on orientable surfaces, Chain-referral sampling on stochastic block models, Central limit theorems in the configuration model, Exploring hypergraphs with martingales, Aggregation models with limited choice and the multiplicative coalescent, Central limit theorem for statistics of subcritical configuration models, A power law of order 1/4 for critical mean-field Swendsen-Wang dynamics, The probability of unusually large components in the near-critical Erdős–Rényi graph, Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs, Asymptotic normality of the size of the giant component in a random hypergraph
Cites Work
- Brownian excursions, critical random graphs and the multiplicative coalescent
- Counting connected graphs inside-out
- The transitive closure of a random digraph
- Symmetric sampling procedures, general epidemic processes and their threshold limit theorems
- On tree census and the giant component in sparse random graphs
- Martingale Central Limit Theorems
- On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$
- Unnamed Item
- Unnamed Item
