An Lp theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
Author(s)
Borgs, Christian; Chayes, Jennifer; Cohn, Henry; Zhao, Yufei
DownloadPublished version (525.8Kb)
Terms of use
Metadata
Show full item recordAbstract
We introduce and develop a theory of limits for sequences of sparsegraphs based on Lp graphons, which generalizes both the existing L∞ theory ofdense graph limits and its extension by Bollob ́as and Riordan to sparse graphswithout dense spots. In doing so, we replace the no dense spots hypothesiswith weaker assumptions, which allow us to analyze graphs with power lawdegree distributions. This gives the first broadly applicable limit theory forsparse graphs with unbounded average degrees. In this paper, we lay the foun-dations of the Lp theory of graphons, characterize convergence, and developcorresponding random graph models, while we prove the equivalence of severalalternative metrics in a companion paper.
Date issued
2019-05Department
Massachusetts Institute of Technology. Department of MathematicsJournal
Transactions of the American Mathematical Society
Publisher
American Mathematical Society (AMS)
Citation
Borgs, Christian et al. “An Lp theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions.” Transactions of the American Mathematical Society, vol. 372, no. 5, 2019, pp. 3019-3062 © 2019 The Author(s)
Version: Final published version
ISSN
0002-9947