Scale-free graphs with many edges
From MaRDI portal
Publication:6177606
DOI10.1214/23-ecp567arXiv2212.05907OpenAlexW4389691926MaRDI QIDQ6177606
Publication date: 17 January 2024
Published in: Electronic Communications in Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.05907
Random graphs (graph-theoretic aspects) (05C80) Large deviations (60F10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- Unnamed Item
- Large deviation principles for empirical measures of colored random graphs
- Large deviations of empirical neighborhood distribution in sparse random graphs
- Geometric inhomogeneous random graphs
- Cluster tails for critical power-law inhomogeneous random graphs
- Exact asymptotics for fluid queues fed by multiple heavy-tailed on-off flows.
- Activity periods of an infinite server queue and performance of certain heavy tailed fluid queues
- Persistence of heavy-tailed sample averages: principle of infinitely many big jumps
- Localization in random geometric graphs with too many edges
- Sample path large deviations for Lévy processes and random walks with regularly varying increments
- PageRank's behavior under degree correlations
- Queue length asymptotics for the multiple-server queue with heavy-tailed Weibull service times
- Nonconventional limit theorems in discrete and continuous time via martingales
- Heavy tails in multi-server queue
- Random Graphs and Complex Networks
- On Large Delays in Multi-Server Queues with Heavy Tails
- Finite-time ruin probabilities under large-claim reinsurance treaties for heavy-tailed claim sizes
- Large deviations for empirical measures of generalized random graphs
- Efficient Rare-Event Simulation for Multiple Jump Events in Regularly Varying Random Walks and Compound Poisson Processes
- Generalized PageRank on directed configuration networks
- Understanding Heavy Tails in a Bounded World or, is a Truncated Heavy Tail Heavy or Not?
- The average distances in random graphs with given expected degrees
This page was built for publication: Scale-free graphs with many edges
