Related papers: Random walk with priorities in communication-like …
We propose the Temporal Walk Centrality, which quantifies the importance of a node by measuring its ability to obtain and distribute information in a temporal network. In contrast to the widely-used betweenness centrality, we assume that…
In this paper, we explore different Markovian random walk strategies on networks with transition probabilities between nodes defined in terms of functions of the Laplacian matrix. We generalize random walk strategies with local information…
Consider the random set composed of particles initially distributed on Zd, d >= 2, according to a Poisson point process of intensity u > 0 and moving as independent simple symmetric random walks, the trap particles. We are interested in the…
We consider a continuous-time branching random walk on $\mathbb{Z}$ in a random non homogeneous environment. Particles can walk on the lattice points or disappear with random intensities. The process starts with one particle at initial time…
The presence of temporal correlations in random movement trajectories is a widespread phenomenon across biological, chemical and physical systems. The ubiquity of persistent and anti-persistent motion in many natural and synthetic systems…
We have numerically studied the trapping problem in a two-dimensional lattice where particles are continuously generated. We have introduced interaction between particles and directionality of their movement. This model presents a critical…
We investigate searching efficiency of different kinds of random walk on complex networks which rely on local information and one-step memory. For the studied navigation strategies we obtained theoretical and numerical values for the graph…
We study a system of random walks, known as the frog model, starting from a profile of independent Poisson($\lambda$) particles per site, with one additional active particle planted at some vertex $\mathbf{o}$ of a finite connected simple…
Random walks on networks are widely used to model stochastic processes such as search strategies, transportation problems or disease propagation. A prominent example of such process is the guiding of naive T cells by the lymph node conduits…
We propose two models of the evolution of a pair of competing populations. Both are lattice based. The first is a compromise between fully spatial models, which do not appear amenable to analytic results, and interacting particle system…
Analysis of social networks with limited data access is challenging for third parties. To address this challenge, a number of studies have developed algorithms that estimate properties of social networks via a simple random walk. However,…
Several interesting approaches have been reported in the literature on complex networks, random walks, and hierarchy of graphs. While many of these works perform random walks on stable, fixed networks, in the present work we address the…
We consider a class of multi-particle reinforced interacting random walks. In this model, there are some (finite or infinite) particles performing random walks on a given (finite or infinite) connected graph, so that each particle has…
Random walks are gaining much attention from the networks research community. They are the basis of many proposals aimed to solve a variety of network-related problems such as resource location, network construction, nodes sampling, etc.…
In network embedding, random walks play a fundamental role in preserving network structures. However, random walk based embedding methods have two limitations. First, random walk methods are fragile when the sampling frequency or the number…
We study the search kinetics of an immobile target by a concentration of randomly moving searchers. The object of the study is to optimize the probability of detection within the constraints of our model. The target is hidden on a…
The Abelian Sandpile Model is a discrete diffusion process defined on graphs (Dhar \cite{DD90}, Dhar et al. \cite{DD95}) which serves as the standard model of \textit{self-organized criticality}. The transience class of a sandpile is…
A bijection is given between fixed point free involutions of $\{1,2,...,2N\}$ with maximum decreasing subsequence size $2p$ and two classes of vicious (non-intersecting) random walker configurations confined to the half line lattice points…
Random walks process on networks plays a fundamental role in understanding the importance of nodes and the similarity of them, which has been widely applied in PageRank, information retrieval, and community detection, etc. Individual's…
We study a one-dimensional sluggish random walk with space-dependent transition probabilities between nearest-neighbour lattice sites. Motivated by trap models of slow dynamics, we consider a model in which the trap depth increases…