Related papers: Random walks on bifractal networks
In the present work, we study random walks on complex networks subject to stochastic resetting when the resetting probability is node-dependent. Using a renewal approach, we derive the exact expressions of the stationary occupation…
The possibility to identify the nature (e.g. random or scale free) of complex networks while performing respective random walks is investigated with respect to autonomous agents based on Bayesian decision theory and humans navigating…
Though classical random walks have been studied for many years, research concerning their quantum analogues, quantum random walks, has only come about recently. Numerous simulations of both types of walks have been run and analyzed, and are…
We study domain walls in 2d Ising spin glasses in terms of a minimum-weight path problem. Using this approach, large systems can be treated exactly. Our focus is on the fractal dimension $d_f$ of domain walls, which describes via $<\ell…
A symmetric branching random walk (BRW) on a free group $\mathbb{F}$ is transient if and only if the mean offspring number $r$ does not exceed $R$, the reciprocal of the spectral radius of the underlying random walk. In this regime, the…
Chromosomes in the nucleus assemble into hierarchies of 3D domains that, during interphase, share essential features with a knot-free condensed polymer known as the fractal globule (FG). The FG-like chromosome likely affects macromolecular…
We measure the fractal dimension of loop-erased random walk (LERW) in 3 dimensions, and estimate that it is 1.62400 +- 0.00005. LERW is closely related to the uniform spanning tree and the abelian sandpile model. We simulated LERW on both…
A recently developed model of random walks on a $D$-dimensional hyperspherical lattice, where $D$ is {\sl not} restricted to integer values, is extended to include the possibility of creating and annihilating random walkers. Steady-state…
We considered diffusion-driven processes on small-world networks with distance-dependent random links. The study of diffusion on such networks is motivated by transport on randomly folded polymer chains, synchronization problems in…
A fundamental insight in the theory of diffusive random walks is that the mean length of trajectories traversing a finite open system is independent of the details of the diffusion process. Instead, the mean trajectory length depends only…
Spatial patterns and processes of cities can be described with various entropy functions. However, spatial entropy always depends on the scale of measurement, and it is difficult to find a characteristic value for it. In contrast, fractal…
We consider the range of the simple random walk on graphs with spectral dimension two. We give a form of strong law of large numbers under a certain uniform condition, which is satisfied by not only the square integer lattice but also a…
The small-world networks recently introduced by Watts and Strogatz [Nature 393, 440 (1998)] has attracted much interests in studying the interesting properties of the networks without time-delay. However, a signal or influence travelling on…
The spatial coverage produced by a single discrete-time random walk, with asymmetric jump probability $p\neq 1/2$ and non-uniform steps, moving on an infinite one-dimensional lattice is investigated. Analytical calculations are complemented…
The critical behaviour of correlation functions near a boundary is modified from that in the bulk. When the boundary is smooth this is known to be characterised by the surface scaling dimension $\xt$. We consider the case when the boundary…
Estimating distributions of node characteristics (labels) such as number of connections or citizenship of users in a social network via edge and node sampling is a vital part of the study of complex networks. Due to its low cost, sampling…
Complex network formalism allows to explain the behavior of systems composed by interacting units. Several prototypical network models have been proposed thus far. The small-world model has been introduced to mimic two important features…
The set of visited sites and the number of visited sites are two basic properties of the random walk trajectory. We consider two independent random walks on a hyper-cubic lattice and study ordering probabilities associated with these…
We consider a family of one-dimensional self interacting walks whose dynamics characterized by a monotone weight function $w$ on $\mathbb{N}\cup \{0\}$. The weight function takes the form $w(n) = (1 + 2^p Bn^{-p} + O(n^{-1-\kappa}))^{-1}$,…
The geometry of fracture patterns in a dilute elastic network is explored using molecular dynamics simulation. The network in two dimensions is subjected to a uniform strain which drives the fracture to develop by the growth and coalescence…