Large degrees in scale-free inhomogeneous random graphs
From MaRDI portal
Publication:2117460
DOI10.1214/21-AAP1693zbMath1496.60054arXiv1910.01627OpenAlexW2977746235MaRDI QIDQ2117460
Matthias Schulte, Chinmoy Bhattacharjee
Publication date: 21 March 2022
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.01627
Central limit and other weak theorems (60F05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Extreme value theory; extremal stochastic processes (60G70) Statistics of extreme values; tail inference (62G32) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scale-free percolation
- Growth of preferential attachment random graphs via continuous-time branching processes
- Universality for the distance in finite variance random graphs
- An introduction to the theory of point processes
- Connected components in random graphs with given expected degree sequences
- Degree growth rates and index estimation in a directed preferential attachment model
- The maximal degree in a Poisson-Delaunay graph
- Are extreme value estimation methods useful for network data?
- Scale-free percolation in continuum space
- Two-point concentration in random geometric graphs
- Consistency of Hill estimators in a linear preferential attachment model
- Random Graphs and Complex Networks
- Random Measures, Theory and Applications
- Power-Law Distributions in Empirical Data
- Random Geometric Graphs
- On a Minimum Distance Procedure for Threshold Selection in Tail Analysis
- The average distances in random graphs with given expected degrees
- Heavy-Tail Phenomena
- On a conditionally Poissonian graph process
- Characterization and convergence of random measures and point processes
- Ultra-small scale-free geometric networks
