中文
相关论文

相关论文: Phase transition for the late points of random wal…

200 篇论文

In this article, we consider the number of collisions of three independent simple random walks on a subgraph of the two-dimensional square lattice obtained by removing all horizontal edges with vertical coordinate not equal to 0 and then,…

概率论 · 数学 2024-10-08 David A. Croydon , Umberto De Ambroggio

In this paper, we study (1,2) and (2,1) random walks in varying environments on the lattice of positive half line. We assume that the transition probabilities at site $n$ are asymptotically constants as $n\rightarrow\infty.$ For (1,2)…

概率论 · 数学 2022-06-22 Hua-Ming Wang , Lanlan Tang

We study quantitative asymptotics of planar random walks that are spatially non-homogeneous but whose mean drifts have some regularity. Specifically, we study the first exit time $\tau_\alpha$ from a wedge with apex at the origin and…

概率论 · 数学 2013-02-27 Iain M. MacPhee , Mikhail V. Menshikov , Andrew R. Wade

Given a finite, connected graph $G$, the lamplighter chain on $G$ is the lazy random walk $X^\diamond$ on the associated lamplighter graph $G^\diamond={\mathbf Z}_2 \wr G$. The mixing time of the lamplighter chain on the torus ${\mathbf…

概率论 · 数学 2018-08-15 Amir Dembo , Jian Ding , Jason Miller , Yuval Peres

For parameters $n,\delta,B,$ and $C$, let $X=(X_{k\ell})$ be the random uniform contingency table whose first $\lfloor n^{\delta} \rfloor $ rows and columns have margin $\lfloor BCn \rfloor$ and the last $n$ rows and columns have margin…

概率论 · 数学 2020-09-15 Sam Dittmer , Hanbaek Lyu , Igor Pak

We show the existence of a phase transition between a localisation and a non-localisation regime for a branching random walk with a catalyst at the origin. More precisely, we consider a continuous-time branching random walk that jumps at…

概率论 · 数学 2025-09-05 Cécile Mailler , Bruno Schapira

We study the simple random walk on the giant component of a supercritical Erd\H{o}s-R\'enyi random graph on $n$ vertices, in particular the so-called vacant set at level $u$, the complement of the trajectory of the random walk run up to a…

概率论 · 数学 2013-10-18 Tobias Wassmer

We develop a framework to determine the complete statistical behavior of a fundamental quantity in the theory of random walks, namely, the probability that $n_1$, $n_2$, $n_3$, . . . distinct sites are visited at times $t_1$, $t_2$, $t_3$,…

统计力学 · 物理学 2022-06-22 Léo Régnier , Maxim Dolgushev , Sidney Redner , Olivier Bénichou

We introduce the notion of \emph{localization at the boundary} for conditioned random walks in i.i.d. and uniformly elliptic random environment on $\mathbb{Z}^d$, in dimensions two and higher. Informally, this means that the walk spends a…

概率论 · 数学 2020-10-29 Rodrigo Bazaes

Let $(X_t, t \geq 0)$ be an $\alpha$-stable random walk with values in $\Z^d$. Let $l_t(x) = \int_0^t \delta_x(X_s) ds$ be its local time. For $p>1$, not necessarily integer, $I_t = \sum_x l_t^p(x)$ is the so-called $p$-fold self-…

概率论 · 数学 2012-05-23 Fabienne Castell , Clément Laurent , Clothilde Mélot

For a finite graph $G=(V,E)$ let $G^*$ be obtained by considering a random perfect matching of $V$ and adding the corresponding edges to $G$ with weight $\varepsilon$, while assigning weight 1 to the original edges of $G$. We consider…

概率论 · 数学 2023-10-17 Zsuzsanna Baran , Jonathan Hermon , Anđela Šarković , Perla Sousi

We consider the possible visits to visible points of a random walker moving up and right in the integer lattice (with probability $\alpha$ and $1-\alpha$, respectively) and starting from the origin. We show that, almost surely, the…

数论 · 数学 2015-12-16 Javier Cilleruelo , José L. Fernández , Pablo Fernández

We study existence of percolation in the hierarchical group of order $N$, which is an ultrametric space, and transience and recurrence of random walks on the percolation clusters. The connection probability on the hierarchical group for two…

概率论 · 数学 2016-02-09 D. A. Dawson , L. G. Gorostiza

Consider a symmetric aperiodic random walk in $Z^d$, $d\geq 3$. There are points (called heavy points) where the number of visits by the random walk is close to its maximum. We investigate the local times around these heavy points and show…

概率论 · 数学 2007-05-23 Endre Csáki , Antónia Földes , Pál Révész

Let $X$ be a simple random walk on $\mathbb{Z}_n^d$ with $d\geq 3$ and let $t_{\rm{cov}}$ be the expected cover time. We consider the set of points $\mathcal{U}_\alpha$ of $\mathbb{Z}_n^d$ that have not been visited by the walk by time…

概率论 · 数学 2021-02-03 Sam Olesker-Taylor , Perla Sousi

We consider Reinforced Random Walks where transition probabilities are a function of the proportion of times the walk has traversed an edge. We give conditions for recurrence or transience. A phase transition is observed, similar to…

概率论 · 数学 2009-07-15 Olivier Raimond , Bruno Schapira

We study the trajectory of a simple random walk on a d-regular graph with d>2 and locally tree-like structure as the number n of vertices grows. Examples of such graphs include random d-regular graphs and large girth expanders. For these…

概率论 · 数学 2015-05-20 Jiri Cerny , Augusto Teixeira , David Windisch

We consider random variables observed at arrival times of a renewal process, which possibly depends on those observations and has regularly varying steps with infinite mean. Due to the dependence and heavy tailed steps, the limiting…

概率论 · 数学 2016-08-08 Bojan Basrak , Drago Špoljarić

Let $L_n^{X}(x)$ denote the number of visits to $x \in {\bf Z}^2$ of the simple planar random walk $X$, up till step $n$. Let $X'$ be another simple planar random walk independent of $X$. We show that for any $0<b<1/(2 \pi)$, there are…

概率论 · 数学 2007-05-23 Amir Dembo , Yuval peres , Jay Rosen , Ofer Zeitouni

In this short paper, we consider the Once-reinforced random walk with reinforcement parameter $a$ on trees with bounded degree which are transient for the simple random walk. On each of these trees, we prove that there exists an explicit…

概率论 · 数学 2017-08-23 Daniel Kious , Vladas Sidoravicius