Related papers: Random walks on the discrete affine group
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…
We theoretically study the transport properties of self-propelled particles on complex structures, such as motor proteins on filament networks. A general master equation formalism is developed to investigate the persistent motion of…
In this note, we try to analyze and clarify the intriguing interplay between some counting problems related to specific thermalized weighted graphs and random walks consistent with such graphs.
This paper introduces nondeterministic walks, a new variant of one-dimensional discrete walks. The main difference to classical walks is that its nondeterministic steps consist of sets of steps from a predefined set such that all possible…
In this technical note we give a purely geometric understanding of discrete torsion, as an analogue of orbifold Wilson lines for two-form tensor field potentials. In order to introduce discrete torsion in this context, we describe gerbes…
The random connection model is a random graph whose vertices are given by the points of a Poisson process and whose edges are obtained by randomly connecting pairs of Poisson points in a position dependent but independent way. We study…
Let $G$ be a countable group and $\mu$ a probability measure on $G$. We build a new framework to compute asymptotic quantities associated with the $\mu$-random walk on $G$, using methods from harmonic analysis on groups and Banach space…
We construct the Poisson boundary for a random walk supported by the general linear group on the rational numbers as the product of flag manifolds over the $p$-adic fields. To this purpose, we prove a law of large numbers using the…
We construct the conditional version of $k$ independent and identically distributed random walks on $\R$ given that they stay in strict order at all times. This is a generalisation of so-called non-colliding or non-intersecting random…
The purpose of these notes is to clarify the duality between a natural class of jump processes on compact ultrametric spaces - studied in current work of Bendikov, Girgor'yan and Pittet - and nearest neighbour walks on trees. Processes of…
Given a probability measure on a finitely generated group, its Martin boundary is a way to compactify the group using the Green function of the corresponding random walk. It is known from the work of W. Woess that when a finitely supported…
Let ${\cal G}$ be the incipient infinite cluster (IIC) for percolation on a homogeneous tree of degree $n_0+1$. We obtain estimates for the transition density of the continuous time simple random walk $Y$ on ${\cal G}$; the process…
We find uniform lower bounds on the drift for a large family of random walks on graph products, of the form $ \mathbb{P} (|Z_{n}| \leq \kappa n) \leq e ^{-\kappa n} $ for $ \kappa > 0 $. This includes the simple random walk for a…
We study random walk on topological full groups of subshifts, and show the existence of infinite, finitely generated, simple groups with the Liouville property. Results by Matui and Juschenko-Monod have shown that the derived subgroups of…
We define a new stochastic process on general simplicial complexes which allows to study their spectral and homological properties. Some results for random walks on graphs are shown to hold in this general setting. As an application, the…
We study the problem of convergence to the boundary in the setting of random walks on discrete quantum groups. Convergence to the boundary is established for random walks on $\hat{\textrm{SU}_q(2)}$. Furthermore, we will define the Martin…
We are interested in the random walk in random environment on an infinite tree. Lyons and Pemantle [11] give a precise recurrence/transience criterion. Our paper focuses on the almost sure asymptotic behaviours of a recurrent random walk…
We show that anomalous diffusion can result when the steps of a random walk are not statistically independent. We present an algorithm that counts all the possible paths of particles diffusing on random graphs with arbitrary degree…
We consider (random) walks in a multidimensional orthant. Using the idea of universality in probability theory, one can associate a unique polyhedral domain to any given walk model. We use this connection to prove two sets of new results.…
The piecewise flat spacetime is equipped with a set of edge lengths and vertex coordinates. This defines a piecewise affine coordinate system and a piecewise affine metric in it, the discrete analogue of the unique torsion-free…