First talk: "Topics on graphons as limits of graph sequences I: Sampling" In this penultimate talk of the Graphon Seminar, we investigate the method of sampling from a graph as a method of gathering information about very large, dense graphs. We will talk about this method in the context of graphons and introduce the concept of a W-random graph for a graphon W. This talk is based on chapter 10 of the book "Large networks and graph limits" by Lászlo Lovász. Second talk: "Topics on graphons as limits of graph sequences II: Convergence of dense graph sequences" In this final talk of the Graphon Seminar, we take a closer look at how graphons arise as the limit of convergent sequences of dense graphs. This talk is based on chapter 11 of the book "Large networks and graph limits" by Lászlo Lovász.

---

온라인으로 진행예정

In this final talk of the Graphon Seminar, we take a closer look at how graphons arise as the limit of convergent sequences of dense graphs. This talk is based on chapter 11 of the book "Large networks and graph limits" by Lászlo Lovász.

In this final talk of the Graphon Seminar, we take a closer look at how graphons arise as the limit of convergent sequences of dense graphs. This talk is based on chapter 11 of the book "Large networks and graph limits" by Lászlo Lovász.

In this penultimate talk of the Graphon Seminar, we investigate the method of sampling from a graph as a method of gathering information about very large, dense graphs. We will talk about this method in the context of graphons and introduce the concept of a W-random graph for a graphon W. This talk is based on chapter 10 of the book "Large networks and graph limits" by Lászlo Lovász.