相关论文: Amenability via random walks

We find that the simple coupling of network growth to the position of a random walker on the network generates a traveling wave in the probability distribution of nodes visited by the walker. We argue that the entropy of this probability…

We introduce inner amenability for discrete p.m.p. groupoids and investigate its basic properties, examples, and the connection with central sequences in the full group of the groupoid or central sequences in the von Neumann algebra…

We prove that the class of residually C groups is closed under taking graph products, provided that C is closed under taking subgroups, finite direct products and that free-by-C groups are residually C. As a consequence, we show that local…

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…

We investigate properties of closed approximate subgroups of locally compact groups, with a particular interest for approximate lattices i.e. those approximate subgroups that are discrete and have finite co-volume. We prove an approximate…

We show that if $G$ is an amenable topological group, then the topological group $L^{0}(G)$ of strongly measurable maps from $([0,1],\lambda)$ into $G$ endowed with the topology of convergence in measure is whirly amenable, hence extremely…

In this paper, we provide several characterisations for uniform amenability concerning a family of finitely generated groups. More precisely, we show that the Hulanicki-Reiter condition for uniform amenability can be weakened in several…

In this work, the outward and inward accessibilities of individual nodes are defined and their potential for application is illustrated with respect to the investigation of 6 different types of networks. The outward accessibility quantifies…

We study under which condition an amalgamated free product or an HNN-extension over a finite subgroup admits an amenable, transitive and faithful action on an infinite countable set. We show that such an action exists if the initial groups…

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…

We study hereditary properties of the class of countable groups admitting an amenable, transitive and faithful action on a countable set. We consider mainly the case of amalgamated free products, and we show in particular that the double of…

There has been much interest in generalizing Kesten's criterion for amenability in terms of a random walk to other contexts, such as determining amenability of a deck covering group by the bottom of the spectrum of the Laplacian or entropy…

We show that a random walk on the mapping class group of an orientable surface gives rise to a pseudo-Anosov element with asymptotic probability one. Our methods apply to many subgroups of the mapping class group, including the Torelli…

This paper studies long range random walks on ${\mathbb{Z}_q}^d$. $X_{t+1} = X_t + Z_t \mod q$, with $(Z_t)$ independent and identically distributed. Multiple entries of $Z_t$ can be non-zero in a transition. An emphasis is on finding the…

In this paper, the notion of proper proximality (introduced in [BIP18]) is studied and classified in various families of groups. We show that if a group acts non-elementarily by isometries on a tree such that for any two edges, the…

We construct a renewal structure for random walks on surface groups. The renewal times are defined as times when the random walks enters a particular type of a cone and never leaves it again. As a consequence, the trajectory of the random…

We first give simplified and corrected accounts of some results in \cite{PiRCP} on compactifications of pseudofinite groups. For instance, we use a classical theorem of Turing \cite{Turing} to give a simplified proof that any definable…

The measurement called accessibility has been proposed as a means to quantify the efficiency of the communication between nodes in complex networks. This article reports important results regarding the properties of the accessibility,…

We study definably amenable NIP groups. We develop a theory of generics, showing that various definitions considered previously coincide, and study invariant measures. Applications include: characterization of regular ergodic measures, a…

We consider a system of independent one-dimensional random walks in a common random environment under the condition that the random walks are transient with positive speed $v_P$. We give upper bounds on the quenched probability that at…