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

We study network design with a cost structure motivated by redundancy in data traffic. We are given a graph, g groups of terminals, and a universe of data packets. Each group of terminals desires a subset of the packets from its respective…

In recent work, Jon Kleinberg considered a small-world network model consisting of a d-dimensional lattice augmented with shortcuts. The probability of a shortcut being present between two points decays as a power of the distance between…

Let $G_n$ be a linear crossed polyomino chain with $n$ four-order complete graphs. In this paper, explicit formulas for the Kirchhoff index, the multiplicative degree-Kirchhoff index and the number of spanning trees of $G_n$ are determined,…

We extend the classical coding of measured $\mathbb R$-trees by continuous excursion-type functions to c\`adl\`ag excursion-type functions through the notion of parametric representations. The main feature of this extension is its…

The real trees form a class of metric spaces that extends the class of trees with edge lengths by allowing behavior such as infinite total edge length and vertices with infinite branching degree. We use Dirichlet form methods to construct…

We investigate analogues of some of the classical results in homogeneous dynamics in non-linear setting. Let $G$ be a closed subgroup of the group of automorphisms of a biregular tree and $\Gamma<G$ a discrete subgroup. For a large class of…

We show that if a group $G$ acting faithfully on a rooted tree $T$ has a free subgroup, then either there exists a point $w$ of the boundary $\partial T$ and a free subgroup of $G$ with trivial stabilizer of $w$, or there exists…

The power graph $P(G)$ of a group $G$ is a simple graph with the vertex set $G$ such that two distinct vertices $u,v \in G$ are adjacent in $P(G)$ if and only if $u^m = v$ or $v^m = u$, for some $m \in \mathbb{N}$. The purpose of this paper…

For a finitely generated free group F_n, of rank at least 2, any finite subgroup of Out(F_n) can be realized as a group of automorphisms of a graph with fundamental group F_n. This result, known as Out(F_n) realization, was proved by…

A Markov chain is considered whose states are orderings of an underlying fixed tree and whose transitions are local "random-to-front" reorderings, driven by a probability distribution on subsets of the leaves. The eigenvalues of the…

To a weighted graph can be associated a bipartite graph planar algebra P. We construct and study the symmetric enveloping inclusion of P. We show that this construction is equivariant with respect to the automorphism group of P. The…

We propose a generalization of the concept of a Ribbon graph suitable to provide combinatorial models for marked surfaces equipped with a G-structure. Our main insight is that the necessary combinatorics is neatly captured in the concept of…

Let $G$ be a discrete countable infinite group. We show that each topological $(C,F)$-action $T$ of $G$ on a locally compact non-compact Cantor set is a free minimal amenable action admitting a unique up to scaling non-zero invariant Radon…

Symmetric edge polytopes of graphs and root polytopes of semi-balanced digraphs are two classes of lattice polytopes whose $h^*$-polynomials have interesting properties and generalize important graph polynomials. For both classes of…

We show that a group acting on a non-trivial tree with finite edge stabilizers and icc vertex stabilizers admits a faithful and highly transitive action on an infinite countable set. This result is actually true for infinite vertex…

We develop a mechanism of "isotropy separation for compact objects" that explicitly describes an invertible $G$-spectrum through its collection of geometric fixed points and gluing data located in certain variants of the stable module…

We define the action of a locally compact group $G$ on a topological graph $E$. This action induces a natural action of $G$ on the $C^*$-correspondence ${\mathcal H}(E)$ and on the graph $C^*$-algebra $C^*(E)$. If the action is free and…

For a complex connected reductive group G, we classify the simple modules whose cone of primitive vectors admits a nontrivial G-invariant deformation. We relate this classification to that of simple Jordan algebras, and to that (due to…

Local actions (actions of a vertex stabiliser on the neighbours of that vertex) have become an important approach to group actions on trees since J. Tits' introduction in 1970 of the independence property (P) and especially since a 2000…

Let $K$ be a field, and let $f\in K(z)$ be rational function. The preimages of a point $x_0\in P^1(K)$ under iterates of $f$ have a natural tree structure. As a result, the Galois group of the resulting field extension of $K$ naturally…