Rare event asymptotics for exploration processes for random graphs
DOI10.1214/21-AAP1704zbMath1487.05239arXiv1912.04714MaRDI QIDQ2135267
Amarjit Budhiraja, Paul Dupuis, Shankar Bhamidi, Ruoyu Wu
Publication date: 6 May 2022
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.04714
Euler-Lagrange equationsbranching processesrandom graphslarge deviation principlevariational representationsPoisson random measuresconfiguration modelgiant componentsingular dynamicsexploration processcalculus of variations problemsdiminishing ratessparse regime
Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Applications of branching processes (60J85) Combinatorial probability (60C05) Large deviations (60F10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- The large deviation principle for the Erdős-Rényi random graph
- Variational representations for continuous time processes
- Moderate deviation principles for stochastic differential equations with jumps
- Large deviations of empirical neighborhood distribution in sparse random graphs
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- The asymptotic number of labeled graphs with given degree sequences
- A variational representation for certain functionals of Brownian motion
- Brownian excursions, critical random graphs and the multiplicative coalescent
- Some large deviation results for sparse random graphs
- Large deviation asymptotics for occupancy problems.
- Large deviations for stochastic partial differential equations driven by a Poisson random measure
- Large deviations for the degree structure in preferential attachment schemes
- Large deviations of subgraph counts for sparse Erdős-Rényi graphs
- Nonlinear large deviation bounds with applications to Wigner matrices and sparse Erdős-Rényi graphs
- Moderate deviation principles for weakly interacting particle systems
- Large deviations for random graphs. École d'Été de Probabilités de Saint-Flour XLV -- 2015
- Upper tails and independence polynomials in random graphs
- On the number of isolated vertices in a growing random graph
- Stochastic processes in random graphs
- Nonlinear large deviations
- An introduction to large deviations for random graphs
- Random Graphs and Complex Networks
- The Probability That a Random Multigraph is Simple
- A new approach to the giant component problem
- The Size of the Giant Component of a Random Graph with a Given Degree Sequence
- A critical point for random graphs with a given degree sequence
- Analysis and Approximation of Rare Events
- On the variational problem for upper tails in sparse random graphs
This page was built for publication: Rare event asymptotics for exploration processes for random graphs
