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

We analyze a class of spatial random spanning trees built on a realization of a homogeneous Poisson point process of the plane. This tree has a simple radial structure with the origin as its root. We first use stochastic geometry arguments…

Let $M$ be a regular matroid. The Jacobian group ${\rm Jac}(M)$ of $M$ is a finite abelian group whose cardinality is equal to the number of bases of $M$. This group generalizes the definition of the Jacobian group (also known as the…

Suppose that $G_j$ is a sequence of finite connected planar graphs, and in each $G_j$ a special vertex, called the root, is chosen randomly-uniformly. We introduce the notion of a distributional limit $G$ of such graphs. Assume that the…

For any given graph $G$ consider a graph $\widetilde{G}$ which is a cone over graph $G.$ In this paper, we study two important invariants of such a cone. Namely, complexity (the number of spanning trees) and the Jacobian of a graph. We…

Let $G$ be a simple strongly connected weighted directed graph. Let $\mathcal{G}$ denote the spanning tree graph of $G$. That is, the vertices of $\mathcal{G}$ consist of the directed rooted spanning trees on $G$, and the edges of…

Kirchhoff's matrix tree theorem is a well-known result that gives a formula for the number of spanning trees in a finite, connected graph in terms of the graph Laplacian matrix. A closely related result is Wilson's algorithm for putting the…

The Disjoint Paths Problem asks, given a graph $G$ and a set of pairs of terminals $(s_{1},t_{1}),\ldots,(s_{k},t_{k})$, whether there is a collection of $k$ pairwise vertex-disjoint paths linking $s_{i}$ and $t_{i}$, for $i=1,\ldots,k.$ In…

The paper is divided in to two parts. In the first part we present some new results for the \textit{routing via matching} model introduced by Alon et al\cite{5}. This model can be viewed as a communication scheme on a distributed network.…

Let G be a finite group. We explore the model theoretic properties of the class of differential fields of characteristic zero in m commuting derivations equipped with a G-action by differential field automorphisms. In the language of…

Let $G$ be a group and let ${\mathcal G}$ be a free factor system of $G$, namely a free splitting of $G$ as $G=G_1*\dots*G_k*F_r$. In this paper, we study the set of train track points for ${\mathcal G}$-irreducible automorphisms $\phi$…

Let $G$ be a finite group. To every smooth $G$-action on a compact, connected and oriented Riemann surface we can associate its data of singular orbits. The set of such data becomes an Abelian group $B_G$ under the $G$-equivariant connected…

We prove a general result about the decomposition on ergodic components of group actions on boundaries of spherically homogeneous rooted trees. Namely, we identify the space of ergodic components with the boundary of the orbit tree…

Reid-Smith recently parametrised groups acting on trees with Tits' independence property (P) using graph-based combinatorial structures known as local action diagrams. Properties of the acting (topological) group, such as being locally…

The classical Gaussian functor associates to every orthogonal representation of a locally compact group $G$ a probability measure preserving action of $G$ called a Gaussian action. In this paper, we generalize this construction by…

We study group actions on multitrees, which are directed graphs in which there is at most one directed path between any two vertices. In our main result we describe a six-term exact sequence in $K$-theory for the reduced crossed product…

Undirected graphical models encode in a graph $G$ the dependency structure of a random vector $Y$. In many applications, it is of interest to model $Y$ given another random vector $X$ as input. We refer to the problem of estimating the…

We prove two results on the classification of trivial Legendrian embeddings $g: G \rightarrow (S^3,\xi_{std})$ of planar graphs. First, the oriented Legendrian ribbon $R_g$ and rotation invariant $\text{rot}_g$ are a complete set of…

Jim Propp's P-machine, also known as the "rotor router model" is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to randomly chosen neighbors, it serves the neighbors in a fixed order.…

We show that if a group G acts isometrically on a locally finite leafless R-tree inducing a two-transitive action on its ends, then this tree is determined by the action of G on the boundary. As a corollary we obtain that locally finite…

We study a variant of Gilbert's disc model, in which discs are positioned at the points of a Poisson process in $\mathbb{R}^2$ with radii determined by an underlying stationary and ergodic random field $\varphi:\mathbb{R}^2\to[0,\infty)$,…