Preferential attachment when stable
From MaRDI portal
Publication:5203976
DOI10.1017/apr.2019.42zbMath1427.60049arXiv1805.10653OpenAlexW3105633382WikidataQ126798495 ScholiaQ126798495MaRDI QIDQ5203976
Subhabrata Sen, Svante Janson, J. H. Spencer
Publication date: 9 December 2019
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.10653
Combinatorial probability (60C05) Large deviations (60F10) Functional limit theorems; invariance principles (60F17)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proofs of the martingale FCLT
- Stopping times and tightness
- Gaussian-width gradient complexity, reverse log-Sobolev inequalities and nonlinear large deviations
- Exponential random graphs behave like mixtures of stochastic block models
- Decomposition of mean-field Gibbs distributions into product measures
- Conditional distributions and tightness
- Upper tails and independence polynomials in random graphs
- Nonlinear large deviations
- Random Walk: A Modern Introduction
- An approximation of partial sums of independent RV'-s, and the sample DF. I
- Orthogonal decompositions and functional limit theorems for random graph statistics
- Gaussian Hilbert Spaces
- Connectivity Transitions in Networks with Super-Linear Preferential Attachment
- On the variational problem for upper tails in sparse random graphs
- Reinforced random walk