Related papers: Graphon convergence of random cographs
We show that if a sequence of dense graphs has the property that for every fixed graph F, the density of copies of F in these graphs tends to a limit, then there is a natural ``limit object'', namely a symmetric measurable 2-variable…
We study topological properties of random closed curves on an orientable surface $S$ of negative Euler characteristic. Letting $\gamma_{n}$ denote the conjugacy class of the $n^{th}$ step of a simple random walk on the Cayley graph driven…
Recently, variants of many classical extremal theorems have been proved in the random environment. We, complementing existing results, extend the Erd\H{o}s-Gallai Theorem in random graphs. In particular, we determine, up to a constant…
We obtain the scaling limits of random graphs drawn uniformly in three families of intersection graphs: permutation graphs, circle graphs, and unit interval graphs. The two first families typically generate dense graphs, in these cases we…
Graphings are special bounded-degree graphs on probability spaces, representing limits of graph sequences that are convergent in a local or local-global sense. We describe a procedure for turning the underlying space into a compact metric…
We study the spectral aspects of the graph limit theory. We give a description of graphon convergence in terms of converegnce of eigenvalues and eigenspaces. Along these lines we prove a spectral version of the strong regularity lemma.…
We study the linear eigenvalue statistics of large random graphs in the regimes when the mean number of edges for each vertex tends to infinity. We prove that for a rather wide class of test functions the fluctuations of linear eigenvalue…
Subgraph densities have been defined, and served as basic tools, both in the case of graphons (limits of dense graph sequences) and graphings (limits of bounded-degree graph sequences). While limit objects have been described for the…
We improve the bounds on the number of interval graphs on $n$ vertices. In particular, denoting by $I_n$ the quantity in question, we show that $\log I_n \sim n\log n$ as $n\to \infty$.
We define and study analogs of curve graphs for infinite type surfaces. Our definitions use the geometry of a fixed surface and vertices of our graphs are infinite multicurves which are bounded in both a geometric and a topological sense.…
We consider an inhomogeneous Erd\H{o}s-R\'enyi random graph ensemble with exponentially decaying random disconnection probabilities determined by an i.i.d. field of variables with heavy tails and infinite mean associated to the vertices of…
We consider the number of crossings in a graph which is embedded randomly on a convex set of points. We give an estimate to the normal distribution in Kolmogorov distance which implies a convergence rate of order $n^{-1/2}$ for various…
The relation between densities of cycles and the spectrum of a graphon, which implies that the spectra of convergent graphons converge, fundamentally relies on the self-adjointness of the linear operator associated with a graphon. In this…
We improve the estimates of the subgraph probabilities in a random regular graph. Using the improved results, we further improve the limiting distribution of the number of triangles in random regular graphs.
Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs. In this paper, we study the convergence of a random tree sequence where the…
The goal of this paper is to provide a general purpose result for the coupling of exploration processes of random graphs, both undirected and directed, with their local weak limits when this limit is a marked Galton-Watson process. This…
We consider a random object that is associated with both random walks and random media, specifically, the superposition of a configuration of subcritical Bernoulli percolation on an infinite connected graph and the trace of the simple…
As a discrete analogue of Kac's celebrated question on "hearing the shape of a drum", and towards a practical graph isomorphism test, it is of interest to understand which graphs are determined up to isomorphism by their spectrum (of their…
Clustering $\unicode{x2013}$ the tendency for neighbors of nodes to be connected $\unicode{x2013}$ quantifies the coupling of a complex network to its latent metric space. In random geometric graphs, clustering undergoes a continuous phase…
We consider two classes of natural stochastic processes on finite unlabeled graphs. These are Euclidean stochastic optimization algorithms on the adjacency matrix of weighted graphs and a modified version of the Metropolis MCMC algorithm on…