相关论文: Probability distribution of the sizes of largest e…

We outline basic properties of a symmetric random walk in one dimension, in which the length of the nth step equals lambda^n, with lambda<1. As the number of steps N-->oo, the probability that the endpoint is at x, P_{lambda}(x;N),…

We consider nearest neighbour spatial random permutations on $\mathbb{Z}^d$. In this case, the energy of the system is proportional the sum of all cycle lengths, and the system can be interpreted as an ensemble of edge-weighted, mutually…

We revisit the statistics of extremes and records of symmetric random walks with stochastic resetting, extending earlier studies in several directions. We put forward a diffusive scaling regime (symmetric step length distribution with…

We introduce partial loop-erasing operators. We show that by applying a refinement sequence of partial loop-erasing operators to a finite Markov chain, we get a process equivalent to the chronological loop-erased Markov chain. As an…

We propose an approximation for the first return time distribution of random walks on undirected networks. We combine a message-passing solution with a mean-field approximation, to account for the short- and long-term behaviours…

Discrete-time quantum walks are considered a counterpart of random walks and the study for them has been getting attention since around 2000. In this paper, we focus on a quantum walk which generates a probability distribution splitting to…

Quantum walks are quantum counterparts of random walks and their probability distributions are different from each other. A quantum walker distributes on a Hilbert space and it is observed at a location with a probability. The finding…

The probability distribution of the number $s$ of distinct sites visited up to time $t$ by a random walk on the fully-connected lattice with $N$ sites is first obtained by solving the eigenvalue problem associated with the discrete master…

We study the long-time behavior of decoupled continuous-time random walks characterized by superheavy-tailed distributions of waiting times and symmetric heavy-tailed distributions of jump lengths. Our main quantity of interest is the…

A random walk with echoed steps (RWES) is a process $\{\tilde{S}_n\}_{n\geq1}=\{\tilde{X}_1+\cdots+\tilde{X}_n\}_{n\geq1}$ that inserts memory and echo into an ordinary random walk (ORW) with i.i.d. steps, $X_1+\cdots+X_n$. The RWES is…

We investigate statistics of lead changes of the maxima of two discrete-time random walks in one dimension. We show that the average number of lead changes grows as $\pi^{-1}\ln(t)$ in the long-time limit. We present theoretical and…

We provide Monte Carlo estimates of the scaling of the length $L_{n}$ of the longest increasing subsequences of $n$-steps random walks for several different distributions of step lengths, short and heavy-tailed. Our simulations indicate…

This paper investigates the large deviation problem in the sample path space of the nearest-neighbor random walks on regular trees. We establish the sample path large deviation principle for the law of the distance from a nearest random…

We present computer simulations to examine probability distributions of gyration radius for the no-thickness closed polymers of N straight segments of equal length. We are particularly interested in the conditional distributions when the…

We consider random walks on random graphs, focusing on return probabilities and hitting times for sparse Erdos-Renyi graphs. Using the tree approach which is expected to be exact in the large graph limit, we show how to solve for the…

When random walks on a square lattice are biased horizontally to move solely to the right, the probability distribution of their algebraic area can be exactly obtained. We explicitly map this biased classical random system on a non…

We consider one-dimensional discrete-time random walks (RWs) in the presence of finite size traps of length $\ell$ over which the RWs can jump. We study the survival probability of such RWs when the traps are periodically distributed and…

A quantum random walk on the integers exhibits pseudo memory effects, in that its probability distribution after N steps is determined by reshuffling the first N distributions that arise in a classical random walk with the same initial…

We study the entropy of the distribution of the set R_n of vertices visited by a simple random walk on a graph with bounded degrees in its first n steps. It is shown that this quantity grows linearly in the expected size of R_n if the graph…

We find that the probability distribution for the largest intervals $p(l)$ exhibits universal properties for different systems including random walk and random cutting models. In particular, $p(l)$ has an infinite set of singularities at…