Related papers: Correlation Functions, Mean First Passage Times an…
Milestoning is an efficient method for rare event kinetics calculation using short trajectory parallelization. Mean first passage time (MFPT) is the key kinetic output of Milestoning, whose accuracy crucially depends the initial…
The influence of a time-periodic forcing on stochastic processes can essentially be emphasized in the large time behaviour of their paths. The statistics of transition in a simple Markov chain model permits to quantify this influence. In…
We study distributions of meeting times for finite symmetric Markov chains. For Markov kernels defined on large state spaces which satisfy certain weak inhomogeneity in return probabilities of points up to large numbers of steps, we obtain…
Queueing networks are notoriously difficult to analyze sans both Markovian and stationarity assumptions. Much of the theoretical contribution towards performance analysis of time-inhomogeneous single class queueing networks has focused on…
We propose a method to approximate continuous-time, continuous-state stochastic processes by a discrete-time Markov chain defined on a nonuniform grid. Our method provides exact moment matching for processes whose first and second moments…
We derive an approximate but explicit formula for the Mean First Passage Time of a random walker between a source and a target node of a directed and weighted network. The formula does not require any matrix inversion, and it takes as only…
Beyond the conventional quantum regression theorem, a general formula for non-Markovian correlation functions of arbitrary system operators both in the time- and frequency-domain is given. We approach the problem by transforming the…
A possibly time-dependent transition intensity matrix or generator $(Q(t))$ characterizes the law of a Markov jump process (MP). For a time homogeneous MP, the transition probability matrix (TPM) can be expressed as a matrix exponential of…
Motivated by discrete kinetic models for non-cooperative molecular motors on periodic tracks, we consider random walks (also not Markov) on quasi one dimensional (1d) lattices, obtained by gluing several copies of a fundamental graph in a…
Motivated by the dynamics of resonant neurons we discuss the properties of the first passage time (FPT) densities for nonmarkovian differentiable random processes. We start from an exact expression for the FPT density in terms of an…
Markov chains are a class of probabilistic models that have achieved widespread application in the quantitative sciences. This is in part due to their versatility, but is compounded by the ease with which they can be probed analytically.…
Kinesins are processive motor proteins that move along microtubules in a stepwise manner, and their motion is powered by the hydrolysis of ATP. Recent experiments have investigated the coupling between the individual steps of single kinesin…
Sequential and quantum Monte Carlo methods, as well as genetic type search algorithms can be interpreted as a mean field and interacting particle approximations of Feynman-Kac models in distribution spaces. The performance of these…
The molecular motor protein kinesin plays a key role in fundamental cellular processes such as intracellular transport, mitotic spindle formation, and cytokinesis, with important implications for neurodegenerative and cancer disease…
The kinematic wave theory, originally proposed by (Lighthill and Whitham, 1955b; Richards, 1956), has been a good candidate for studying vehicular traffic. In this dissertation, we study kinematic wave models of network traffic, which are…
Coherent energy transfer in pigment-protein complexes has been studied by mapping the quantum network to a kinetic network. This gives an analytic way to find parameter values for optimal transfer efficiency. In the case of the…
For Markov jump processes on irreducible networks with finite number of sites, we derive a general and explicit expression of the squared coefficient of variation for the net number of transitions from one site to a connected site in a…
Many biological, social, and communication systems can be modeled by ``searchers'' moving through a complex network. For example, intracellular cargo is transported on tubular networks, news and rumors spread through online social networks,…
Epigenetic cell memory, the inheritance of gene expression patterns across subsequent cell divisions, is a critical property of multi-cellular organisms. In recent work [10], a subset of the authors observed in a simulation study how the…
Given a stochastic matrix $P$ partitioned in four blocks $P_{ij}$, $i,j=1,2$, Kemeny's constant $\kappa(P)$ is expressed in terms of Kemeny's constants of the stochastic complements $P_1=P_{11}+P_{12}(I-P_{22})^{-1}P_{21}$, and…