相关论文: Computational explorations in Thompson's group F

Let $\Gamma $ be an infinite discrete group and $\mathsf{A}\subset \Gamma $ a nonempty finite subset. The set of permutations $\sigma $ of $\Gamma $ such that $s^{-1}\sigma (s)\in \mathsf{A}$ for every $s\in \Gamma $ can be identified with…

Let $G$ be a finitely generated group of polynomial volume growth equipped with a word-length $|\cdot|$. The goal of this paper is to develop techniques to study the behavior of random walks driven by symmetric measures $\mu$ such that, for…

We consider a transitive action of a finitely generated group $G$ and the Schreier graph $\Gamma$ defined by this action for some fixed generating set. For a probability measure $\mu$ on $G$ with a finite first moment we show that if the…

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…

We extend some properties of random walks on hyperbolic groups to random walks on convergence groups. In particular we prove that if a convergence group $G$ acts on a compact metrizable space $M$ with the convergence property then we can…

In this short note we study the entropy for algebraic actions of certain amenable groups. The possible values for this entropy are studied. Various fundamental results about certain classes of amenable groups are reproved using elementary…

We study which outcomes are implementable by disclosing coarse statistics of a data-generating process rather than its full distribution. Players observe data whose joint distribution is only partially known: they know the expectations of…

What is the probability that a random walk in the free group ends in a proper power? Or in a primitive element? We present a formula that computes the exponential decay rate of the probability that a random walk on a regular tree ends in a…

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 describe a generalization of the concept of a pc presentation that applies to groups with a nontrivial solvable radical. Such a representation can be much more efficient in terms of memory use and even of arithmetic, than permuattion and…

An infinite population of point entities dwelling in the habitat $X=\mathds{R}^d$ is studied. Its members arrive at and depart from $X$ at random. The departure rate has a term corresponding to a logistic-type interaction between the…

We introduce a model, based on the Evolutionary Game Theory, for studying the dynamics of group formation. The latter constitutes a relevant phenomenon observed in different animal species, whose individuals tend to cluster together forming…

Given a finite-range random walk on a finitely generated free group , what is the asymptotic behaviour, as the number of steps goes to infinity, of the sequence of probabilities that the random walk is at a given element of the group? In…

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…

The growth-fragmentation equation models systems of particles that grow and reproduce as time passes. An important question concerns the asymptotic behaviour of its solutions. Bertoin and Watson ($2018$) developed a probabilistic approach…

We give a solution to the inverse problem (given a function, find a corresponding group) for large classes of speed, entropy, isoperimetric profile, return probability and $L_p$-compression functions of finitely generated groups of…

We introduce the Pythagorean C*-algebras and use the category/functor method to construct unitary representations of Thompson's groups from representations of them. We calculate several examples.

Using integral methods we recover and generalize some results by F\'{e}lix, Halperin and Thomas on the growth of the rational homology groups of free loop spaces, and obtain a new family of spaces whose $p$-torsion in homotopy groups grows…

We study in-network computation on general network topologies. Specifically, we are given the description of a function, and a network with distinct nodes at which the operands of the function are made available, and a designated sink where…

We introduce the discrete affine group of a regular tree as a finitely generated subgroup of the affine group. We describe the Poisson boundary of random walks on it as a space of configurations. We compute isoperimetric profile and Hilbert…