Related papers: Localization of defects via residence time measure…

We formulate quantum tunneling as a time-of-arrival problem: we determine the detection probability for particles passing through a barrier at a detector located a distance L from the tunneling region. For this purpose, we use a…

In this paper we compare the concept of the tunneling time introduced in quant-ph/0405028 with those of the phase and dwell times. As is shown, unlike the latter our definition of the transmission time coincides, in the limit of weak…

We investigate a tight binding quantum walk on a graph. Repeated stroboscopic measurements of the position of the particle yield a measured "trajectory", and a combination of classical and quantum mechanical properties for the walk are…

We study the properties of discrete-time random walks on networks formed by randomly interconnected cliques, namely, random networks of cliques. Our purpose is to derive the parameters that define the network structure -- specifically, the…

Tracking the movement of tracer particles has long been a strategy for uncovering complex structures. Here, we study discrete-time random walks on finite Cayley trees to infer key parameters such as tree depth and geometric bias toward the…

We solve the problem of first-passage time for run-and-tumble particles in one dimension. Exact expression is derived for the mean first-passage time in the general case, considering external force-fields and chemotactic-fields, giving rise…

Chase-escape percolation is a variation of the standard epidemic spread models. In this model, each site can be in one of three states: unoccupied, occupied by a single prey, or occupied by a single predator. Prey particles spread to…

The dynamics of the survival probability of quantum walkers on a one-dimensional lattice with random distribution of absorbing immobile traps are investigated. The survival probability of quantum walkers is compared with that of classical…

We consider a one-dimensional simple random walk killed by quenched soft obstacles. The position of the obstacles is drawn according to a renewal process with a power-law increment distribution. In a previous work, we computed the…

The distribution of monomers along a linear polymer grafted on a hard wall is modelled by determining the probability distribution of occupied vertices of Dyck and ballot path models of adsorbing linear polymers. For example, the…

In this paper we present a computation of the mean first-passage times both for a random walk in a discrete bounded lattice, between a starting site and a target site, and for a Brownian motion in a bounded domain, where the target is a…

Hitting times provide a fundamental measure of distance in random processes, quantifying the expected number of steps for a random walk starting at node $u$ to reach node $v$. They have broad applications across domains such as network…

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 develop an analytical method to calculate encounter times of two random walkers in one dimension when each individual is segregated in its own spatial domain and shares with its neighbor only a fraction of the available space, finding…

First passage percolation on $\mathbb{Z}^2$ is a model for describing the spread of an infection on the sites of the square lattice. The infection is spread via nearest neighbor sites and the time dynamic is specified by random passage…

We study the statistical properties of the convex hull of a planar run-and-tumble particle (RTP), also known as the "persistent random walk", where the particle/walker runs ballistically between tumble events at which it changes its…

We consider a walker that at each step keeps the same direction with a probabilitythat depends on the time already spent in the direction the walker is currently moving. In this paper, we study some asymptotic properties of this persistent…

The statistics of self-avoiding random walks have been used to model polymer physics for decades. A self-avoiding walk that grows one step at a time on a lattice will eventually trap itself, which occurs after an average of 71 steps on a…

Exact results are obtained for random walks on finite lattice tubes with a single source and absorbing lattice sites at the ends. Explicit formulae are derived for the absorption probabilities at the ends and for the expectations that a…

We show in random matrix theory, microwave measurements, and computer simulations that the mean free path of a random medium and the strength and position of an embedded reflector can be determined from radiation scattered by the system.…