中文
相关论文

相关论文: The speed of random walks on semigroups

200 篇论文

We define matrix groups $FG_n(P)$ for each natural number $n$ and finite set of primes $P$, such that every rational-valued upper triangular matrix group is a (possibly distorted) subgroup. Brofferio and Schapira [Brofferio2011poisson],…

概率论 · 数学 2017-08-25 John J. Harrison

We study the asymptotic behavior the exit times of random walk from Euclidean balls around the origin of the incipient infinite cluster in a manner inspired by [26]. We do this by obtaining bounds on the effective resistance between the…

概率论 · 数学 2013-12-06 Markus Heydenreich , Remco van der Hofstad , Tim Hulshof

We study biased random walks on dynamical percolation on $\mathbb{Z}^d$. We establish a law of large numbers and an invariance principle for the random walk using regeneration times. Moreover, we verify that the Einstein relation holds, and…

概率论 · 数学 2024-09-26 Sebastian Andres , Nina Gantert , Dominik Schmid , Perla Sousi

We give refined estimates for the discrete time and continuous time versions of some basic random walks on the symmetric and alternating groups $S_n$ and $A_n$. We consider the following models: random transposition, transpose top with…

概率论 · 数学 2008-09-04 L. Saloff-Coste , J. Zuniga

We consider a branching random walk for which the maximum position of a particle in the n'th generation, M_n, has zero speed on the linear scale: M_n/n --> 0 as n --> infinity. We further remove ("kill") any particle whose displacement is…

概率论 · 数学 2009-08-10 Louigi Addario-Berry , Nicolas Broutin

Consider a transient near-critical (1,2) random walk on the positive half line. We give a criteria for the finiteness of the number of the skipped points (the points never visited) by the random walk. This result generalizes (partially) the…

概率论 · 数学 2017-07-21 Hua-Ming Wang

We consider biased random walk among iid, uniformly elliptic conductances on $\mathbb{Z}^d$, and investigate the monotonicity of the velocity as a function of the bias. It is not hard to see that if the bias is large enough, the velocity is…

概率论 · 数学 2017-05-01 Noam Berger , Nina Gantert , Jan Nagel

We consider walks on the edges of the square lattice $\mathbb Z^2$ which obey \emph{two-step rules,} which allow (or forbid) steps in a given direction to be followed by steps in another direction. We classify these rules according to a…

组合数学 · 数学 2021-12-15 Nicholas R. Beaton

We study some spectral properties of random walks on infinite countable amenable groups with an emphasis on locally finite groups, e.g. the infinite symmetric group. On locally finite groups, the random walks under consideration are driven…

谱理论 · 数学 2016-08-26 Alexander Bendikov , Barbara Bobikau , Christophe Pittet

We study random walks on groups with the feature that, roughly speaking, successive positions of the walk tend to be "aligned". We formalize and quantify this property by means of the notion of deviation inequalities. We show that deviation…

概率论 · 数学 2020-12-16 Pierre Mathieu , Alessandro Sisto

We study records generated by Brownian particles in one dimension. Specifically, we investigate an ordinary random walk and define the record as the maximal position of the walk. We compare the record of an individual random walk with the…

统计力学 · 物理学 2014-06-13 E. Ben-Naim , P. L. Krapivsky

Let $G$ be a nonamenable transitive unimodular graph. In dynamical percolation, every edge in $G$ refreshes its status at rate $\mu>0$, and following the refresh, each edge is open independently with probability $p$. The random walk…

概率论 · 数学 2024-07-23 Chenlin Gu , Jianping Jiang , Yuval Peres , Zhan Shi , Hao Wu , Fan Yang

We derive a perturbation expansion for general self-interacting random walks, where steps are made on the basis of the history of the path. Examples of models where this expansion applies are reinforced random walk, excited random walk, the…

概率论 · 数学 2010-01-13 Remco van der Hofstad , Mark Holmes

We study the asymptotic properties of nearest-neighbor random walks in 1d random environment under the influence of an external field of intensity $\lambda\in\mathbb{R}$. For ergodic shift-invariant environments, we show that the limiting…

概率论 · 数学 2018-06-11 Alessandra Faggionato , Michele Salvi

We consider a random walk on $\Z$ that branches at the origin only. In the supercritical regime we establish a law of large number for the maximal position $M_n$. Then we determine all possible limiting law for the sequence $M_n -\alpha n$…

概率论 · 数学 2012-09-28 Philippe Carmona , Yueyun Hu

Consider a discrete-time one-dimensional supercritical branching random walk. We study the probability that there exists an infinite ray in the branching random walk that always lies above the line of slope $\gamma-\epsilon$, where $\gamma$…

概率论 · 数学 2010-02-16 Nina Gantert , Yueyun Hu , Zhan Shi

The Rademacher random walk associated with a deterministic sequence $(a_n)_{n \geq 1}$ is the walk which starts at zero and, at step $i$, independently steps either up or down by $a_i$ with equal probability. We continue the study begun by…

概率论 · 数学 2025-12-22 Satyaki Bhattacharya , Edward Crane , Tom Johnston

Consider a nearest-neighbor random walk with certain asymptotically zero drift on the positive half line. Let $M$ be the maximum of an excursion starting from $1$ and ending at $0.$ We study the distribution of $M$ and characterize its…

概率论 · 数学 2020-04-28 Hongyan Sun , Hua-Ming Wang

We study symmetric random walks on finitely generated groups of orientation-preserving homeomorphisms of the real line. We establish an oscillation property for the induced Markov chain on the line that implies a weak form of recurrence.…

群论 · 数学 2013-07-23 B. Deroin , V. Kleptsyn , A. Navas , K. Parwani

Let $N$ and $M$ be positive integers satisfying $1\le M\le N$, and let $0<p_0<p_1<1$. Define a process $\{X_n\}_{n=0}^\infty$ on $\mathbb{Z}$ as follows. At each step, the process jumps either one step to the right or one step to the left,…

概率论 · 数学 2014-02-11 Ross G. Pinsky