Related papers: Inferring Tree Structure with Hidden Traps from Fi…
For more than a century lattice random walks have been employed ubiquitously, both as a theoretical laboratory to develop intuition about more complex stochastic processes and as a tool to interpret a vast array of empirical observations.…
Often sharp changes in cellular behavior are triggered by thresholded events, i.e., by the attainment of a threshold value of a relevant cellular or molecular dynamical variable. Since the governing variable itself typically undergoes noisy…
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…
In this paper, we consider the random walk process on a kind of fractal (or transfractal) scale free networks, which also called as $(u,v)$ flowers, and we focus on the global first passage time (GFPT) and first return time (FRT). Here, we…
Random walks are used for modeling various dynamics in, for example, physical, biological, and social contexts. Furthermore, their characteristics provide us with useful information on the phase transition and critical phenomena of even…
We present a general framework, applicable to a broad class of random walks on complex networks, which provides a rigorous lower bound for the mean first-passage time of a random walker to a target site averaged over its starting position,…
The random walk process underlies the description of a large number of real world phenomena. Here we provide the study of random walk processes in time varying networks in the regime of time-scale mixing; i.e. when the network connectivity…
With the advance of experimental techniques such as time-lapse fluorescence microscopy, the availability of single-cell trajectory data has vastly increased, and so has the demand for computational methods suitable for parameter inference…
We study the random m-ary search tree model (where m stands for the number of branches of a search tree), an important problem for data storage in computer science, using a variety of statistical physics techniques that allow us to obtain…
We consider the inference of the structure of an undirected graphical model in an exact Bayesian framework. More specifically we aim at achieving the inference with close-form posteriors, avoiding any sampling step. This task would be…
We investigate the first-passage properties of bursty random walks on a finite one-dimensional interval of length L, in which unit-length steps to the left occur with probability close to one, while steps of length b to the right --…
Subdiffusive motion of tracer particles in complex crowded environments, such as biological cells, has been shown to be widepsread. This deviation from brownian motion is usually characterized by a sublinear time dependence of the mean…
The object of the present investigation is an ensemble of self-avoiding and directed graphs belonging to eight-branching Cayley tree (Bethe lattice) generated by the Fucsian group of a Riemann surface of genus two and embedded in the…
The kinetics of a variety of transport-controlled processes can be reduced to the problem of determining the mean time needed to arrive at a given location for the first time, the so called mean first passage time (MFPT) problem. The…
In the previous chapters, we explored the effects of resetting on networks considering one and two nodes. In this chapter, we will describe a generalization of random walks with resetting to an arbitrary number of nodes $\mathcal{M}$. In…
The first-return time is the time that it takes a random walker to go back to the initial position for the first time. We study the first-return time when random walkers perform fractional kinetics, specifically fractional diffusion, that…
We study the statistics of first passage times (FPTs) of trajectory observables in both classical and quantum Markov processes. We consider specifically the FPTs of counting observables, that is, the times to reach a certain threshold of a…
We study a generalization of the standard trapping problem of random walk theory in which particles move subdiffusively on a one-dimensional lattice. We consider the cases in which the lattice is filled with a one-sided and a two-sided…
Quantifying how spatial disorder affects the movement of a diffusing particle or agent is fundamental to target search studies. When diffusion occurs on a network, that is on a highly disordered environment, we lack the mathematical tools…
Fractals are fascinating structures, not only for their aesthetic appeal, but also because they allow for the investigation of physical properties in non-integer dimensions. In these unconventional systems, a myriad of intrinsic features…