Related papers: Random walks and random permutations
The betweenness centrality of graphs using random walk paths instead of geodesics is studied. A scaling collapse with no adjustable parameters is obtained as the graph size $N$ is varied; the scaling curve depends on the graph model. A…
Let ${Z_n}_{n\ge 0}$ be a random walk with a negative drift and i.i.d. increments with heavy-tailed distribution and let $M=\sup_{n\ge 0}Z_n$ be its supremum. Asmussen & Kl{\"u}ppelberg (1996) considered the behavior of the random walk…
We study a one-dimensional random walk with memory. The behavior of the walker is modified with respect to the simple symmetric random walk (SSRW) only when he is at the maximum distance ever reached from his starting point (home). In this…
We study the persistent random walk of photons on a one-dimensional lattice of random asymmetric transmittances. Each site is characterized by its intensity transmittance t (t') for photons moving to the right (left) direction.…
Consider a family of random ordered graph trees $(T_n)_{n\geq 1}$, where $T_n$ has $n$ vertices. It has previously been established that if the associated search-depth processes converge to the normalised Brownian excursion when rescaled…
We investigate the time averaged squared displacement (TASD) of continuous time random walks with respect to the number of steps $N$, which the random walker performed during the data acquisition time $T$. We prove that the TASD, and as…
Random walks provide a simple conventional model to describe various transport processes, for example propagation of heat or diffusion of matter through a medium. However, in many practical cases the medium is highly irregular due to…
Reflecting boundary conditions cause two one-dimensional random walks to synchronize if a common direction is chosen in each step. The mean synchronization time and its standard deviation are calculated analytically. Both quantities are…
We analyze random walk through fractal environments, embedded in 3-dimensional, permeable space. Particles travel freely and are scattered off into random directions when they hit the fractal. The statistical distribution of the flight…
We study point process convergence for sequences of iid random walks. The objective is to derive asymptotic theory for the extremes of these random walks. We show convergence of the maximum random walk to the Gumbel distribution under the…
Attributing a positive value \tau_x to each x in Z^d, we investigate a nearest-neighbour random walk which is reversible for the measure with weights (\tau_x), often known as "Bouchaud's trap model". We assume that these weights are…
Two approaches are suggested to the definition of asymmetric generalized Weibull distribution. These approaches are based on the representation of the two-sided Weibull distributions as variance-mean normal mixtures or more general…
Mathematical models of motility are often based on random-walk descriptions of discrete individuals that can move according to certain rules. It is usually the case that large masses concentrated in small regions of space have a great…
In \cite{SzT}, D. Sz\'asz and A. Telcs have shown that for the diffusively scaled, simple symmetric random walk, weak convergence to the Brownian motion holds even in the case of local impurities if $d \ge 2$. The extension of their result…
This article is devoted to the study of the behaviour of a (1+1)-dimensional model of random walk conditioned to enclose an area of order $N^2$. Such a conditioning enforces a globally concave trajectory. We study the local deviations of…
We study a class of discrete-time random walks in $\mathbb{R}^d$ whose conditional drift decays polynomially in time and grows polynomially with the distance from the origin to the current position. This class is related to several models…
In this article, we consider several models of random walks in one or several dimensions, additionally allowing, at any unit of time, a reset (or "catastrophe") of the walk with probability $q$. We establish the distribution of the final…
We numerically estimate the leading asymptotic behavior of the length $L_{n}$ of the longest increasing subsequence of random walks with step increments following Student's $t$-distribution with parameter in the range $1/2 \leq \nu \leq 5$.…
Random walk spaces are a general framework for the study of PDEs. They include as particular cases locally finite weighted connected graphs and nonlocal settings involving symmetric integrable kernels on $\mathbb{R}^N$. We are interested in…
Branching-stable processes have recently appeared as counterparts of stable subordinators, when addition of real variables is replaced by branching mechanism for point processes. Here, we are interested in their domains of attraction and…