Related papers: Random Walks Performed by Topologically-Specific A…
During epidemics, the population is asked to Socially Distance, with pairs of individuals keeping two meters apart. We model this as a new optimization problem by considering a team of agents placed on the nodes of a network. Their common…
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…
Random walks over directed graphs are used to model activities in many domains, such as social networks, influence propagation, and Bayesian graphical models. They are often used to compute the importance or centrality of individual nodes…
Random intersection graphs have received much interest and been used in diverse applications. They are naturally induced in modeling secure sensor networks under random key predistribution schemes, as well as in modeling the topologies of…
In this paper we introduce the notion of Random Walk in Changing Environment - a random walk in which each step is performed in a different graph on the same set of vertices, or more generally, a weighted random walk on the same vertex and…
We obtain expected number of arrivals, absorption probabilities and expected time until absorption for an asymmetric discrete random walk on a graph in the presence of multiple function barriers. On each edge of the graph and in each vertex…
In many studies, it is common to use binary (i.e., unweighted) edges to examine networks of entities that are either adjacent or not adjacent. Researchers have generalized such binary networks to incorporate edge weights, which allow one to…
Several kinds of walks on complex networks are currently used to analyze search and navigation in different systems. Many analytical and computational results are known for random walks on such networks. Self-avoiding walks (SAWs) are…
We investigate crossing path probabilities for two agents that move randomly in a bounded region of the plane or on a sphere (denoted $R$). At each discrete time-step the agents move, independently, fixed distances $d_1$ and $d_2$ at angles…
Among the several topological properties of complex networks, the shortest path represents a particularly important characteristic because of its potential impact not only on other topological properties, but mainly for its influence on…
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…
The structure of real-world networks is usually difficult to characterize owing to the variation of topological scales, the nondyadic complex interactions, and the fluctuations in the network. We aim to address these problems by introducing…
In optimizing the topology of wireless networks built of a dynamic set of spatially embedded agents, there are many trade-offs to be dealt with. The network should preferably be as small (in the sense that the average, or maximal,…
The coupling of scale-free networks with mobile unstructured networks is certainly unusual. In mobile networks, connections active at a given instant are constrained by the geographical distribution of mobile nodes, and by the limited…
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. The rest of the nodes are hidden, and do not provide any…
In this work, we study the topological transition on the associated networks in a model proposed by Saeedian et al. (Scientific Reports 2019 9:9726), which considers a coupled dynamics of node and link states. Our goal was to better…
The dynamics of transportation through towns and cities is strongly affected by the topology of the connections and routes. The current work describes an approach combining complex networks and self-avoiding random walk dynamics in order to…
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…
We study an intermittent random walk on a random network of scale-free degree distribution. The walk is a combination of simple random walks of duration $t_w$ and random long-range jumps. While the time the walker needs to cover all the…
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…