English
Related papers

Related papers: Random walks on Baumslag-Solitar groups

200 papers

We consider a specific random graph which serves as a disordered medium for a particle performing biased random walk. Take a two-sided infinite horizontal ladder and pick a random spanning tree with a certain edge weight $c$ for the…

Probability · Mathematics 2023-04-19 Nina Gantert , Achim Klenke

A discrete random walk method on grids was proposed and used to solve the linearized Poisson-Boltzmann equation (LPBE) \cite{Rammile}. Here, we present a new and efficient grid-free random walk method. Based on a modified `` Walk On…

Mathematical Physics · Physics 2009-10-31 Chi-Ok Hwang , Michael Mascagni

We give sharp, uniform estimates for the probability that a random walk of n steps on the reals avoids a half-line [y,infinity) given that it ends at the point x. The estimates hold for general continuous or lattice distributions provided…

Probability · Mathematics 2009-06-18 Kevin Ford

For $\lambda>0$, we define a $\lambda$-damped random walk to be a random walk that is started from a random vertex of a graph and stopped at each step with probability $\frac{\lambda}{1+\lambda}$, otherwise continued with probability…

Probability · Mathematics 2012-01-17 Madhav Desai , Hariharan Narayanan

There have been extensive studies of a random walk among a field of immobile traps (or obstacles), where one is interested in the probability of survival as well as the law of the random walk conditioned on its survival up to time $t$. In…

Probability · Mathematics 2019-10-25 Siva Athreya , Alexander Drewitz , Rongfeng Sun

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…

Probability · Mathematics 2016-09-16 Peter Haissinsky , Pierre Mathieu , Sebastian Mueller

In this paper, we study the overlap distribution and Gibbs measure of the Branching Random Walk with Gaussian increments on a binary tree. We first prove that the Branching Random Walk is 1 step Replica Symmetry Breaking and give a precise…

Probability · Mathematics 2017-06-13 Aukosh Jagannath

The group of affine transformations with rational coefficients acts naturally on the real line, but also on the $p$-adic fields. The aim of this note is to show that, for random walks whose laws have a finite first moment, all these actions…

Probability · Mathematics 2007-05-23 Sara Brofferio

We show under weak hypotheses that $\partial X$, the Roller boundary of a finite dimensional CAT(0) cube complex $X$ is the Furstenberg-Poisson boundary of a sufficiently nice random walk on an acting group $\Gamma$. In particular, we show…

Group Theory · Mathematics 2015-07-21 Talia Fernós

In arXiv:1609.05666v1 [math.PR] a functional limit theorem was proved. It states that symmetric processes associated with resistance metric measure spaces converge when the underlying spaces converge with respect to the…

Probability · Mathematics 2025-09-30 George Andriopoulos

We apply results from Baryshnikov, Brady, Bressler and Pemantle (2008) to compute limiting probability profiles for various quantum random walks in one and two dimensions. Using analytic machinery we show some features of the limit…

Combinatorics · Mathematics 2009-11-23 Andrew Bressler , Torin Greenwood , Robin Pemantle , Marko Petkovsek

We obtain non-Gaussian limit laws for one-dimensional random walk in a random environment assuming that the environment is a function of a stationary Markov process. This is an extension of the work of Kesten, M. Kozlov and Spitzer for…

Probability · Mathematics 2007-05-23 Eddy Mayer-Wolf , Alexander Roitershtein , Ofer Zeitouni

We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the tree, which is a measure of the average number of branches…

Probability · Mathematics 2007-05-23 Robin Pemantle , Russell Lyons

We study $\lambda$-biased branching random walks on Bienaym\'e--Galton--Watson trees in discrete time. We consider the maximal displacement at time $n$, $\max_{\vert u \vert =n} \vert X(u) \vert$, and show that it almost surely grows at a…

Probability · Mathematics 2026-03-02 Julien Berestycki , Nina Gantert , David Geldbach , Quan Shi

Random transvections generate a walk on the space of symplectic forms on $\mathbf{F}_q^{2n}$. The main result is establishing cutoff for this Markov chain. After $n+c$ steps, the walk is close to uniform while before $n-c$, it is far from…

Probability · Mathematics 2021-02-15 Jimmy He

In this work, we are interested in the set of visited vertices of a tree $\mathbb{T}$ by a randomly biased random walk $\mathbb{X}:=(X_n,n \in \mathbb{N})$. The aim is to study a generalized range, that is to say the volume of the trace of…

Probability · Mathematics 2024-09-20 Pierre Andreoletti , Alexis Kagan

We classify the finite-dimensional irreducible linear representations of the Baumslag-Solitar groups BS(p,q) = < a, b | a b^p = b^q a > for relatively prime p and q. The general strategy of the argument is to consider the matrix group given…

Group Theory · Mathematics 2012-09-19 Daniel McLaury

We establish a sharp sufficient condition for groups acting on trees to be highly transitive when the action on the tree is minimal of general type. This gives new examples of highly transitive groups, including icc non-solvable…

Group Theory · Mathematics 2022-09-05 Pierre Fima , François Le Maître , Soyoung Moon , Yves Stalder

This paper has two parts, on Baumslag-Solitar groups and on general G-trees. In the first part we establish bounds for stable commutator length (scl) in Baumslag-Solitar groups. For a certain class of elements, we further show that scl is…

Group Theory · Mathematics 2020-06-04 Matt Clay , Max Forester , Joel Louwsma

We consider random walks that start and are absorbed on the leaves of random networks and study the length of such walks. For the networks we investigate, Erdos-Renyi random graphs and Barabasi-Albert scale free networks, these walks are…

Disordered Systems and Neural Networks · Physics 2016-07-11 David Lancaster