REVIEW 4 cited by
Graph limits and exchangeable random graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Graph limits and exchangeable random graphs
read the original abstract
We develop a clear connection between deFinetti's theorem for exchangeable arrays (work of Aldous--Hoover--Kallenberg) and the emerging area of graph limits (work of Lovasz and many coauthors). Along the way, we translate the graph theory into more classical probability.
Forward citations
Cited by 4 Pith papers
-
Limits of Sparse Configuration Models and Beyond: Graphexes and Multi-Graphexes
The paper establishes sampling convergence of the configuration model, preferential attachment model, generalized random graph, and bipartite configuration model to graphexes, giving necessary and sufficient condition...
-
Banach-valued graph limits: Graphon representability and Banach-space structure
X-valued graphon representability of density limits holds precisely when X has the Radon–Nikodým property and is weakly sequentially complete (in the bounded case, for every X).
-
Any-Dimensional Learning by Sampling
Random sampling maps (with-replacement, binning, species) induce metrics that give uniform any-dimensional generalization and sketching rates for continuous functions on sequences, graphs and tensors.
-
Decorated graphons for temporal network estimation
Dynamic networks can be modeled as decorated graphons whose edge labels are binary time-series laws, estimated by two-stage blockwise least squares with rates depending on the number of time steps and edge-estimator quality.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.