中文
相关论文

相关论文: Return Probability for the Switch--Walk--Switch La…

200 篇论文

In this article, we study linearly edge-reinforced random walk on general multi-level ladders for large initial edge weights. For infinite ladders, we show that the process can be represented as a random walk in a random environment, given…

概率论 · 数学 2007-05-23 Franz Merkl , Silke W. W. Rolles

In the broadcasting problem on trees, a $\{-1,1\}$-message originating in an unknown node is passed along the tree with a certain error probability $q$. The goal is to estimate the original message without knowing the order in which the…

概率论 · 数学 2025-09-12 Ernst Althaus , Lisa Hartung , Rebecca Steiner

In random walk theory, it is customary to assume that a given walk is irreducible and/or aperiodic. While these prevailing assumptions make particularly tractable the analysis of random walks and help to highlight their diffusive nature,…

概率论 · 数学 2025-07-02 Evan Randles , Yutong Yan

We study simple random walk on the class of random planar maps which can be encoded by a two-dimensional random walk with i.i.d. increments or a two-dimensional Brownian motion via a "mating-of-trees" type bijection. This class includes the…

概率论 · 数学 2020-08-27 Ewain Gwynne , Jason Miller

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

We consider a model of random walk in ${\mathbb Z}^2$ with (fixed or random) orientation of the horizontal lines (layers) and with non constant iid probability to stay on these lines. We prove the transience of the walk for any fixed…

概率论 · 数学 2012-11-27 Alexis Devulder , Francoise Pene

We consider d independent walkers on Z, m of them performing simple symmetric random walk and r = d -- m of them performing recurrent RWRE (Sinai walk), in I independent random environments. We show that the product is recurrent, almost…

概率论 · 数学 2018-07-12 Alexis Devulder , Nina Gantert , Françoise Pene

The infinite two-sided loop-erased random walk (LERW) is a measure on infinite self-avoiding walks that can be viewed as giving the law of the `middle part' of an infinite LERW loop going through 0 and infinity. In this note we derive…

概率论 · 数学 2019-11-20 Christian Beneš , Gregory F. Lawler , Fredrik Viklund

Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…

概率论 · 数学 2009-10-05 Lorenz A. Gilch , Sebastian Müller

The analysis of the return probability is one of the most essential and fundamental topics in the study of classical random walks. In this paper, we study the return probability of quantum and correlated random walks in the one-dimensional…

数学物理 · 物理学 2022-04-25 Chusei Kiumi , Norio Konno , Shunya Tamura

We study models of continuous time, symmetric, $\Z^d$-valued random walks in random environments. One of our aims is to derive estimates on the decay of transition probabilities in a case where a uniform ellipticity assumption is absent. We…

概率论 · 数学 2007-05-23 L. R. G. Fontes , P. Mathieu

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

This article investigates the behavior of the continuous-time simple random walk on $\mathbb{Z}^d$, $d \geq 3$. We derive an asymptotic lower bound on the principal exponential rate of decay for the probability that the average value over a…

概率论 · 数学 2025-07-24 Alberto Chiarini , Maximilian Nitzschner

We introduce a simple technique for proving the transience of certain processes defined on the random tree $\mathcal{G}$ generated by a supercritical branching process. We prove the transience for once-reinforced random walks on…

概率论 · 数学 2007-05-23 Andrea Collevecchio

Let T be a rooted supercritical multi-type Galton-Watson (MGW) tree with types coming from a finite alphabet, conditioned to non-extinction. The lambda-biased random walk (X_t, t>=0) on T is the nearest-neighbor random walk which, when at a…

概率论 · 数学 2012-05-08 Amir Dembo , Nike Sun

We investigate a model of continuous-time simple random walk paths in $\mathbb{Z}^d$ undergoing two competing interactions: an attractive one towards the large values of a random potential, and a self-repellent one in the spirit of the…

A new proof is given for the formula for the expected return time of a random walk on a graph. This proof makes use of known relationships between electric resistance and random walks.

概率论 · 数学 2016-12-06 Greg Markowsky

The parametric maximum likelihood estimation problem is addressed in the context of quantum walk theory for quantum walks on the lattice of integers. A coin action is presented, with the real parameter $\theta$ to be estimated identified…

量子物理 · 物理学 2023-05-31 Demosthenes Ellinas , Peter D. Jarvis , Matthew Pearce

We study a model of multi-excited random walk on a regular tree which generalizes the models of the once excited random walk and the digging random walk introduced by Volkov (2003). We show the existence of a phase transition of the…

概率论 · 数学 2008-12-10 Anne-Laure Basdevant , Arvind Singh

The involution walk is the random walk on $S_n$ generated by involutions with a binomially distributed with parameter $1-p$ number of $2$-cycles. This is a parallelization of the transposition walk. The involution walk is shown in this…

组合数学 · 数学 2016-07-05 Megan Bernstein