Related papers: Inferring Tree Structure with Hidden Traps from Fi…
We explore a generating function trick which allows us to keep track of infinitely many statistics using finitely many variables, by recording their individual distributions rather than their joint distributions. Building on previous work…
Many random growth models have the property that the set of discovered sites, scaled properly, converges to some deterministic set as time grows. Such results are known as shape theorems. Typically, not much is known about the shapes. For…
It has long been appreciated that transport properties can control reaction kinetics. This effect can be characterized by the time it takes a diffusing molecule to reach a target -- the first-passage time (FPT). Although essential to…
A large and sparse random graph with independent exponentially distributed link weights can be used to model the propagation of messages or diseases in a network with an unknown connectivity structure. In this article we study an extended…
Using a beta-hairpin protein as a representative example of two-state folders, we studied how the exploration of native-like states affects the folding kinetics. It has been found that the first-passage time (FPT) distributions are…
The self-trapping transition due to a single and a dimer nonlinear impurity embedded in a Cayley tree is studied. In particular, the effect of a perfectly nonlinear Cayley tree is considered. A sharp self-trapping transition is observed in…
We study the first-passage-time (FPT) properties of an active Brownian particle under stochastic resetting to its initial configuration, comprising its position and orientation, to reach an absorbing wall in two dimensions. Coupling a…
The first-passage time is proposed as an independent thermodynamic parameter of the statistical distribution that generalizes the Gibbs distribution. The theory does not include the determination of the first passage statistics itself. A…
For both Levy flight and Levy walk search processes we analyse the full distribution of first-passage and first-hitting (or first-arrival) times. These are, respectively, the times when the particle moves across a point at some given…
We consider additive functionals $X_n(\phi)$ with small toll functions on split trees and a generalization of split trees, which we call fractional split trees, where the split vector does not need to sum up to 1. These additive functionals…
* ACTIVATED RANDOM WALK MODEL * This is a conservative particle system on the lattice, with a Markovian continuous-time evolution. Active particles perform random walks without interaction, and they may as well change their state to…
We present analytical results for the distribution of first return (FR) times of non-backtracking random walks (NBWs) on undirected configuration model networks consisting of $N$ nodes with degree distribution $P(k)$. We focus on the case…
The study of first passage percolation (FPP) for the random interlacements model has been initiated in arXiv:2112.12096, where it is shown that on $\mathbb{Z}^d$, $d\geq 3$, the FPP distance is comparable to the graph distance with high…
Paths are important structural elements in complex networks because they are finite (unlike walks), related to effective node coverage (minimum spanning trees), and can be understood as being dual to star connectivity. This article…
The study of first passage times for diffusing particles reaching target states is foundational in various practical applications, including diffusion-controlled reactions. In this work, we present a bi-scaling theory for the probability…
We obtain an exact formula for the first-passage time probability distribution for random walks on complex networks using inverse Laplace transform. We write the formula as the summation of finitely many terms with different frequencies…
We study fragmentation of a random recursive tree into a forest by repeated removal of nodes. The initial tree consists of N nodes and it is generated by sequential addition of nodes with each new node attaching to a randomly-selected…
We present analytical results for the distribution of first return (FR) times of random walks (RWs) on random regular graphs (RRGs) consisting of $N$ nodes of degree $c \ge 3$. Starting from a random initial node $i$ at time $t=0$, at each…
We explore first-passage phenomenology for biased active processes with a renewal-type structure, focusing in particular on paradigmatic run-and-tumble models in both discrete and continuous state spaces. In general, we show there is no…
The first-passage time (FPT) is a fundamental concept in stochastic processes, representing the time it takes for a process to reach a specified threshold for the first time. Often, considering a time-dependent threshold is essential for…