Related papers: Mesoscopic description of random walks on combs

We develop rigorous, analytic techniques to study the behaviour of biased random walks on combs. This enables us to calculate exactly the spectral dimension of random comb ensembles for any bias scenario in the teeth or spine. Two specific…

We consider biased random walks on random networks constituted by a random comb comprising a backbone with quenched-disordered random-length branches. The backbone and the branches run in the direction of the bias. For the bare model as…

We suggest a modification of a comb model to describe anomalous transport in spiny dendrites. Geometry of the comb structure consisting of a one-dimensional backbone and lateral branches makes it possible to describe anomalous diffusion,…

We address the dynamics of interacting particles on a disordered lattice formed by a random comb. The dynamics comprises that of the asymmetric simple exclusion process, whereby motion to nearest-neighour sites that are empty is more likely…

We develop techniques to obtain rigorous bounds on the behaviour of random walks on combs. Using these bounds we calculate exactly the spectral dimension of random combs with infinite teeth at random positions or teeth with random but…

We consider random walks on comb- and brush-like graphs consisting of a base (of fractal dimension $D$) decorated with attached side-groups. The graphs are also characterized by the fractal dimension $D_a$ of a set of anchor points where…

Random walks are ubiquitous in the sciences, and they are interesting from both theoretical and practical perspectives. They are one of the most fundamental types of stochastic processes; can be used to model numerous phenomena, including…

This chapter is a contribution in the "Handbook of Applications of Chaos Theory" ed. by Prof. Christos H Skiadas. The chapter is organized as follows. First we study the statistical properties of combs and explain how to reduce the effect…

We study diffusion on comb lattices of arbitrary dimension. Relying on the loopless structure of these lattices and using first-passage properties, we obtain exact and explicit formulae for the Laplace transforms of the propagators…

The graph obtained from the integer grid Z x Z by the removal of all horizontal edges that do not belong to the x-axis is called a comb. In a random walk on a graph, whenever a walker is at a vertex v, in the next step it will visit one of…

Starting from a simple animal-biology example, a general, somewhat counter-intuitive property of diffusion random walks is presented. It is shown that for any (non-homogeneous) purely diffusing system, under any isotropic uniform incidence,…

We study continuous time quantum walk on a random comb graph with infinite teeth. Due to localization effects along the spine, the walk cannot go to infinity in the spine direction, while it can escape to infinity along the teeth of the…

The motion of self-propelled particles is modeled as a persistent random walk. An analytical framework is developed that allows the derivation of exact expressions for the time evolution of arbitrary moments of the persistent walk's…

Random walks are studied on disordered cellular networks in 2-and 3-dimensional spaces with arbitrary curvature. The coefficients of the evolution equation are calculated in term of the structural properties of the cellular system. The…

We revisit the diffusion properties and the mean drift induced by an external field of a random walk process in a class of branched structures, as the comb lattice and the linear chains of plaquettes. A simple treatment based on scaling…

We study the dynamics of a tracer particle (TP) on a comb lattice populated by randomly moving hard-core particles in the dense limit. We first consider the case where the TP is constrained to move on the backbone of the comb only, and, in…

We investigate the asymptotical behaviour of the transition probabilities of the simple random walk on the 2-comb. In particular we obtain space-time uniform asymptotical estimates which show the lack of symmetry of this walk better than…

We study the path behavior of the simple symmetric walk on some comb-type subsets of Z^2 which are obtained from Z^2 by removing all horizontal edges belonging to certain sets of values on the y-axis. We obtain some strong approximation…

We consider random walk on the structure given by a random hypergraph in the regime where there is a unique giant component. We give the asymptotics for hitting times, cover times, and commute times and show that the results obtained for…

A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…