相关论文: On the scaling limit of finite vertex transitive g…

Benjamini, Finucane and the first author have shown that if (G_n,S_n) is a sequence of Cayley graphs such that |S_n^n|=O(n^D|S_n|), then the sequence (G_n,d_{S_n}/n) is relatively compact for the Gromov-Hausdorff topology and every cluster…

Let $(G_n)$ be a sequence of finite connected vertex-transitive graphs with volume tending to infinity. We say that a sequence of parameters $(p_n)$ is a percolation threshold if for every $\varepsilon > 0$, the proportion $\left\lVert K_1…

Let $G$ be a finite, connected metric graph and let $X\subseteq G$ be a subset. If $X$ is sufficiently dense in $G$, we show that the Gromov--Hausdorff distance matches the Hausdorff distance, namely $d_\gh(G,X)=d_\h(G,X)$. When the metric…

We study the scaling limit of essentially simple triangulations on the torus. We consider, for every $n\geq 1$, a uniformly random triangulation $G_n$ over the set of (appropriately rooted) essentially simple triangulations on the torus…

Let $p(Y_1, \dots, Y_d, Z_1, \dots, Z_e)$ be a self-adjoint noncommutative polynomial, with coefficients from $\mathbb{C}^{r \times r}$, in the indeterminates $Y_1, \dots, Y_d$ (considered to be self-adjoint), the indeterminates $Z_1,…

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 finite graph embedded in the plane is called a series-parallel map if it can be obtained from a finite tree by repeatedly subdividing and doubling edges. We study the scaling limit of weighted random two-connected series-parallel maps…

We show that the Brownian continuum random tree is the Gromov-Hausdorff-Prohorov scaling limit of the uniform spanning tree on high-dimensional graphs including the $d$-dimensional torus $\mathbb{Z}_n^d$ with $d>4$, the hypercube…

We apply the theory of unimodular random rooted graphs to study the metric geometry of large, finite, bounded degree graphs whose diameter is proportional to their volume. We prove that for a positive proportion of the vertices of such a…

We study infinite graph-directed iterated function systems (GIFS) whose underlying graph is not strongly connected and has countably many vertices and edges. In addition to a summability condition for the physical potential, we provide…

We study the uniform random graph $\mathsf{C}_n$ with $n$ vertices drawn from a subcritical class of connected graphs. Our main result is that the rescaled graph $\mathsf{C}_n / \sqrt{n}$ converges to the Brownian Continuum Random Tree…

Let $k$ be an integer. We prove a rough structure theorem for separations of order at most $k$ in finite and infinite vertex transitive graphs. Let $G = (V,E)$ be a vertex transitive graph, let $A \subseteq V$ be a finite vertex-set with…

An infinite graph is quasi-transitive if its vertex set has finitely many orbits under the action of its automorphism group. In this paper we obtain a structure theorem for locally finite quasi-transitive graphs avoiding a minor, which is…

We prove that the stack-number of the strong product of three $n$-vertex paths is $\Theta(n^{1/3})$. The best previously known upper bound was $O(n)$. No non-trivial lower bound was known. This is the first explicit example of a graph…

Let $(G_n) = \left((V_n,E_n)\right)$ be a sequence of finite connected vertex-transitive graphs with uniformly bounded vertex degrees such that $\lvert V_n \rvert \to \infty$ as $n \to \infty$. We say that percolation on $G_n$ has a sharp…

We consider a formal discretisation of Euclidean quantum gravity defined by a statistical model of random $3$-regular graphs and making using of the Ollivier curvature, a coarse analogue of the Ricci curvature. Numerical analysis shows that…

We consider a point cloud $X_n := \{ x_1, \dots, x_n \}$ uniformly distributed on the flat torus $\mathbb{T}^d : = \mathbb{R}^d / \mathbb{Z}^d $, and construct a geometric graph on the cloud by connecting points that are within distance…

We prove a quantitative, finitary version of Trofimov's result that a connected, locally finite vertex-transitive graph G of polynomial growth admits a quotient with finite fibres on which the action of Aut(G) is virtually nilpotent with…

In 2018, Dankelmann, Gao, and Surmacs [J. Graph Theory, 88(1): 5--17, 2018] established sharp bounds on the oriented diameter of a bridgeless undirected graph and a bridgeless undirected bipartite graph in terms of vertex degree. In this…

We prove that if $(X_n)_{n\geq 0}$ is a random walk on a transient graph such that the Green's function decays at least polynomially along the random walk, then $(X_n)_{n\geq 0}$ has infinitely many cut times almost surely. This condition…