English
Related papers

Related papers: Kesten's theorem for Invariant Random Subgroups

200 papers

We prove that every $2d$-regular unimodular random network carries an invariant random Schreier decoration. Equivalently, it is the Schreier coset graph of an invariant random subgroup of the free group $F_d$. As a corollary we get that…

Group Theory · Mathematics 2019-06-10 László Márton Tóth

Let $X=G/K$ be an irreducible Hermitian symmetric space of the non-compact type and let $S\in G^\mbb{C}$ be the associated compression semi-group. Let $\Gamma$ be a discrete subgroup of $G$. We give a sufficient condition for…

Complex Variables · Mathematics 2010-09-29 Christian Miebach

Let $\Gamma$ be a distance-regular graph with diameter $d$ and Kneser graph $K=\Gamma_d$, the distance-$d$ graph of $\Gamma$. We say that $\Gamma$ is partially antipodal when $K$ has fewer distinct eigenvalues than $\Gamma$. In particular,…

Combinatorics · Mathematics 2014-09-19 M. A. Fiol

Random walks on a graph reflect many of its topological and spectral properties, such as connectedness, bipartiteness and spectral gap magnitude. In the first part of this paper we define a stochastic process on simplicial complexes of…

Combinatorics · Mathematics 2017-02-20 Ori Parzanchevski , Ron Rosenthal

In this paper, we introduce the concept of $k$-integral graphs. A graph $\Gamma$ is called $k$-integral if the extension degree of the splitting field of the characteristic polynomial of $\Gamma$ over rational field $\mathbb Q$ is equal to…

Combinatorics · Mathematics 2025-08-06 Alireza Abdollahi , Majid Arezoomand , Tao Feng , Shixin Wang

We prove that asymptotically almost surely, the random Cayley sum graph over a finite abelian group $G$ has edge density close to the expected one on every induced subgraph of size at least $\log^c |G|$, for any fixed $c > 1$ and $|G|$…

Combinatorics · Mathematics 2017-10-24 Sergei Konyagin , Ilya D. Shkredov

We investigate invariants for random elements of different hyperbolic groups. We provide a method, using Cayley graphs of groups, to compute the probability distribution of the minimal length of a random word, and explicitly compute the…

Mathematical Physics · Physics 2007-05-23 Sergei Nechaev , Raphael Voituriez

Let G be a finite graph with the non-k-order property (essentially, a uniform finite bound on the size of an induced sub-half-graph). A major result of the paper applies model-theoretic arguments to obtain a stronger version of…

Logic · Mathematics 2015-08-20 M. Malliaris , S. Shelah

A connected, locally finite graph $\Gamma$ is a Cayley--Abels graph for a totally disconnected, locally compact group $G$ if $G$ acts vertex-transitively with compact, open vertex stabilizers on $\Gamma$. Define the minimal degree of $G$ as…

Group Theory · Mathematics 2021-05-27 Arnbjörg Soffía Árnadóttir , Waltraud Lederle , Rögnvaldur G. Möller

All Cayley representations of the distant graph $\Gamma _Z$ over integers are characterized as Neumann subgroups of the extended modular group. Possible structures of Neumann subgroups are revealed and it is shown that every such a…

Group Theory · Mathematics 2020-10-20 Andrzej Matraś , Artur Siemaszko

We study the derangement graph $\Gamma_n$ whose vertex set consists of all permutations of $\{1,\ldots,n\}$, where two vertices are adjacent if and only if their corresponding permutations differ at every position. It is well-known that…

Combinatorics · Mathematics 2025-08-19 Mengyu Cao , Mei Lu , Zequn Lv , Xiamiao Zhao

Answering a question of Benjamini, we present an isometry-invariant random partition of the Euclidean space $\mathbb{R}^d$, $d\geq 3$, into infinite connected indistinguishable pieces, such that the adjacency graph defined on the pieces is…

Probability · Mathematics 2021-04-12 Adam Timar

We say that a $d$-regular graph is a $\gamma$-expander if for every not too large set of vertices $S$, there are at least $\gamma d |S|$ edges leaving $S$, and we say that a graph $G$ is $\gamma$-far from bipartite if at least $\gamma e(G)$…

Combinatorics · Mathematics 2026-05-15 Domagoj Bradač , Oliver Janzer

Let $\Gamma$ be a finite connected $G$-vertex-transitive graph and let $v$ be a vertex of $\Gamma$. If the permutation group induced by the action of the vertex-stabiliser $G_v$ on the neighbourhood $\Gamma(v)$ is permutation isomorphic to…

Combinatorics · Mathematics 2012-11-15 Pablo Spiga , Gabriel Verret

For a transitive infinite connected graph $G$, let $\mu(G)$ be its connective constant. Denote by $\mathbf{\cal G}$ the set of Cayley graphs for finitely generated infinite groups with an infinite-order generator which is independent of…

Probability · Mathematics 2014-10-10 He Song , Kai-Nan Xiang , Song-Chao-Hao Zhu

For a reductive group scheme over a regular semi-local ring, we prove an equivarinat version of the Gersten conjecture. We draw some interesting consequences for the representation rings of such reductive group schemes. We also prove the…

Algebraic Geometry · Mathematics 2009-06-23 Amalendu Krishna

For a graph $\Gamma$ and group $G$, $G^\Gamma$ is the subgroup of $G^{|\Gamma|}$ generated by elements with $g$ in the coordinates corresponding to $v$ and its neighbors in $\Gamma$. There is a natural epimorphism $G^\Gamma \to…

Combinatorics · Mathematics 2025-10-14 Gabe Cunningham , Igor Minevich

Let $\Gamma$ be a connected $7$-valent symmetric Cayley graph on a finite non-abelian simple group $G$. If $\Gamma$ is not normal, Li {\em et al.} [On 7-valent symmetric Cayley graphs of finite simple groups, J. Algebraic Combin. 56 (2022)…

Group Theory · Mathematics 2024-10-08 Xing Zhang , Yan-Quan Feng , Fu-Gang Yin , Hong Wang

An important ingredient in the completion theorem of equivariant K-theory given by S. Jackowski is that the representation ring R(Gamma) of a compact Lie group satisfies two restriction properties called (N) and (R\_{F}). We give in this…

Algebraic Topology · Mathematics 2007-05-23 Abdelouahab Arouche

Let $\Gamma$ be a graph with vertex set $V$, and let $a$ and $b$ be nonnegative integers. A subset $C$ of $V$ is called an $(a,b)$-regular set in $\Gamma$ if every vertex in $C$ has exactly $a$ neighbors in $C$ and every vertex in…

Combinatorics · Mathematics 2022-11-04 Yanpeng Wang , Binzhou Xia , Sanming Zhou