Related papers: Right-convergence of sparse random graphs
Action convergence provides a limit theory for linear bounded operators $A_n:L^{\infty}(\Omega_n)\longrightarrow L^1(\Omega_n)$ where $\Omega_n$ are potentially different probability spaces. This notion of convergence emerged in graph…
We view hyper-graphs as incidence graphs, i.e. bipartite graphs with a set of nodes representing vertices and a set of nodes representing hyper-edges, with two nodes being adjacent if the corresponding vertex belongs to the corresponding…
A sequence of $k$-uniform hypergraphs $H_1, H_2, \dots$ is convergent if the sequence of homomorphism densities $t(F, H_1), t(F, H_2), \dots$ converges for every $k$-uniform hypergraph $F$. For graphs, Lov\'asz and Szegedy showed that every…
We study topological and geometric functionals of $l_\infty$-random geometric graphs on the high-dimensional torus in a sparse regime, where the expected number of neighbors decays exponentially in the dimension. More precisely, we…
Inspired by previous work of Diaz, Petit, Serna, and Trevisan (Approximating layout problems on random graphs Discrete Mathematics, 235, 2001, 245--253), we show that several well-known graph layout problems are approximable to within a…
Motivated in part by various sequences of graphs growing under random rules (like internet models), convergent sequences of dense graphs and their limits were introduced by Borgs, Chayes, Lov\'asz, S\'os and Vesztergombi and by Lov\'asz and…
The theory of dense graph limits comes with a natural sampling process which yields an inhomogeneous variant G(n,W) of the Erdos-Renyi random graph. Here we study the clique number of these random graphs. We establish the concentration of…
We consider general Exponential Random Graph Models (ERGMs) where the sufficient statistics are functions of homomorphism counts for a fixed collection of simple graphs $F_k$. Whereas previous work has shown a degeneracy phenomenon in dense…
This paper concerns the large deviations of a system of interacting particles on a random graph. There is no stochasticity, and the only sources of disorder are the random graph connections, and the initial condition. The average number of…
We identify the scaling limit of random intersection graphs inside their critical windows. The limit graphs vary according to the clustering regimes, and coincide with the continuum Erdos--Renyi graph in two out of the three regimes. Our…
Random key graphs were introduced to study various properties of the Eschenauer-Gligor key predistribution scheme for wireless sensor networks (WSNs). Recently this class of random graphs has received much attention in contexts as diverse…
The theory of graphons comes with a natural sampling procedure, which results in an inhomogeneous variant of the Erd\H{o}s--R\'enyi random graph, called $W$-random graphs. We prove, via the method of moments, a limit theorem for the number…
In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of model theory and (functional) analysis. We show how the various…
In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…
In this paper we consider the Erd\H{o}s-R\'enyi random graph in the sparse regime in the limit as the number of vertices $n$ tends to infinity. We are interested in what this graph looks like when it contains many triangles, in two…
In this paper, we study convergence of coupled dynamical systems on convergent sequences of graphs to a continuum limit. We show that the solutions of the initial value problem for the dynamical system on a convergent graph sequence tend to…
The exponential random graph model (ERGM) is a central object in the study of clustering properties in social networks as well as canonical ensembles in statistical physics. Despite some breakthrough works in the mathematical understanding…
We introduce the notion of Benjamini-Schramm convergence for quantum graphs. This notion of convergence, intended to play the role of the already existing notion for discrete graphs, means that the restriction of the quantum graph to a…
We investigate structural properties of large, sparse random graphs through the lens of "sampling convergence" (Borgs et. al. (2017)). Sampling convergence generalizes left convergence to sparse graphs, and describes the limit in terms of a…
We consider sequences of large sparse random graphs whose degree distribution approaches a limit with finite mean. This model includes both the random regular graphs and the Erd\"os-Renyi graphs of constant average degree. We prove that the…