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

Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deterministic spreading rule with a fixed parameter k: if a vacant site has…

We introduce a symmetric monoidal $\infty$-category $\mathrm{GrCob}$ of graph cobordisms between spaces, and use the homology of its morphism spaces to define string operations. Precisely, for an $E_\infty$-ring spectrum $R$ and an oriented…

Let $G$ be a finite graph with minimum degree $r$. Form a random subgraph $G_p$ of $G$ by taking each edge of $G$ into $G_p$ independently and with probability $p$. We prove that for any constant $\epsilon>0$, if $p=\frac{1+\epsilon}{r}$,…

The correspondence between weighted undirected graphs and reversible Markov chains via vertex random walks is simple and well known. Leveraging this correspondence and ideas from the theory of dynamical systems, we study the structural…

The Jacobian group ${\rm Jac}(G)$ of a finite graph $G$ is a group whose cardinality is the number of spanning trees of $G$. $G$ also has a tropical Jacobian which has the structure of a real torus; using the notion of break divisors, An et…

We consider random graphs in which the edges are allowed to be dependent. In our model the edge dependence is quite general, we call it $p$-robust random graph. It means that every edge is present with probability at least $p$, regardless…

We consider the Dyson hierarchical graph $\mathcal{G}$, that is a weighted fully-connected graph, where the pattern of weights is ruled by the parameter $\sigma \in (1/2, 1]$. Exploiting the deterministic recursivity through which…

On a finite graph, there is a natural family of Boltzmann probability measures on cycle-rooted spanning forests, parametrized by weights on cycles. For a certain subclass of those weights, we construct Gibbs measures in infinite volume, as…

The $k$-rainbow independent domination number of a graph $G$, denoted $\gamma_{\rm rik}(G)$, is the cardinality of a smallest set consisting of two vertex-disjoint independent sets $V_1$ and $V_2$ for which every vertex in $V(G)\setminus…

Flip graphs of non-crossing configurations in the plane are widely studied objects, e.g., flip graph of triangulations, spanning trees, Hamiltonian cycles, and perfect matchings. Typically, it is an easy exercise to prove connectivity of a…

Sood and Grassberger studied in [Phys. Rev. Lett. 99, 098701 (2007)] random walks on random graphs that are biased towards a fixed target point. They put forward a critical bias strength b_c such that a random walker on an infinite graph…

Let $G$ be a finite connected graph, and let $T$ be a spanning tree of $G$ chosen uniformly at random. The work of Kirchhoff on electrical networks can be used to show that the events $e_1 \in T$ and $e_2 \in T$ are negatively correlated…

We consider a rank one group $G = \langle A,B \rangle $ which acts cubically on a module $V$, this means $[V,A,A,A] =0$ but $[V,G,G,G] \ne 0$. We have to distinguish whether the group $A_0 :=C_A([V,A]) \cap C_A(V/C_V(A))$ is trivial or not.…

Message broadcasting in networks could be carried over spanning trees. A set of spanning trees in the same network is node independent if two conditions are satisfied. First, all trees are rooted at node $r$. Second, for every node $u$ in…

Let G be a countable group which acts by isometries on a separable, but not necessarily proper, Gromov hyperbolic space X. We say the action of G is weakly hyperbolic if G contains two independent hyperbolic isometries. We show that a…

Continuing the study of Hamiltonian pseudo-rotations of projective spaces, we focus on the conjecture that the fixed-point data set (the actions and the linearized flows at one-periodic orbits) of a pseudo-rotation exactly matches that data…

For a class $\mathcal C$ of graphs $G$ equipped with functions $f_G$ defined on subsets of $E(G)$ or $V(G)$, we say that $\mathcal{C}$ is $k$-scattered with respect to $f_G$ if there exists a constant $\ell$ such that for every graph $G\in…

We prove a refinement of Pixton's formula for the double ramification cycle with target variety which takes into account the correlator of a rubber map previously introduced by the authors. To do so, we need to: reinterpret the correlator…

It is shown, for a given graph group $G$, that the fixed point subgroup Fix$\,\varphi$ is finitely generated for every endomorphism $\varphi$ of $G$ if and only if $G$ is a free product of free abelian groups. The same conditions hold for…

We show some of the conjectures of Pappas and Rapoport concerning the moduli stack of $\mathcal{G}$-torsors on a curve C, where $\mathcal{G}$ is a semisimple Bruhat-Tits group scheme on C. In particular we prove the analog of the…