Related papers: Random walks on complex networks under node-depend…

In this paper we consider a stochastic process that may experience random reset events which bring suddenly the system to the starting value and analyze the relevant statistical magnitudes. We focus our attention on monotonous…

The measurement called accessibility has been proposed as a means to quantify the efficiency of the communication between nodes in complex networks. This article reports important results regarding the properties of the accessibility,…

Random walk is one of the basic mechanisms found in many network applications. We study the epidemic spreading dynamics driven by biased random walks on complex networks. In our epidemic model, each time infected nodes constantly spread…

Random walks can be used to search a complex networks for a desired resource. To reduce the number of hops necessary to find the resource, we propose a search mechanism based on building random walks connecting together partial walks that…

Random walk centrality is a fundamental metric in graph mining for quantifying node importance and influence, defined as the weighted average of hitting times to a node from all other nodes. Despite its ability to capture rich graph…

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…

The node2vec random walk is a non-Markovian random walk on the vertex set of a graph, widely used for network embedding and exploration. This random walk model is defined in terms of three parameters which control the probability of,…

Over the last few years, network science has proved to be useful in modeling a variety of complex systems, composed of a large number of interconnected units. The intricate pattern of interactions often allows the system to achieve complex…

Random walks on graphs are an essential primitive for many randomised algorithms and stochastic processes. It is natural to ask how much can be gained by running $k$ multiple random walks independently and in parallel. Although the cover…

Random walks with stochastic resetting provides a treatable framework to study interesting features about central-place motion. In this work, we introduce non-instantaneous resetting as a two-state model being a combination of an exploring…

We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…

In this paper, we propose a simple randomized protocol for identifying trusted nodes based on personalized trust in large scale distributed networks. The problem of identifying trusted nodes, based on personalized trust, in a large network…

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…

Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we focus on the problem of sampling random walks efficiently in a…

The first passage time (FPT) for random walks is a key indicator of how fast information diffuses in a given system. Despite the role of FPT as a fundamental feature in transport phenomena, its behavior, particularly in heterogeneous…

This work deals with the stationary analysis of two-dimensional partially homogeneous nearest-neighbour random walks. Such type of random walks in the quarter plane are characterized by the fact that the one-step transition probabilities…

In this work we investigate time varying networks with complex dynamics at the nodes. We consider two scenarios of network change in an interval of time: first, we have the case where each link can change with probability pt, i.e. the…

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…

The recently proposed stochastic residual networks selectively activate or bypass the layers during training, based on independent stochastic choices, each of which following a probability distribution that is fixed in advance. In this…

We consider a one-dimensional simple random walk killed by quenched soft obstacles. The position of the obstacles is drawn according to a renewal process with a power-law increment distribution. In a previous work, we computed the…