00:00:00 / 00:00:00

Graphons and graphexes as limits of sparse graphs - lecture 2

By Christian Borgs

Appears in collection : Advances in Statistical Mechanics / Avancées en mécanique statistique

Graphons and graphexes are limits of graphs which allow us to model and estimate properties of large-scale networks. In this pair of talks, we review the theory of dense graph limits, and give two alterative theories for limits of sparse graphs – one leading to unbounded graphons over probability spaces, and the other leading to bounded graphons (and graphexes) over sigma-finite measure spaces. Talk I, given by Jennifer, will review the general theory, highlight the unbounded graphons, and show how they can be used to consistently estimate properties of large sparse networks. This talk will also give an application of these sparse graphons to collaborative filtering on sparse bipartite networks. Talk II, given by Christian, will recast limits of dense graphs in terms of exchangeability and the Aldous Hoover Theorem, and generalize this to obtain sparse graphons and graphexes as limits of subgraph samples from sparse graph sequences. This will provide a dual view of sparse graph limits as processes and random measures, an approach which allows a generalization of many of the well-known results and techniques for dense graph sequences.

Information about the video

Citation data

  • DOI 10.24350/CIRM.V.19442603
  • Cite this video Borgs Christian (8/28/18). Graphons and graphexes as limits of sparse graphs - lecture 2. CIRM. Audiovisual resource. DOI: 10.24350/CIRM.V.19442603
  • URL https://dx.doi.org/10.24350/CIRM.V.19442603

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow


  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
  • Get notification updates
    for your favorite subjects
Give feedback