English
Related papers

Related papers: On cogrowth, amenability and the spectral radius o…

200 papers

In this article, we investigate some relations between dynamical and algebraic properties of semigroups of entire maps with applications to semigroups of formal series. We show that two entire maps fixing the origin share the set of…

Dynamical Systems · Mathematics 2024-08-12 C. Cabrera , P. Dominguez , P. Makienko

Random walks on the circle group $\mathbb{R}/\mathbb{Z}$ whose elementary steps are lattice variables with span $\alpha \not\in \mathbb{Q}$ or $p/q \in \mathbb{Q}$ taken mod $\mathbb{Z}$ exhibit delicate behavior. In the rational case we…

Probability · Mathematics 2024-02-20 Istvan Berkes , Bence Borda

We investigate a randomly evolving process of subgraphs in an underlying host graph using the spectral theory of semigroups related to the Tsetlin library and hyperplane arrangements. Starting with some initial subgraph, at each iteration,…

Combinatorics · Mathematics 2025-09-25 Fan Chung , Sawyer Jack Robertson

We study marginally compact macromolecular trees that are created by means of two different fractal generators. In doing so, we assume Gaussian statistics for the vectors connecting nodes of the trees. Moreover, we introduce bond-bond…

Soft Condensed Matter · Physics 2017-07-18 Maxim Dolgushev , Adrian L. Hauber , Philipp Pelagejcev , Joachim P. Wittmer

In this article, we introduce and explore the notion of topological amenability in the broad setting of (locally compact) semihypergroups. We acquire several stationary, ergodic and Banach algebraic characterizations of the same in terms of…

Functional Analysis · Mathematics 2023-11-29 Choiti Bandyopadhyay

The aim of this paper is twofold: (1) On the one hand, the paper revisits the spectral analysis of semigroups in a general Banach space setting. It presents some new and more general versions, and provides comprehensible proofs, of…

Analysis of PDEs · Mathematics 2014-10-07 Stéphane Mischler , Justine Scher

The cogrowth of a subgroup is defined as the growth of a set of coset representatives which are of minimal length. A subgroup is essential if it intersects non-trivially every non-trivial subgroup. The main result of this paper is that…

Group Theory · Mathematics 2008-02-03 Amnon Rosenmann

Using Rees index, the subsemigroup growth of free semigroups is investigated. Lower and upper bounds for the sequence are given and it is shown to have superexponential growth of strict type $n^n$ for finite free rank greater than 1. It is…

Group Theory · Mathematics 2014-09-30 Alex Bailey , Martin Finn-Sell , Robert Snocken

We prove a new inequality bounding the probability that the random walk on a group has small total displacement in terms of the spectral and isoperimetric profiles of the group. This inequality implies that if the random walk on the group…

Probability · Mathematics 2024-06-26 Tom Hutchcroft

We prove a general version of the amenability conjecture in the unified setting of a Gromov hyperbolic group G acting properly cocompactly either on its Cayley graph, or on a CAT(-1)-space. Namely, for any subgroup H of G, we show that H is…

Group Theory · Mathematics 2018-08-27 Rémi Coulon , Françoise Dal'Bo , Andrea Sambusetti

Given a finitely generated group with generating set $S$, we study the \emph{cogrowth} sequence, which is the number of words of length $n$ over the alphabet $S$ that are equal to one. This is related to the probability of return for walks…

Combinatorics · Mathematics 2020-01-01 Jason Bell , Marni Mishna

We define and study notions of amenability and skew-amenability of continuous actions of topological groups on compact topological spaces. Our main motivation is the question under what conditions amenability of a topological group passes…

Group Theory · Mathematics 2025-10-27 Vadim Alekseev , Hiroshi Ando , Friedrich Martin Schneider , Andreas Thom

The connective constant $\mu(G)$ of an infinite transitive graph $G$ is the exponential growth rate of the number of self-avoiding walks from a given origin. The relationship between connective constants and amenability is explored in the…

Group Theory · Mathematics 2015-11-25 Geoffrey R. Grimmett , Zhongyang Li

We construct new examples of expander Cayley graphs of finite groups, arising as congruence quotients of non-elementary subgroups of $SL_2 (\mathbb{F}_p [t])$ modulo certain square-free ideals. We describe some applications of our results…

Group Theory · Mathematics 2015-03-25 Henry Bradford

We characterize amenability of subspaces of $C(S)$, where $S$ is a semitopological semigroup, in terms of fixed point properties of nonexpansive actions. In particular, we give a complete characterization of a semitopological semigroup with…

Functional Analysis · Mathematics 2019-09-24 Andrzej Wiśnicki

Convergence rate analyses of random walk Metropolis-Hastings Markov chains on general state spaces have largely focused on establishing sufficient conditions for geometric ergodicity or on analysis of mixing times. Geometric ergodicity is a…

Statistics Theory · Mathematics 2023-07-24 Riddhiman Bhattacharya , Galin L. Jones

We focus on the study of dynamics of two kinds of random walk: generic random walk (GRW) and maximal entropy random walk (MERW) on two model networks: Cayley trees and ladder graphs. The stationary probability distribution for MERW is given…

Statistical Mechanics · Physics 2012-06-01 Jeremi K. Ochab

We construct, for each real number $0\leq \alpha \leq 1$, a random walk on a finitely generated semigroup whose speed exponent is $\alpha$. We further show that the speed function of a random walk on a finitely generated semigroup can be…

Group Theory · Mathematics 2025-04-15 Guy Blachar , Be'eri Greenfeld

In this paper, we show that there is a net for amenable transformation groups like F{\o}lner net for amenable groups and investigate amenability of a transformation group constructed by semidirect product of groups. We introduce inner…

Functional Analysis · Mathematics 2026-04-10 Ali Ebadian , Ali Jabbari

Analyzing the mixing time of random walks is a well-studied problem with applications in random sampling and more recently in graph partitioning. In this work, we present new analysis of random walks and evolving sets using more…

Data Structures and Algorithms · Computer Science 2015-07-09 Siu On Chan , Tsz Chiu Kwok , Lap Chi Lau