Related papers: Random walks on complex networks with inhomogeneou…
Deterministic walks over a random set of points in one and two dimensions (d=1,2) are considered. Points (``cities'') are randomly scattered in R^d following a uniform distribution. A walker (a ``tourist''), at each time step, goes to the…
Random walks find extensive application across various complex network domains, including embedding generation and link prediction. Despite the widespread utilization of random walks, the precise impact of distinct biases on embedding…
We study the extreme events taking place on complex networks. The transport on networks is modelled using random walks and we compute the probability for the occurance and recurrence of extreme events on the network. We show that the nodes…
A random walk is known as a random process which describes a path including a succession of random steps in the mathematical space. It has increasingly been popular in various disciplines such as mathematics and computer science.…
In this paper, we investigate random walks in a family of small-world trees having an exponential degree distribution. First, we address a trapping problem, that is, a particular case of random walks with an immobile trap located at the…
Simple random walks are a basic staple of the foundation of probability theory and form the building block of many useful and complex stochastic processes. In this paper we study a natural generalization of the random walk to a process in…
Complex systems comprise a large number of interacting elements, whose dynamics is not always a priori known. In these cases -- in order to uncover their key features -- we have to turn to empirical methods, one of which was recently…
The random walk with choice is a well known variation to the random walk that first selects a subset of $d$ neighbours nodes and then decides to move to the node which maximizes the value of a certain metric; this metric captures the number…
Traffic fluctuation has so far been studied on unweighted networks. However many real traffic systems are better represented as weighted networks, where nodes and links are assigned a weight value representing their physical properties such…
We study the mean field approximation of a recent model of cascades on networks relevant to the investigation of systemic risk control in financial networks. In the model, the hypothesis of a trend reinforcement in the stochastic process…
Random walks serve as important tools for studying complex network structures, yet their dynamics in cases where transition probabilities are not static remain under explored and poorly understood. Here we study nonlinear random walks that…
We study the biased random walk process in random uncorrelated networks with arbitrary degree distributions. In our model, the bias is defined by the preferential transition probability, which, in recent years, has been commonly used to…
The Riemann walk is the lattice version of the Levy flight. For the one-dimensional Riemann walk of Levy exponent 0<\alpha<2 we study the statistics of the support, i.e. the set of visited sites, after t steps. We consider a wide class of…
We study exploration properties of a random walk on a network. For a fully connected network we find that the problem can be mapped to the well known coupon collector problem, thus allowing us to estimate form of $P(S,t)$: the distribution…
We study a random walk in random environment on the non-negative integers. The random environment is not homogeneous in law, but is a mixture of two kinds of site, one in asymptotically vanishing proportion. The two kinds of site are (i)…
We introduce a general framework, applicable to a broad class of random walks on networks, that quantifies the response of the mean first-passage time to a target node to a local perturbation of the network, both in the context of attacks…
Random walks and related spatial stochastic models have been used in a range of application areas including animal and plant ecology, infectious disease epidemiology, developmental biology, wound healing, and oncology. Classical random walk…
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 prove that the law of a random walk $X_n$ is determined by the one-dimensional distributions of $\max(X_n, 0)$ for $n = 1, 2, \ldots$, as conjectured recently by Lo\"ic Chaumont and Ron Doney. Equivalently, the law of $X_n$ is determined…
Various real-life networks exhibit degree correlations and heterogeneous structure, with the latter being characterized by power-law degree distribution $P(k)\sim k^{-\gamma}$, where the degree exponent $\gamma$ describes the extent of…