Related papers: Anomalous biased diffusion in networks
We study the extreme value statistics of a run and tumble particle (RTP) in one dimension till its first passage to the origin starting from the position $x_0~(>0)$. This model has recently drawn a lot of interest due to its biological…
In this paper we analyze the effects of stochastic resetting on an encounter-based model of an unbiased run-and-tumble particle (RTP) confined to the half-line $[0,\infty)$ with a partially absorbing wall at $x=0$. The RTP tumbles at a…
We consider random networks whose dynamics is described by a rate equation, with transition rates $w_{nm}$ that form a symmetric matrix. The long time evolution of the system is characterized by a diffusion coefficient $D$. In one dimension…
We present the analytical and numerical results of a random walk on the family of small-world graphs. The average access time shows a crossover from the regular to random behavior with increasing distance from the starting point of the…
In this paper, we analyze a shared access network with a fixed primary node and randomly distributed secondary nodes whose distribution follows a Poisson point process (PPP). The secondaries use a random access protocol allowing them to…
The current body of research on terahertz (THz) wireless communications predominantly focuses on its application for single-user backhaul/fronthaul connectivity at sub-THz frequencies. First, we develop a generalized statistical model for…
We consider the boundary crossing problem for time-homogeneous diffusions and general curvilinear boundaries. Bounds are derived for the approximation error of the one-sided (upper) boundary crossing probability when replacing the original…
Piecewise Diffusion Markov Processes (PDifMPs) are valuable for modelling systems where continuous dynamics are interrupted by sudden shifts and/or changes in drift and diffusion. The first-passage time (FPT) in such models plays a central…
Random linear network coding (RLNC) unicast protocol is analyzed over a rapidly-changing network topology. We model the probability mass function (pmf) of the dissemination time as a sequence of independent geometric random variables whose…
We study the random walk of a particle in a compartmentalized environment, as realized in biological samples or solid state compounds. Each compartment is characterized by its length $L$ and the boundaries transmittance $T$. We identify two…
We develop an analytical approach which provides the dependence of the mean first-passage time (MFPT) for random walks on complex networks both on the target connectivity and on the source-target distance. Our approach puts forward two…
We present an analytical method for computing the mean cover time of a random walk process on arbitrary, complex networks. The cover time is defined as the time a random walker requires to visit every node in the network at least once. This…
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assume that initially one node in a given network holds some…
Resetting or restart, when applied to a stochastic process, usually brings its dynamics to a time-independent stationary state. In turn, the optimal resetting rate makes the mean time to reach a target to be the shortest one. These and…
A relation between the effective diffusion coefficient in a lattice with random site energies and random trasition rates and the macroscopic conductivity in a random resistor network allows for elucidating possible sources of anomalous…
In studying network growth, the conventional approach is to devise a growth mechanism, quantify the evolution of a statistic or distribution (such as the degree distribution), and then solve the equations in the steady state (the…
In a wide range of complex networks, the links between the nodes are temporal and may sporadically appear and disappear. This temporality is fundamental to analyze the formation of paths within such networks. Moreover, the presence of the…
We report numerical simulations of a strongly biased diffusion process on a one-dimensional substrate with directed shortcuts between randomly chosen sites, i.e. with a small-world-like structure. We find that, unlike many other dynamical…
The scale-free (SF) networks that have been studied so far contained quenched disorder generated by random dilution which does not vary with the time. In practice, if a SF network is to represent, for example, the worldwide web, then the…
We study the first-passage-time (FPT) properties of active Brownian particles to reach an absorbing wall in two dimensions. Employing a perturbation approach we obtain exact analytical predictions for the survival and FPT distributions for…