Related papers: Mesoscopic description of random walks on combs
Representations based on random walks can exploit discrete data distributions for clustering and classification. We extend such representations from discrete to continuous distributions. Transition probabilities are now calculated using a…
Exact results are obtained for random walks on finite lattice tubes with a single source and absorbing lattice sites at the ends. Explicit formulae are derived for the absorption probabilities at the ends and for the expectations that a…
In this paper, we present an overview of different types of random walk strategies with local and non-local transitions on undirected connected networks. We present a general approach to analyzing these strategies by defining the dynamics…
We present a probabilistic theory of random walks in turbid media with non-scattering regions. It is shown that important characteristics such as diffusion constants, average step lengths, crossing statistics and void spacings can be…
Random walks represent an important tool for probing the structural and dynamical properties of networks and modeling transport and diffusion processes on networks. However, when individuals' movement becomes dictated by more complicated…
We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…
We study the persistent random walk of photons on a one-dimensional lattice of random asymmetric transmittances. Each site is characterized by its intensity transmittance t (t') for photons moving to the right (left) direction.…
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…
Random walk is one of the most classical and well-studied model in probability theory. For two correlated random walks on lattice, every step of the random walks has only two states, moving in the same direction or moving in the opposite…
We study a diffusion process on a three-dimensional comb under stochastic resetting. We consider three different types of resetting: global resetting from any point in the comb to the initial position, resetting from a finger to the…
Two-dimensional networks of ordered quantum dots beyond the percolation threshold are studied, as typical example of conducting nanostructures with quenched random disorder. Theory predicts anomalous diffusion with stretched-exponential…
Expected urban population doubling calls for a compelling theory of the city. Random walks and diffusions defined on spatial city graphs spot hidden areas of geographical isolation in the urban landscape going downhill. First--passage time…
We study specific properties of particles transport by exploring an exact solvable model, a so-called comb structure, where diffusive transport of particles leads to subdiffusion. A performance of L\'evy -- like process enriches this…
A cyclic random walk is a random walk whose transition probabilities/rates can be written as a superposition of the empirical measures of a family of finite cycles. This identifies a convex set of models. We discuss the problem of…
Restrictions to molecular motion by barriers (membranes) are ubiquitous in biological tissues, porous media and composite materials. A major challenge is to characterize the microstructure of a material or an organism nondestructively using…
The food web is a directed graph in which nodes label species and directed links represent the predation between species. The cascade model generates random food webs. The continuum cascade model is a Poisson approximation of the cascade…
Superslow diffusion, i.e., the long-time diffusion of particles whose mean-square displacement (variance) grows slower than any power of time, is studied in the framework of the decoupled continuous-time random walk model. We show that this…
In the context of a random walk on an undirected graph, Kemeny's constant can measure the average travel time for a random walk between two randomly chosen vertices. We are interested in graphs that behave counter-intuitively in regard to…
Anomalous transport in a circular comb is considered. The circular motion takes place for a fixed radius, while radii are continuously distributed along the circle. Two scenarios of the anomalous transport, related to the reflecting and…
I start by reviewing some basic properties of random graphs. I then consider the role of random walks in complex networks and show how they may be used to explain why so many long tailed distributions are found in real data sets. The key…