Some large deviation results for sparse random graphs

From MaRDI portal
Publication:1384661

DOI10.1007/s004400050149zbMath0927.60041OpenAlexW2063553966WikidataQ105584582 ScholiaQ105584582MaRDI QIDQ1384661

Neil O'Connell

Publication date: 13 December 1999

Published in: Probability Theory and Related Fields (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004400050149




Related Items (22)

Partition Functions of Discrete Coalescents: From Cayley’s Formula to Frieze’s ζ(3) Limit TheoremUnusually large components in near-critical Erdős–Rényi graphs via ballot theoremsRare event asymptotics for exploration processes for random graphsLimiting behavior of 3-color excitable media on arbitrary graphsOn large deviation properties of Erdős-Rényi random graphsLarge deviation principles for empirical measures of colored random graphsA large-deviations principle for all the components in a sparse inhomogeneous random graphA large‐deviations principle for all the cluster sizes of a sparse Erdős–Rényi graphThe probability of unusually large components for critical percolation on random \(d\)-regular graphsRandom 2 XORSAT phase transitionLocal Limit Theorems for the Giant Component of Random HypergraphsOn the number of isolated vertices in a growing random graphConcentration of measure for the number of isolated vertices in the Erdős-Rényi random graph by size bias couplingsA large deviation approach to super-critical bootstrap percolation on the random graph \(G_{n, p}\)The Asymptotic Number of Connectedd-Uniform HypergraphsExploring hypergraphs with martingalesCLT-related large deviation bounds based on Stein's methodStochastic processes in random graphsThe cut metric, random graphs, and branching processesThe probability of unusually large components in the near-critical Erdős–Rényi graphLarge deviations of empirical neighborhood distribution in sparse random graphsLarge deviations at equilibrium for a large star-shaped loss network.




This page was built for publication: Some large deviation results for sparse random graphs