相关论文: Local Time in Parisian Walkways

We consider two continuous-time generalizations of conservative random walks introduced in [J.Englander and S.Volkov (2022)], an orthogonal and a spherically-symmetrical one; the latter model is known as {\em random flights}. For both…

This paper presents the strong law of large numbers for a function of the local times of a transient random walk on groups, extending the research of Asymont and Korshunov for random walks on the integer lattice $\mathbb{Z}^d$. Under some…

In this paper we consider the simple random walk on $\mathbb{Z}^d$, $d \geq 3$, conditioned to stay in a large domain $D_N$ of typical diameter $N$. Considering the range up to time $t_N \geq N^{2+\delta}$ for some $\delta > 0$, we…

Locally Markov walks are natural generalizations of classical Markov chains, where instead of a particle moving independently of the past, it decides where to move next depending on the last action performed at the current location. We…

Our objective is to explore random walks on the general linear group, constrained to a specific domain, with a primary focus on establishing the conditioned local limit theorem. This paper marks the initial stride toward achieving this…

We show that probability is locally conserved in discrete time quantum walks, corresponding to a particle evolving in discrete space and time. In particular, for a spatial structure represented by an arbitrary directed graph, and any…

We study the biased random walk process in random uncorrelated networks with arbitrary degree distributions. In our model, the bias is defined by the preferential transition probability, which, in recent years, has been commonly used to…

We present a novel computational method of first-passage times between a starting site and a target site of regular bounded lattices. We derive accurate expressions for all the moments of this first-passage time, validated by numerical…

This paper presents a realistic, stochastic, and local model that reproduces nonrelativistic quantum mechanics (QM) results without using its mathematical formulation. The proposed model only uses integer-valued quantities and operations on…

Using the results of Ding, Lee, Peres [3], we develop formulas to compute the hitting times and cover times for random walks on groups. We developed an explicit formula for hitting times in terms of the irreducible representations of the…

We examine the aggregate behavior of one-dimensional random walks in a model known as (one-dimensional) Internal Diffusion Limited Aggregation. In this model, a sequence of $n$ particles perform random walks on the integers, beginning at…

A random walk is known as a random process which describes a path including a succession of random steps in the mathematical space. It has increasingly been popular in various disciplines such as mathematics and computer science.…

We consider the continuous time version of the `true' or `myopic' self-avoiding random walk with site repulsion in 1d. The Ray-Knight-type method which was applied to the discrete time and edge repulsion case, is applicable to this model…

We study the escape probability problem in random walks over graphs. Given vertices, $s,t,$ and $p$, the problem asks for the probability that a random walk starting at $s$ will hit $t$ before hitting $p$. Such probabilities can be…

This survey is concerned with random walks on mapping class groups. We illustrate how the actions of mapping class groups on Teichm\"uller spaces or curve complexes reveal the nature of random walks, and vice versa. Our emphasis is on the…

We give a complete expansion, at any accuracy order, for the iterated convolution of a complex valued integrable sequence in one space dimension. The remainders are estimated sharply with generalized Gaussian bounds. The result applies in…

A second-order random walk on a graph or network is a random walk where transition probabilities depend not only on the present node but also on the previous one. A notable example is the non-backtracking random walk, where the walker is…

We derive an exact closed-form analytical expression for the distribution of the cover time for a random walk over an arbitrary graph. In special case, we derive simplified exact expressions for the distributions of cover time for a…

We consider a random walk on the first quadrant of the square lattice, whose increment law is, roughly speaking, homogeneous along a finite number of half-lines near each of the two boundaries, and hence essentially specified by…

We present a heuristic derivation of the first passage time exponent for the integral of a random walk [Y. G. Sinai, Theor. Math. Phys. {\bf 90}, 219 (1992)]. Building on this derivation, we construct an estimation scheme to understand the…