Large Networks and Graph Limits

By L. Lov'asz. Colloquium Publications, 2012

553 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/5b64f9fe601db2cc862023efbaf56d9b74f1eef4

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

In Computer Networks and Communications

In Geometry and Topology

Citations in the corpus

Finite reflection groups and graph norms (2016, background): “ipartite graph K m;n are weakly norming. He also observed that the functionals kk C 2k correspond to the classical Schatten{von Neumann norms and, hence, even cycles are norming. In addition, Lovasz [17] showed that the complete bipartite graph K n;nminus a perfect matching is weakly norming. We gen”
Matrix estimation by Universal Singular Value Thresholding (2012, background): “n. A graphon is a measurable function f from [0;1]2 into [0;1] that satises f(x;y) f(y;x). The term ‘graphon’ was coined by Lovasz and coauthors in the growing literature on limits of dense graphs [19, 20, 21, 69, 68]. Such functions also arise in the related study of weakly exchangeable random arra”
Community detection and stochastic block models: recent developments (2017, background): “with labels iand jconnect independently with probability W i;j. Further generalizations allow for labelled edges and continuous vertex labels, connecting to low-rank approximation models and graphons [Lov12]. 2 A rst hint on the centrality of the SBM comes from the fact that the model appeared indep”
Stochastic Graphon Games: II. The Linear-Quadratic Case (2021, methodology): “4 extend, possibly with some slight modifications to the quantitative bounds, to sequences of games with random interaction graphs generated with the sampling method for graphons, as developed in [32].”
Limits of locally–globally convergent graph sequences (2012, methodology): “This takes some work which we do not discuss here; for the details, we refer the reader to [24].”
Nonlinear large deviations (2014, methodology): “The main tool in these papers is the regularity lemma of Szemerédi [30] and the graph limit theory of Lovász and coauthors [4, 5, 26] that builds on the regularity lemma.”