Related papers: Explicit determination of mean first-passage time …
We investigate the translocation of a single stranded DNA through a pore which fluctuates between two conformations, using coupled master equations. The probability density function of the first passage times (FPT) of the translocation…
A Multinomial Processing Tree (MPT) is a directed tree with a probability associated with each arc. Here we consider an additional parameter associated with each arc, a measure such as the time required to select the arc. MPTs are often…
Interactive programming environments are powerful tools for promoting innovative network thinking, teaching science of complexity, and exploring emergent phenomena. This paper reports on our recent development of the deterministic random…
We consider a random walk in confined geometry, starting from a site and eventually reaching a target site. We calculate analytically the distribution of the occupation time on a third site, before reaching the target site. The obtained…
We study Random Walks in an i.i.d. Random Environment (RWRE) defined on $b$-regular trees. We prove a functional central limit theorem (FCLT) for transient processes, under a moment condition on the environment. We emphasize that we make no…
We derive the generalized master equation for reaction-diffusion on networks from an underlying stochastic process, the continuous time random walk (CTRW). The non-trivial incorporation of the reaction process into the CTRW is achieved by…
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…
We derive a thermodynamic uncertainty relation (TUR) for first-passage times (FPTs) on continuous time Markov chains. The TUR utilizes the entropy production coming from bidirectional transitions, and the net flux coming from unidirectional…
Geodesic distance, sometimes called shortest path length, has proven useful in a great variety of applications, such as information retrieval on networks including treelike networked models. Here, our goal is to analytically determine the…
Motion in bounded domains is a fundamental concept in various fields, including billiard dynamics and random walks on finite lattices, with important applications in physics, ecology and biology. An important universal property related to…
In source routing, a complete path is chosen for a packet to travel from source to destination. While computing the time to traverse such a path may be straightforward in a fixed, static graph, doing so becomes much more challenging in…
Network growth models that embody principles such as preferential attachment and local attachment rules have received much attention over the last decade. Among various approaches, random walks have been leveraged to capture such…
The rotor router model is a popular deterministic analogue of a random walk on a graph. Instead of moving to a random neighbor, the neighbors are served in a fixed order. We examine how fast this "deterministic random walk" covers all…
We extend the random walk framework to include compounded steps, providing first-passage time (FPT) properties for a new class of superdiffusive processes, which are governed by the space-fractional spectral Fokker-Planck equation. This…
Motivated by a derandomization of Markov chain Monte Carlo (MCMC), this paper investigates deterministic random walks, which is a deterministic process analogous to a random walk. While there are several progresses on the analysis of the…
We study analytically an intermittent search process in one dimension. There is an immobile target at the origin and a searcher undergoes a discrete time jump process starting at $x_0\geq0$, where successive jumps are drawn independently…
Random walks are gaining much attention from the networks research community. They are the basis of many proposals aimed to solve a variety of network-related problems such as resource location, network construction, nodes sampling, etc.…
In this work we consider the first encounter problems between a fixed and/or mobile target A and a moving trap B on Bethe Lattices and Cayley trees. The survival probability (SP) of the target A on the both kinds of structures are analyzed…
We consider continuous time random walks (CTRW) for open systems that exchange energy and matter with multiple reservoirs. Each waiting time distribution (WTD) for times between steps is characterized by a positive parameter a, which is set…
Many biological processes involve one dimensional diffusion over a correlated inhomogeneous energy landscape with a correlation length $\xi_c$. Typical examples are specific protein target location on DNA, nucleosome repositioning, or DNA…