Related papers: Rotor-routing and spanning trees on planar graphs

Given an action by a finitely generated group G on a locally finite tree T, we view points of the visual boundary \partialT as directions in T and use {\rho} to lift this sense of direction to G. For each point E \in \partialT, this allows…

Let $\tau(G)$ and $\tau_G(e)$ be the number of spanning trees of a connected graph $G$ and the number of spanning trees of $G$ containing edge $e$. The ratio $d_{G}(e)=\tau_{G}(e)/\tau(G)$ is called the spanning tree edge density of $e$, or…

The abelian sandpile models feature a finite abelian group G generated by the operators corresponding to particle addition at various sites. We study the canonical decomposition of G as a product of cyclic groups G = Z_{d_1} X Z_{d_2} X…

Random walks in a finite Abelian group $G$ are studied. They use Markov chains with doubly stochastic transition matrices, in a Birkhoff subpolytope ${\cal B}(G)$ associated with the group $G$. It is shown that all future probability…

In 1989, Zehavi and Itai conjectured that every $k$-connected graph contains $k$ independent spanning trees rooted at any prescribed vertex $r$. That is, for each vertex $v$, the unique $r$-$v$ paths within these $k$ spanning trees are…

We show that every connected graph $G$ has a tree decomposition indexed by a tree $T$ such that $T$ is a subgraph of $G$ and the width of the tree decomposition is bounded from above by a function of the pathwidth of $G$. This answers a…

For any tracial non-commutative probability space $(\mathcal{A}, \varphi)$, C\'{e}bron, Dahlqvist, and Male showed that one can always construct an enveloping traffic space $(\mathcal{G}(\mathcal{A}), \tau_\varphi)$ that extends the trace.…

Let T be a d-regular tree (d > 2) and A=Aut(T), its automorphism group. Let G be a group generated by n independent Haar-random elements of A. We show that almost surely, every nontrivial element of G has finitely many fixed points on T.

Graphical parking functions, or $G$-parking functions, are a generalization of classical parking functions which depend on a connected multigraph $G$ having a distinguished root vertex. Gaydarov and Hopkins characterized the relationship…

The routing number is a graph invariant introduced by Alon, Chung, and Graham in 1994, and it has been studied for trees and other classes of graphs such as hypercubes. It gives the minimum number of routing steps needed to sort a set of…

Consider a connected graph $G=(E,V)$ with $N=|V|$ vertices. The main purpose of this paper is to explore the question of uniform sampling of a subtree of $G$ with $n$ nodes, for some $n\leq N$ (the spanning tree case correspond to $n=N$,…

Let $G$ be a compact Hausdorff topological group acting on a compact Hausdorff topological space $X$. Within the $C^{*}$-algebra $C(X)$ of all continuous complex-valued functions on $X$, there is the Peter-Weyl algebra $\mathcal{P}_G(X)$…

We construct a tree-based dependence structure for the representation of binomial, Poisson and Gaussian random vectors having a given covariance matrix, using sums of independent random variables. This construction allows us to characterize…

Let $G$ be a (multi) graph on the vertex set $V=\{0,1,\ldots ,n\}$ with root $0$. The $G$-parking function ideal $\mathcal{M}_G$ is a monomial ideal in the polynomial ring $R=\mathbb{K}[x_1,\ldots ,x_n]$ over a field $\mathbb{K}$ such that…

Taking a Feynman categorical perspective, several key aspects of the geometry of surfaces are deduced from combinatorial constructions with graphs. This provides a direct route from combinatorics of graphs to string topology operations via…

There is a recently discovered connection between the spectral theory of Schr\"o-dinger operators whose potentials exhibit aperiodic order and that of Laplacians associated with actions of groups on regular rooted trees, as Grigorchuk's…

A bar-joint framework $(G,p)$ in Euclidean $d$-space is rigid if the only edge-length-preserving continuous motions arise from isometries of $\mathbb{R}^d$. In the generic case, rigidity is determined by the generic $d$-dimensional rigidity…

We define the Laplacian matrix and the Jacobian group of a finite graph of groups. We prove analogues of the matrix tree theorem and the class number formula for the order of the Jacobian of a graph of groups. Given a group $G$ acting on a…

Let G be a Lie groupoid over M such that the target-source map from G to M x M is proper. We show that, if O is an orbit of finite type (i.e. which admits a proper function with finitely many critical points), then the restriction G|U of G…

There are several good reasons you might want to read about uniform spanning trees, one being that spanning trees are useful combinatorial objects. Not only are they fundamental in algebraic graph theory and combinatorial geometry, but they…