Related papers: Limits of random tree-like discrete structures

We study limits of the largest connected components (viewed as metric spaces) obtained by critical percolation on uniformly chosen graphs and configuration models with heavy-tailed degrees. For rank-one inhomogeneous random graphs, such…

In the critical beta-splitting model of a random $n$-leaf rooted tree, clades are recursively split into sub-clades, and a clade of $m$ leaves is split into sub-clades containing $i$ and $m-i$ leaves with probabilities $\propto 1/(i(m-i))$.…

We consider Erd\H{o}s-R\'{e}nyi graphs $G(n,p_n)$ with large constant expected degree $\lambda$ and $p_n=\lambda/n$. Bordenave and Lelarge (2010) showed that the infinite-volume limit, in the Benjamini-Schramm topology, is a Galton-Watson…

We investigate the random continuous trees called L\'evy trees, which are obtained as scaling limits of discrete Galton-Watson trees. We give a mathematically precise definition of these random trees as random variables taking values in the…

In this article, we develop a theory for understanding the traces left by a random walk in the vicinity of a randomly chosen reference vertex. The analysis is related to interlacements but goes beyond previous research by showing weak limit…

For random matrices with tree-like structure there exists a recursive relation for the local Green functions whose solution permits to find directly many important quantities in the limit of infinite matrix dimensions. The purpose of this…

We prove that a uniform rooted plane map with n edges converges in distribution after a suitable normalization to the Brownian map for the Gromov-Hausdorff topology. A recent bijection due to Ambj{\o}rn and Budd allows to derive this result…

We prove some asymptotic results for the radius and the profile of large random bipartite planar maps. Using a bijection due to Bouttier, Di Francesco and Guitter between rooted bipartite planar maps and certain two-type trees with positive…

In our previous work, we introduced the random $k$-cut number for rooted graphs. In this paper, we show that the distribution of the $k$-cut number in complete binary trees of size $n$, after rescaling, is asymptotically a periodic function…

Consider a set of $n$ vertices, where each vertex has a location in $\mathbb{R}^d$ that is sampled uniformly from the unit cube in $\mathbb{R}^d$, and a weight associated to it. Construct a random graph by placing edges independently for…

We study vectors chosen at random from a compact convex polytope in $\mathbb{R}^n$ given by a finite number of linear constraints. We determine which projections of these random vectors are asymptotically normal as $n\to\infty$. Marginal…

We study the random simple connected cubic planar graph $\mathsf{C}_n$ with an even number $n$ of vertices. We show that the Brownian map arises as Gromov--Hausdorff--Prokhorov scaling limit of $\mathsf{C}_n$ as $n \in 2 \ndN$ tends to…

A central limit theorem for binary tree is numerically examined. Two types of central limit theorem for higher-order branches are formulated. A topological structure of a binary tree is expressed by a binary sequence, and the…

We consider a uniform spanning tree in a $\delta$-square grid approximation of a planar domain $\Omega$. For given integer $n\ge 2$, we condition the tree on the following $n$-arm event: we pick $n$ branches, emanating from $n$ points…

This paper is a variation on the uniform spanning tree theme. We use random spanning forests to solve the following problem: for a Markov process on a finite set of size $n$, find a probability law on the subsets of any given size $m \leq…

This research establishes that many real-world networks exhibit bounded expansion, a strong notion of structural sparsity, and demonstrates that it can be leveraged to design efficient algorithms for network analysis. We analyze several…

This paper finds the bulk local limit of the swap process of uniformly random sorting networks. The limit object is defined through a deterministic procedure, a local version of the Edelman-Greene algorithm, applied to a two dimensional…

A weighted recursive tree is an evolving tree in which vertices are assigned random vertex-weights and new vertices connect to a predecessor with a probability proportional to its weight. Here, we study the maximum degree and near-maximum…

We prove a distributional limit theorem conjectured in [Journal of Statistical Physics 174, No. 6, 1372-1403 (2019)] for partition functions defining models of directed polymers on diamond hierarchical graphs with disorder variables placed…

A wide variety of complex networks (social, biological, information etc.) exhibit local clustering with substantial variation in the clustering coefficient (the probability of neighbors being connected). Existing models of large graphs…