中文
相关论文

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

200 篇论文

For a random walk on the integer lattice $\mathbb{Z}$ that is attracted to a strictly stable process with index $\alpha\in (1, 2)$ we obtain the asymptotic form of the transition probability for the walk killed when it hits a finite set.…

概率论 · 数学 2019-04-24 Kohei Uchiyama

The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an…

组合数学 · 数学 2010-09-27 Omer Angel , Alexander E. Holroyd

Random walks on the circle group $\mathbb{R}/\mathbb{Z}$ whose elementary steps are lattice variables with span $\alpha \not\in \mathbb{Q}$ or $p/q \in \mathbb{Q}$ taken mod $\mathbb{Z}$ exhibit delicate behavior. In the rational case we…

概率论 · 数学 2024-02-20 Istvan Berkes , Bence Borda

Maximization of the entropy rate is an important issue to design diffusion processes aiming at a well-mixed state. We demonstrate that it is possible to construct maximal-entropy random walks with only local information on the graph…

For any finitely generated group G, let n ---> \Phi_G(n) be the function that describes the rough asymptotic behavior of the probability of return to the identity element at time 2n of a symmetric simple random walk on G (this is an…

概率论 · 数学 2013-07-23 Laurent Saloff-Coste , Tianyi Zheng

We consider a nonlinear random walk which, in each time step, is free to choose its own transition probability within a neighborhood (w.r.t. Wasserstein distance) of the transition probability of a fixed L\'evy process. In analogy to the…

概率论 · 数学 2021-04-28 Daniel Bartl , Stephan Eckstein , Michael Kupper

We consider random walks on finitely or countably generated free semigroups, and identify their Poisson boundaries for classes of measures which fail to meet the classical entropy criteria. In particular, we introduce the notion of…

动力系统 · 数学 2019-08-13 Behrang Forghani , Giulio Tiozzo

We derive a functional central limit theorem for the excursion of a random walk conditioned on sweeping a prescribed geometric area. We assume that the increments of the random walk are integer-valued, centered, with a third moment equal to…

概率论 · 数学 2019-10-30 Philippe Carmona , Nicolas Pétrélis

Let $r: S\times S\to \bb R_+$ be the jump rates of an irreducible random walk on a finite set $S$, reversible with respect to some probability measure $m$. For $\alpha >1$, let $g: \bb N\to \bb R_+$ be given by $g(0)=0$, $g(1)=1$, $g(k) =…

概率论 · 数学 2009-10-22 Johel Beltran , Claudio Landim

We study the simple random walk on stochastic hyperbolic half planar triangulations constructed in Angel and Ray [3]. We show that almost surely the walker escapes the boundary of the map in positive speed and that the return probability to…

概率论 · 数学 2014-08-20 Omer Angel , Asaf Nachmias , Gourab Ray

We study a random walk on $\mathbb{Z}$ which evolves in a dynamic environment determined by its own trajectory. Sites flip back and forth between two modes, $p$ and $q$. $R$ consecutive right jumps from a site in the $q$-mode are required…

概率论 · 数学 2015-03-05 Ross G. Pinsky , Nicholas F. Travers

We obtain upper bounds (in most cases, sharp) for the hitting times of random walks on finite undirected graphs expressed as functions of the graph's number of edges. In particular, we show that the maximum hitting time for a simple random…

组合数学 · 数学 2017-02-15 Dmitri Fomin

We show existence of the weak large deviation principle, with a convex rate function, for the renormalized distance from the starting point of irreducible random walks on relatively hyperbolic groups. Under the assumption of finiteness of…

概率论 · 数学 2021-11-30 Emilio Corso

Mother groups are the basic building blocks for polynomial automaton groups. We show that, in contrast with mother groups of degree 0 or 1, any bounded, symmetric, generating random walk on the mother groups of degree at least 3 has…

概率论 · 数学 2015-09-25 Gideon Amir , Balint Virag

Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…

概率论 · 数学 2018-10-09 Ruojun Huang

We pose a new and intriguing question motivated by distributed computing regarding random walks on graphs: How long does it take for several independent random walks, starting from the same vertex, to cover an entire graph? We study the…

概率论 · 数学 2007-11-20 Noga Alon , Chen Avin , Michal Koucky , Gady Kozma , Zvi Lotker , Mark R. Tuttle

Consider a branching random walk $(G_u)_{u\in \mathbb T}$ on the general linear group $\textrm{GL}(V)$ of a finite dimensional space $V$, where $\mathbb T$ is the associated genealogical tree with nodes $u$. For any starting point $v \in V…

概率论 · 数学 2024-12-11 Ion Grama , Sebastian Mentemeier , Hui Xiao

We consider random walks in a random environment of the type p_0+\gamma\xi_z, where p_0 denotes the transition probabilities of a stationary random walk on \BbbZ^d, to nearest neighbors, and \xi_z is an i.i.d. random perturbation. We give…

概率论 · 数学 2007-05-23 Christophe Sabot

Suppose we are given the free product $V$ of a finite family of finite or countable sets $(V_i)_{i\in\mathcal{I}}$ and probability measures on each $V_i$, which govern random walks on it. We consider a transient random walk on the free…

概率论 · 数学 2007-08-29 Lorenz Gilch

Fix integers $d \geq 2$ and $k\geq d-1$. Consider a random walk $X_0, X_1, \ldots$ in $\mathbb{R}^d$ in which, given $X_0, X_1, \ldots, X_n$ ($n \geq k$), the next step $X_{n+1}$ is uniformly distributed on the unit ball centred at $X_n$,…

概率论 · 数学 2020-01-16 Francis Comets , Mikhail V. Menshikov , Andrew R. Wade