Fetching the paper…
Reading the bibliography…
The colored neighborhood metric for sparse graphs was introduced by Bollob\'as and Riordan.
C. Borgs, J.T. Chayes, L. Lovász, V.T. Sós, and K. Vesztergombi: Convergent graph sequences II: Multiway Cuts and Statistical Physics, Annals of Math
1912
Earlier work this paper cites.
N. Alon and V. D. Milman: λ 1 \lambda_{1} , isoperimetric inequalities for graphs and superconcentrators, J. Combinatorial Theory B 38
1985
Earlier work this paper cites.
N. Alon: Eigenvalues and expanders, Combinatorica 6
1986
Earlier work this paper cites.
A. Kechris, S. Solecki and S. Todorcevic: Borel chromatic numbers, Advances in Mathematics 141
1999
Earlier work this paper cites.
N. Alon, J. Spencer: The Probabilistic Method , Wiley–Interscience, 2000
2000
Earlier work this paper cites.
I. Benjamini and O. Schramm: Recurrence of distributional limits of finite planar graphs, Electronic J. Probab. 6
2001
Earlier work this paper cites.
Eli Glasner: Ergodic Theory via Joinings
2003
Earlier work this paper cites.
A. Kechris and B.D. Miller: Topics in orbit equivalence theory , Lecture Notes in Mathematics 1852
2004
Earlier work this paper cites.
L. Lovász, B. Szegedy: Limits of dense graph sequences, J. Comb. Theory B 96
2006
Cited alongside, same era.
D. Aldous, R. Lyons: Processes on Unimodular Random Networks, Electron. J. Probab
2007
Cited alongside, same era.
G. Elek: On limits of finite graphs, Combinatorica 27
2007
Cited alongside, same era.
G. Elek: The combinatorial cost, Enseign. Math. 53
2007
Cited alongside, same era.
L. Lovász, B. Szegedy: Szemerédi’s Lemma for the analyst, Geom. Func. Anal. 17
2007
Cited alongside, same era.
C. Borgs, J.T. Chayes, L. Lovász, V.T. Sós, and K. Vesztergombi: Convergent graph sequences I: Subgraph frequencies, metric properties, and testing, Advances in Math. 219
2008
Cited alongside, same era.
I. Benjamini, O. Schramm, A. Shapira: Every Minor-Closed Property of Sparse Graphs is Testable, Advances in Math. 223
2010
Later among the works it cites.
C. Borgs, J. Chayes and L. Lovász: Moments of Two-Variable Functions and the Uniqueness of Graph Limits, Geom. Func. Anal
2010
Later among the works it cites.
G. Elek and G. Lippner: Borel oracles. An analytical approach to constant-time algorithms, Proc. Amer. Math. Soc. 138
2010
Later among the works it cites.
A.S. Kechris: Global aspects of ergodic group actions,
2010
Later among the works it cites.
G. Elek: Finite graphs and amenability, J. of Func. Anal
2012
Closest in time.
G. Elek, B. Szegedy: A measure-theoretic approach to the theory of dense hypergraphs, Adv. in Math
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
O. Schramm: Hyperfinite graph limits, Elect. Res. Announce. Math. Sci. 15 (2008), 17–23
2008
Cited alongside, same era.
A. Hassidim, J.A. Kelner, H.N. Nguyen, K. Onak: Local Graph Partitions for Approximation and Testing, in: FOCS ’09, 50th Ann. IEEE Symp. on Found. Comp. Science (2009), 22–31
2009
Cited alongside, same era.
M. Abert, B. Weiss: Bernoulli actions are weakly contained in any free action, Ergodic theory and dynamical systems , to appear
Cited in the paper.
B. Bollobas, O. Riordan: Sparse graphs: Metrics and random models, Rand. Struc. Alg. 39
Cited in the paper.
Cited in the paper.
L. Lovász, K. Vesztergombi: Nondeterministic graph property testing, Comb. Prob. and Comput
Cited in the paper.
2012
Closest in time.
L. Lovász: Large networks and graph limits , Amer. Math. Soc., Providence, R.I. (2012)
2012
Closest in time.
C. Borgs, J.T. Chayes, J. Kahn and L. Lovász: Left and right convergence of graphs with bounded degree, Random Struc. Alg
2013
Closest in time.