中文
相关论文

相关论文: Remarks on random walks on graphs and the Floyd bo…

200 篇论文

This paper studies the boundary behaviour of $\lambda$-polyharmonic functions for the simple random walk operator on a regular tree, where $\lambda$ is complex and $|\lambda|> \rho$, the $\ell^2$-spectral radius of the random walk. In…

概率论 · 数学 2022-06-10 Ecaterina Sava-Huss , Wolfgang Woess

In this paper we establish a version of the Margulis Roblin equidistribution theorem's for harmonic measures. As a consequence a von Neumann type theorem is obtained for boundary actions and the irreducibility of the associated…

动力系统 · 数学 2020-01-14 Kevin Boucher

We consider the Dirichlet problem for solutions to general second-order homogeneous elliptic equations with constant complex coefficients. We prove that any Jordan domain with $C^{1,\alpha}$-smooth boundary, $0<\alpha<1$, is not regular…

复变函数 · 数学 2021-06-03 Astamur Bagapsh , Konstantin Fedorovskiy , Maksim Mazalov

We consider open quantum walks on a graph, and consider the random variables defined as the passage time and number of visits to a given point of the graph. We study in particular the probability that the passage time is finite, the…

数学物理 · 物理学 2017-11-10 Ivan Bardet , Denis Bernard , Yan Pautrat

This paper states a law of large numbers for a random walk in a random iid environment on ${\mathbb Z}^d$, where the environment follows some Dirichlet distribution. Moreover, we give explicit bounds for the asymptotic velocity of the…

概率论 · 数学 2007-05-23 Nathanaël Enriquez , Christophe Sabot

Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…

概率论 · 数学 2020-05-20 Julien Petit , Renaud Lambiotte , Timoteo Carletti

Random transvections generate a walk on the space of symplectic forms on $\mathbf{F}_q^{2n}$. The main result is establishing cutoff for this Markov chain. After $n+c$ steps, the walk is close to uniform while before $n-c$, it is far from…

概率论 · 数学 2021-02-15 Jimmy He

In this paper, we deal with the inner boundary of random walk range, that is, the set of those points in a random walk range which have at least one neighbor site outside the range. If $L_n$ be the number of the inner boundary points of…

概率论 · 数学 2014-12-25 Izumi Okada

On a transient weighted graph, there are two models of random walk which continue after reaching infinity: random interlacements, and random walk reflected off of infinity, recently introduced in arXiv:2506.18827 [math.PR]. We prove these…

概率论 · 数学 2025-12-10 Yao Yu

We introduce a new self-interacting random walk on the integers in a dynamic random environment and show that it converges to a pure diffusion in the scaling limit. We also find a lower bound on the diffusion coefficient in some special…

概率论 · 数学 2007-05-23 Majid Hosseini , Krishnamurthi Ravishankar

A constrained diffusive random walk of n steps and a random flight in Rd, which can be expressed in the same terms, were investigated independently in recent papers. The n steps of the walk are identically and independently distributed…

统计力学 · 物理学 2010-07-28 G. Le Caer

We obtain expected number of arrivals, absorption probabilities and expected time until absorption for an asymmetric discrete random walk on a graph in the presence of multiple function barriers. On each edge of the graph and in each vertex…

概率论 · 数学 2023-07-26 Theo van Uem

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

We prove an analogue of the classical ballot theorem that holds for any random walk in the range of attraction of the normal distribution. Our result is best possible: we exhibit examples demonstrating that if any of our hypotheses are…

概率论 · 数学 2008-02-28 L. Addario-Berry , B. A. Reed

We give upper and lower bounds on the spectral radius of a graph in terms of the number of walks. We generalize a number of known results.

组合数学 · 数学 2007-05-23 Vladimir Nikiforov

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

The usual random walk on a group (homogeneous both in time and in space) is determined by a probability measure on the group. In a random walk with random transition probabilities this single measure is replaced with a stationary sequence…

概率论 · 数学 2007-05-23 Vadim A. Kaimanovich , Yuri Kifer , Ben-Zion Rubshtein

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…

In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density $\rho \in (0,\infty)$.…

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