Large degrees in scale-free inhomogeneous random graphs
DOI10.1214/21-AAP1693zbMATH Open1496.60054arXiv1910.01627OpenAlexW2977746235MaRDI QIDQ2117460FDOQ2117460
Authors: Chinmoy Bhattacharjee, Matthias Schulte
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
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
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)
Cites Work
- Power-law distributions in empirical data
- Random Geometric Graphs
- Are extreme value estimation methods useful for network data?
- Title not available (Why is that?)
- Random graphs and complex networks. Volume 1
- Title not available (Why is that?)
- An introduction to the theory of point processes
- Heavy-Tail Phenomena
- Connected components in random graphs with given expected degree sequences
- Two-point concentration in random geometric graphs
- Random graphs.
- The average distances in random graphs with given expected degrees
- On a conditionally Poissonian graph process
- Universality for the distance in finite variance random graphs
- Scale-free percolation
- Ultra-small scale-free geometric networks
- Characterization and convergence of random measures and point processes
- Growth of preferential attachment random graphs via continuous-time branching processes
- Random measures, theory and applications
- On a minimum distance procedure for threshold selection in tail analysis
- Scale-free percolation in continuum space
- Degree growth rates and index estimation in a directed preferential attachment model
- The maximal degree in a Poisson-Delaunay graph
- Consistency of Hill estimators in a linear preferential attachment model
Cited In (10)
- Title not available (Why is that?)
- 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
Uses Software
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)