# Borel Liftings of Graph Limits

@article{Orbanz2013BorelLO, title={Borel Liftings of Graph Limits}, author={Peter Orbanz and Bal{\'a}zs Szegedy}, journal={arXiv: Probability}, year={2013} }

The cut pseudo-metric on the space of graph limits induces an equivalence relation. The quotient space obtained by collapsing each equivalence class to a point is a metric space with appealing analytic properties. We show that the equivalence relation admits a Borel lifting: There exists a Borel-measurable mapping which maps each equivalence class to one of its elements.

## 3 Citations

Borel selector for hypergraphons

- Mathematics
- 2017

We show that there is a Borel way of choosing a representative of a $k$-uniform hypergraphon. This extends the result of Orbanz and Szegedy where this was shown for graphons.

Convergence of graphs with intermediate density

- Mathematics
- 2016

We propose a notion of graph convergence that interpolates between the Benjamini--Schramm convergence of bounded degree graphs and the dense graph convergence developed by Laszlo Lovasz and his…

Bayesian Models of Graphs, Arrays and Other Exchangeable Random Structures

- Computer Science, MathematicsIEEE Transactions on Pattern Analysis and Machine Intelligence
- 2015

An introduction to Bayesian models of graphs, matrices, and other data that can be modeled by random structures is provided and results in probability theory are described that generalize de Finetti’s theorem to such data.

## References

SHOWING 1-9 OF 9 REFERENCES

Szemerédi’s Lemma for the Analyst

- Mathematics
- 2007

Abstract.Szemerédi’s regularity lemma is a fundamental tool in graph theory: it has many applications to extremal graph theory, graph property testing, combinatorial number theory, etc. The goal of…

Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing

- Mathematics
- 2007

Testing properties of graphs and functions

- Mathematics
- 2008

We define an analytic version of the graph property testing problem, which can be formulated as studying an unknown 2-variable symmetric function through sampling from its domain and studying the…

Large Networks and Graph Limits

- MathematicsColloquium Publications
- 2012

Laszlo Lovasz has written an admirable treatise on the exciting new theory of graph limits and graph homomorphisms, an area of great importance in the study of large networks.

Classical descriptive set theory

- Mathematics
- 1987

Descriptive set theory has been one of the main areas of research in set theory for almost a century. This text attempts to present a largely balanced approach, which combines many elements of the…

Sur les multi-applications mesurables

- Mathematics
- 1967

© AFCET, 1967, tous droits réservés. L’accès aux archives de la revue « Revue française d’informatique et de recherche opérationnelle » implique l’accord avec les conditions générales d’utilisation…

A general theorem on selectors

- Bulletin de l’Academie Polonaise des Sciences; Serie des Sciences Mathèmatiques, Astronomiques et Physiques,
- 1965