Current browse context:
math.CO
Change to browse by:
References & Citations
Mathematics > Combinatorics
Title: An $L^p$ theory of sparse graph convergence I: limits, sparse random graph models, and power law distributions
(Submitted on 13 Jan 2014 (v1), last revised 29 Dec 2014 (this version, v4))
Abstract: We introduce and develop a theory of limits for sequences of sparse graphs based on $L^p$ graphons, which generalizes both the existing $L^\infty$ theory of dense graph limits and its extension by Bollob\'as and Riordan to sparse graphs without dense spots. In doing so, we replace the no dense spots hypothesis with weaker assumptions, which allow us to analyze graphs with power law degree distributions. This gives the first broadly applicable limit theory for sparse graphs with unbounded average degrees. In this paper, we lay the foundations of the $L^p$ theory of graphons, characterize convergence, and develop corresponding random graph models, while we prove the equivalence of several alternative metrics in a companion paper.
Submission history
From: Henry Cohn [view email] [via HENRY proxy][v1] Mon, 13 Jan 2014 16:36:09 GMT (41kb,D)
[v2] Thu, 30 Jan 2014 03:01:16 GMT (45kb,D)
[v3] Mon, 18 Aug 2014 01:43:31 GMT (44kb,D)
[v4] Mon, 29 Dec 2014 22:41:14 GMT (45kb,D)