Large degrees in scale-free inhomogeneous random graphs
From MaRDI portal
Publication:2117460
Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Extreme value theory; extremal stochastic processes (60G70) Statistics of extreme values; tail inference (62G32) Random graphs (graph-theoretic aspects) (05C80) Central limit and other weak theorems (60F05) Small world graphs, complex networks (graph-theoretic aspects) (05C82)
Abstract: We consider a class of scale-free inhomogeneous random graphs, which includes some long-range percolation models. We study the maximum degree in such graphs in a growing observation window and show that its limiting distribution is Frechet. We achieve this by proving convergence of the underlying point process of the degrees to a certain Poisson process. Estimating the index of the power-law tail for the typical degree distribution is an important question in statistics. We prove consistency of the Hill estimator for the inverse of the tail exponent of the typical degree distribution.
Recommendations
- Degree correlations in scale-free random graph models
- Large-scale structures in random graphs
- scientific article; zbMATH DE number 3847442
- The degree sequences and spectra of scale-free random graphs
- Degree distribution of a scale-free random graph model
- Survey of scalings for the largest connected component in inhomogeneous random graphs
- Concentration of vertex degrees in a scale‐free random graph process
- Extreme degrees in random graphs
- Degree distribution of an inhomogeneous random intersection graph
- Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees
Cites work
- scientific article; zbMATH DE number 1713116 (Why is no real title available?)
- scientific article; zbMATH DE number 4030574 (Why is no real title available?)
- An introduction to the theory of point processes
- Are extreme value estimation methods useful for network data?
- Characterization and convergence of random measures and point processes
- Connected components in random graphs with given expected degree sequences
- Consistency of Hill estimators in a linear preferential attachment model
- Degree growth rates and index estimation in a directed preferential attachment model
- Growth of preferential attachment random graphs via continuous-time branching processes
- Heavy-Tail Phenomena
- On a conditionally Poissonian graph process
- On a minimum distance procedure for threshold selection in tail analysis
- Power-law distributions in empirical data
- Random Geometric Graphs
- Random graphs and complex networks. Volume 1
- Random graphs.
- Random measures, theory and applications
- Scale-free percolation
- Scale-free percolation in continuum space
- The average distances in random graphs with given expected degrees
- The maximal degree in a Poisson-Delaunay graph
- Two-point concentration in random geometric graphs
- Ultra-small scale-free geometric networks
- Universality for the distance in finite variance random graphs
Cited in
(10)- scientific article; zbMATH DE number 5763194 (Why is no real title available?)
- Degrees in random self-similar bipolar networks
- Scale-free percolation mixing time
- Activity maxima in some models of information networks with random weights and heavy tails
- Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees
- Scale-free graphs with many edges
- A comparative power analysis of the maximum degree and size invariants for random graph inference
- Graphs with asymptotically invariant degree sequences under restriction
- Large deviations for the degree structure in preferential attachment schemes
- Degree correlations in scale-free random graph models
This page was built for publication: Large degrees in scale-free inhomogeneous random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117460)
