Stochastic processes in random graphs
From MaRDI portal
Publication:2497217
Abstract: We study the asymptotics of large, moderate and normal deviations for the connected components of the sparse random graph by the method of stochastic processes. We obtain the logarithmic asymptotics of large deviations of the joint distribution of the number of connected components, of the sizes of the giant components, and of the numbers of the excess edges of the giant components. For the supercritical case, we obtain the asymptotics of normal deviations and the logarithmic asymptotics of large and moderate deviations of the joint distribution of the number of components, of the size of the largest component, and of the number of the excess edges of the largest component. For the critical case, we obtain the logarithmic asymptotics of moderate deviations of the joint distribution of the sizes of connected components and of the numbers of the excess edges. Some related asymptotics are also established. The proofs of the large and moderate deviation asymptotics employ methods of idempotent probability theory. As a byproduct of the results, we provide some additional insight into the nature of phase transitions in sparse random graphs.
Recommendations
- Some large deviation results for sparse random graphs
- A large-deviations principle for all the components in a sparse inhomogeneous random graph
- Rare event asymptotics for exploration processes for random graphs
- An introduction to large deviations for random graphs
- Large deviations for random graphs. École d'Été de Probabilités de Saint-Flour XLV -- 2015
Cites work
- A general non-convex large deviation result with applications to stochastic equations
- Brownian excursions, critical random graphs and the multiplicative coalescent
- scientific article; zbMATH DE number 3951715 (Why is no real title available?)
- scientific article; zbMATH DE number 4034749 (Why is no real title available?)
- scientific article; zbMATH DE number 4044567 (Why is no real title available?)
- scientific article; zbMATH DE number 43057 (Why is no real title available?)
- scientific article; zbMATH DE number 44889 (Why is no real title available?)
- scientific article; zbMATH DE number 192914 (Why is no real title available?)
- scientific article; zbMATH DE number 3504682 (Why is no real title available?)
- scientific article; zbMATH DE number 1231233 (Why is no real title available?)
- scientific article; zbMATH DE number 1239549 (Why is no real title available?)
- scientific article; zbMATH DE number 477682 (Why is no real title available?)
- scientific article; zbMATH DE number 1076323 (Why is no real title available?)
- scientific article; zbMATH DE number 1158743 (Why is no real title available?)
- scientific article; zbMATH DE number 1933009 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 194743 (Why is no real title available?)
- scientific article; zbMATH DE number 3339011 (Why is no real title available?)
- scientific article; zbMATH DE number 3358264 (Why is no real title available?)
- Large deviation analysis of the single server queue
- Large deviations and idempotent probability
- Large deviations for two scaled diffusions
- On some degenerate large deviation problems
- On the fluctuations of the giant component
- On tree census and the giant component in sparse random graphs
- Random graphs.
- Some large deviation results for sparse random graphs
- Stochastic-Process Limits
- Structure of the Random Graphs $\mathcal{G}_m (x|h)$
- The method of stochastic exponentials for large deviations
- The random-cluster model on the complete graph
Cited in
(22)- Some large deviation results for sparse random graphs
- Higher-order fluctuations in dense random graph models
- Rare event asymptotics for exploration processes for random graphs
- Likelihood theory for the graph Ornstein-Uhlenbeck process
- A natural stochastic extension of the sandpile model on a graph
- Impulsive processes on the weighted directed graphs
- The order of the giant component of random hypergraphs
- On large deviations of coupled diffusions with time scale separation
- Moderate deviation in colored random graphs
- scientific article; zbMATH DE number 5485245 (Why is no real title available?)
- Algebraic statistics for a directed random graph model with reciprocation
- Expectation and Variance of Self-assembled Graph Structures
- Ergodic theory on stationary random graphs
- Multicyclic components in a random graph process
- Filtering Random Graph Processes Over Random Time-Varying Graphs
- Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time
- A large‐deviations principle for all the cluster sizes of a sparse Erdős–Rényi graph
- Fluctuations of the giant of Poisson random graphs
- The process of fluctuations of the giant component of an Erdős-Rényi graph
- Large deviations of empirical neighborhood distribution in sparse random graphs
- Graphs, random sums, and sojourn time distributions, with application to ion-channel modeling
- A Markov chain approach to randomly grown graphs
This page was built for publication: Stochastic processes in random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497217)
