University of Cambridge > > Combinatorics Seminar > Graphons and Graphexes as Limits of Sparse Graphs: Part I

Graphons and Graphexes as Limits of Sparse Graphs: Part I

Add to your list(s) Download to your calendar using vCal

  • UserJennifer Chayes (Microsoft Research New England)
  • ClockThursday 05 April 2018, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact Andrew Thomason.

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 alternative 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, to be given by Jennifer Chayes, 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.

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity