相关论文: Uniqueness of the infinite tree in low-dimensional…

We present a new algorithm for generating a uniformly random spanning tree in an undirected graph. Our algorithm samples such a tree in expected $\tilde{O}(m^{4/3})$ time. This improves over the best previously known bound of…

The Rabin tree theorem yields an algorithm to solve the satisfiability problem for monadic second-order logic over infinite trees. Here we solve the probabilistic variant of this problem. Namely, we show how to compute the probability that…

We study the problem of estimating the density $f(\boldsymbol x)$ of a random vector ${\boldsymbol X}$ in $\mathbb R^d$. For a spanning tree $T$ defined on the vertex set $\{1,\dots ,d\}$, the tree density $f_{T}$ is a product of bivariate…

Magyar has shown that if $B \subset \mathbb{Z}^d$ has positive upper density $(d \geq 5)$, then the set of squared distances $\{ \|b_1-b_2 \|^2 \text{ }: \text{ } b_1,b_2 \in B \}$ contains an infinitely long arithmetic progression, whose…

We consider non-colliding Brownian lines above a hard wall, which are subject to geometrically growing (given by a parameter $\lambda>1$) area tilts, which we call the $\lambda$-tilted line ensemble (LE). The model was introduced by Caputo,…

We study a model of spatial random permutations over a discrete set of points. Formally, a permutation $\sigma$ is sampled proportionally to the weight $\exp\{-\alpha \sum_x V(\sigma(x)-x)\},$ where $\alpha>0$ is the temperature and $V$ is…

We establish tight bi-Lipschitz bounds certifying quasi-universality (universality up to a constant factor) for various distances between Reeb graphs: the interleaving distance, the functional distortion distance, and the functional…

Let $b$ be an integer greater than 1 and let $W^{\ee}=(W^{\ee}_n; n\geq 0)$ be a random walk on the $b$-ary rooted tree $\U_b$, starting at the root, going up (resp. down) with probability $1/2+\epsilon$ (resp. $1/2 -\epsilon$), $\epsilon…

Robertson and Seymour's celebrated Graph Minor Theorem states that graphs are well-quasi-ordered by the minor relation. Unlike the minor relation, the topological minor relation does not well-quasi-order graphs in general. Among all known…

We show that every Gromov hyperbolic group $\Ga$ admits a quasi-isometric embedding into the product of $(n+1)$ binary trees, where $n=\dim\di\Ga$ is the topological dimension of the boundary at infinity of $\Ga$.

We study the watermelon probabilities in the uniform spanning forests on the two-dimensional semi-infinite square lattice near either open or closed boundary to which the forests can or cannot be rooted, respectively. We derive universal…

We introduce a new spanning tree model called the random spanning tree in random environment (RSTRE), which interpolates between the uniform spanning tree and the minimum spanning tree as the inverse temperature (disorder strength) $\beta$…

A spanning tree $T$ in a graph $G$ is a sub-graph of $G$ with the same vertex set as $G$ which is a tree. In 1981, McKay proved an asymptotic result regarding the number of spanning trees in random $k$-regular graphs. In this paper we prove…

We prove that the infinite components of the Free Uniform Spanning Forest of a Cayley graph are indistinguishable by any invariant property, given that the forest is different from its wired counterpart. Similar result is obtained for the…

We prove that the existence of a non-special tree of size $\lambda$ is equivalent to the existence of an uncountably chromatic graph with no $K_{\omega_1}$ minor of size $\lambda$, establishing a connection between the special tree number…

We consider the Ising model on a general tree under various boundary conditions: all plus, free and spin-glass. In each case, we determine when the root is influenced by the boundary values in the limit as the boundary recedes to infinity.…

A tree ${\mathbb T} =\langle T\leq \rangle$ is reversible iff there is no order $\preccurlyeq \;\varsubsetneq \;\leq $ such that ${\mathbb T} \cong \langle T ,\preccurlyeq\rangle$. Using a characterization of reversibility via back and…

We prove that in both the free and the wired uniform spanning forest (FUSF and WUSF) of any unimodular random rooted network (in particular, of any Cayley graph), it is impossible to distinguish the connected components of the forest from…

We study the fundamental question of how likely it is that two randomly chosen trees are isomorphic to each other for different models of random trees. We show that the probability decays exponentially for rooted labeled trees as well as…

Let ${\mathbf T}_n$ be a uniformly random tree with vertex set $[n]=\{1,\ldots,n\}$, let $\Delta_{{\mathbf T}_n}$ be the largest vertex degree in ${\mathbf T}_n$, and let $\lambda_1({\mathbf T}_n),\ldots,\lambda_n({\mathbf T}_n)$ be the…