Susceptibility in subcritical random graphs
From MaRDI portal
Publication:3624667
DOI10.1063/1.2982848zbMath1159.81324arXiv0806.0252OpenAlexW3100446587MaRDI QIDQ3624667
Svante Janson, Malwina J. Luczak
Publication date: 30 April 2009
Published in: Journal of Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0806.0252
Related Items
Goodness-of-fit test for count distributions with finite second moment, Quantum algorithm for triangle finding in sparse graphs, A probabilistic approach to the leader problem in random graphs, A variant of the Erdős–Rényi random graph process, Parking on Cayley trees and frozen Erdős-Rényi, Noise sensitivity of critical random graphs, Modularity of Erdős‐Rényi random graphs, Central limit theorems in the configuration model, A moment-generating formula for Erdős-Rényi component sizes, On the critical probability in percolation, Phase transitions for modified Erdős--Rényi processes, Random subgraph counts and U-statistics: multivariate normal approximation via exchangeable pairs and embedding, Central limit theorem for statistics of subcritical configuration models, Geometry of the minimal spanning tree of a random 3-regular graph, Bounded-Size Rules: The Barely Subcritical Regime
Cites Work
- Unnamed Item
- Asymptotic normality of the \(k\)-core in random graphs
- Birth control for giants
- Brownian excursions, critical random graphs and the multiplicative coalescent
- Functional limit theorems for multitype branching processes and generalized Pólya urns.
- A functional limit theorem for random graphs with applications to subgraph count statistics
- Ballots, queues and random graphs
- Probability: A Graduate Course
- A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution
- A derivation of the Borel distribution
- The total progeny in a branching process and a related random walk
- Univariate Discrete Distributions
- The Multiplicative Process
