中文
相关论文

相关论文: Conditions for Equivalence of Random Interlacement…

200 篇论文

A short proof of the equivalence of the recurrence of non-backtracking random walk and that of simple random walk on regular infinite graphs is given. It is then shown how this proof can be extended in certain cases where the graph in…

概率论 · 数学 2019-05-21 Paul Jung , Greg Markowsky

We give a sufficient condition for the existence of the harmonic measure from infinity of transient random walks on weighted graphs. In particular, this condition is verified by the random conductance model on $\Z^d$, $d\geq 3$, when the…

概率论 · 数学 2012-02-16 Daniel Boivin , Clément Rau

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

Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler asked the question: for which graphs are two independent walks…

概率论 · 数学 2011-04-20 Peter Gacs

In this paper we introduce the notion of Random Walk in Changing Environment - a random walk in which each step is performed in a different graph on the same set of vertices, or more generally, a weighted random walk on the same vertex and…

概率论 · 数学 2017-07-05 Gideon Amir , Itai Benjamini , Ori Gurel-Gurevich , Gady Kozma

We consider a random object that is associated with both random walks and random media, specifically, the superposition of a configuration of subcritical Bernoulli percolation on an infinite connected graph and the trace of the simple…

概率论 · 数学 2019-09-10 Kazuki Okamura

We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…

概率论 · 数学 2022-09-30 Ercan Sönmez , Arnaud Rousselle

Random Walks in Dirichlet Environment (RWDE) correspond to Random Walks in Random Environment (RWRE) on $\Bbb{Z}^d$ where the transition probabilities are i.i.d. at each site with a Dirichlet distribution. Hence, the model is parametrized…

概率论 · 数学 2016-02-01 Christophe Sabot , Laurent Tournier

We consider random walks in random Dirichlet environment (RWDE) which is a special type of random walks in random environment where the exit probabilities at each site are i.i.d. Dirichlet random variables. On $\Z^d$, RWDE are parameterized…

概率论 · 数学 2013-09-20 Christophe Sabot

We consider the random walk in an \emph{i.i.d.} random environment on the infinite $d$-regular tree for $d \geq 3$. We consider the tree as a Cayley graph of free product of finitely many copies of $\Zbold$ and $\Zbold_2$ and define the…

概率论 · 数学 2014-04-30 Siva Athreya , Antar Bandyopadhyay , Amites Dasgupta

A recurrent graph $G$ has the infinite collision property if two independent random walks on $G$, started at the same point, collide infinitely often a.s. We give a simple criterion in terms of Green functions for a graph to have this…

概率论 · 数学 2010-03-18 Martin T. Barlow , Yuval Peres , Perla Sousi

We introduce the notion of a "random basic walk" on an infinite graph, give numerous examples, list potential applications, and provide detailed comparisons between the random basic walk and existing generalizations of simple random walks.…

离散数学 · 计算机科学 2013-08-06 David White

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 base ourselves on the construction of the two-dimensional random interlacements [12] to define the one-dimensional version of the process. For this constructions we consider simple random walks conditioned on never hitting the origin,…

概率论 · 数学 2016-08-04 Darcy Camargo , Serguei Popov

We prove that in any recurrent reversible random rooted graph, two independent simple random walks started at the same vertex collide infinitely often almost surely. This applies to the Uniform Infinite Planar Triangulation and…

概率论 · 数学 2018-05-01 Tom Hutchcroft , Yuval Peres

An infinite graph G has the property that a random walk in random environment on G defined by i.i.d. resistances with any common distribution is almost surely transient, if and only if for some p<1, simple random walk is transient on a…

概率论 · 数学 2007-05-23 Robin Pemantle , Yuval Peres

A Random Walk in Changing Environment (RWCE) is a weighted random walk on a locally finite, connected graph $G$ with random, time-dependent edge-weights. This includes self-interacting random walks, where the edge-weights depend on the…

概率论 · 数学 2024-06-24 Bryan Park , Souvik Ray

This thesis examines linearly edge-reinforced random walks on infinite trees. In particular, recurrence and transience of such random walks on general (fixed) trees as well as on Galton-Watson trees (i.e. random trees) is characterized, and…

概率论 · 数学 2023-09-01 Fabian Michel

We study the behavior of Random Walk in Random Environment (RWRE) on trees in the critical case left open in previous work. Representing the random walk by an electrical network, we assume that the ratios of resistances of neighboring edges…

概率论 · 数学 2007-05-23 Robin Pemantle , Yuval Peres

We consider the random walk in an independent and identically distributed (i.i.d.) random environment on a Cayley graph of a finite free product of copies of $\mathbb{Z}$ and $\mathbb{Z}_2$. Such a Cayley graph is readily seen to be a…

‹ 上一页 1 2 3 10 下一页 ›