graph limits
Recently Published Documents


TOTAL DOCUMENTS

45
(FIVE YEARS 4)

H-INDEX

7
(FIVE YEARS 0)

Author(s):  
László Lovász

AbstractThe theory of graph limits is only understood to a somewhat satisfactory degree in the cases of dense graphs and of bounded degree graphs. There is, however, a lot of interest in the intermediate cases. It appears that one of the most important constituents of graph limits in the general case will be Markov spaces (Markov chains on measurable spaces with a stationary distribution). This motivates our goal to extend some important theorems from finite graphs to Markov spaces or, more generally, to measurable spaces. In this paper, we show that much of flow theory, one of the most important areas in graph theory, can be extended to measurable spaces. Surprisingly, even the Markov space structure is not fully needed to get these results: all we need a standard Borel space with a measure on its square (generalizing the finite node set and the counting measure on the edge set). Our results may be considered as extensions of flow theory for directed graphs to the measurable case.


Author(s):  
Ashwin Sah ◽  
Mehtaab Sawhney ◽  
Jonathan Tidor ◽  
Yufei Zhao

Abstract Bollobás and Riordan, in their paper ‘Metrics for sparse graphs’, proposed a number of provocative conjectures extending central results of quasirandom graphs and graph limits to sparse graphs. We refute these conjectures by exhibiting a sequence of graphs with convergent normalized subgraph densities (and pseudorandom C4-counts), but with no limit expressible as a kernel.


2020 ◽  
pp. 1-50
Author(s):  
Ágnes Backhausz ◽  
Balázs Szegedy

Abstract We present a new approach to graph limit theory that unifies and generalizes the two most well-developed directions, namely dense graph limits (even the more general $L^p$ limits) and Benjamini–Schramm limits (even in the stronger local-global setting). We illustrate by examples that this new framework provides a rich limit theory with natural limit objects for graphs of intermediate density. Moreover, it provides a limit theory for bounded operators (called P-operators) of the form $L^\infty (\Omega )\to L^1(\Omega )$ for probability spaces $\Omega $ . We introduce a metric to compare P-operators (for example, finite matrices) even if they act on different spaces. We prove a compactness result, which implies that, in appropriate norms, limits of uniformly bounded P-operators can again be represented by P-operators. We show that limits of operators, representing graphs, are self-adjoint, positivity-preserving P-operators called graphops. Graphons, $L^p$ graphons, and graphings (known from graph limit theory) are special examples of graphops. We describe a new point of view on random matrix theory using our operator limit framework.


2020 ◽  
Vol 29 (5) ◽  
pp. 722-746
Author(s):  
Emma Yu Jin ◽  
Benedikt Stufler

AbstractWe study random unlabelled k-trees by combining the colouring approach by Gainer-Dewar and Gessel (2014) with the cycle-pointing method by Bodirsky, Fusy, Kang and Vigerske (2011). Our main applications are Gromov–Hausdorff–Prokhorov and Benjamini–Schramm limits that describe their asymptotic geometric shape on a global and local scale as the number of (k + 1)-cliques tends to infinity.


2019 ◽  
Vol 138 ◽  
pp. 1-40 ◽  
Author(s):  
Dávid Kunszenti-Kovács ◽  
László Lovász ◽  
Balázs Szegedy
Keyword(s):  

2018 ◽  
Vol 340 ◽  
pp. 819-854 ◽  
Author(s):  
Jacob W. Cooper ◽  
Daniel Král' ◽  
Taísa L. Martins
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document