Related papers: Inward and Outward Node Accessibility in Complex N…

We consider information diffusion on Web-like networks and how random walks can simulate it. A well-studied problem in this domain is Partial Cover Time, i.e., the calculation of the expected number of steps a random walker needs to visit a…

Centrality, which quantifies the "importance" of individual nodes, is among the most essential concepts in modern network theory. As there are many ways in which a node can be important, many different centrality measures are in use. Here,…

Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interactions among existing members are likely to occur in the near…

We carry out a comparative study on the problem for a walker searching on several typical complex networks. The search efficiency is evaluated for various strategies. Having no knowledge of the global properties of the underlying networks…

We propose local-biased random walks on general networks where a Markovian walker can choose between different types of biases in each node to define transitions to its neighbors depending on their degrees. For this ergodic dynamics, we…

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…

Motivated by the growing number of mobile devices capable of connecting and exchanging messages, we propose a methodology aiming to model and analyze node mobility in networks. We note that many existing solutions in the literature rely on…

Traditional measures of closeness and betweenness centrality in networks rely on the shortest paths between nodes. Many standard metrics fail to accurately reflect the physical or probabilistic characteristics of nodal centrality and…

Network models have been widely used to study diverse systems and analyze their dynamic behaviors. Given the structural variability of networks, an intriguing question arises: Can we infer the type of system represented by a network based…

Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the recent research on dynamic networks has only addressed the…

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…

In this paper we investigate the reachability and observability properties of a network system, running a Laplacian based average consensus algorithm, when the communication graph is a path or a cycle. More in detail, we provide necessary…

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…

Network properties govern the rate and extent of spreading processes on networks, from simple contagions to complex cascades. Recent advances have extended the study of spreading processes from static networks to temporal networks, where…

Random Walk is a basic algorithm to explore the structure of networks, which can be used in many tasks, such as local community detection and network embedding. Existing random walk methods are based on single networks that contain limited…

We propose high-order hypergraph walks as a framework to generalize graph-based network science techniques to hypergraphs. Edge incidence in hypergraphs is quantitative, yielding hypergraph walks with both length and width. Graph methods…

We investigate the dynamics of random walks on weighted networks. Assuming that the edge's weight and the node's strength are used as local information by a random walker, we study two kinds of walks, weight-dependent walk and…

Real-world complex systems exhibit multiple levels of relationships. In many cases they require to be modeled as interconnected multilayer networks, characterizing interactions of several types simultaneously. It is of crucial importance in…

Backward reachability (also termed controllability) has been extensively studied in control theory, and tools for a wide class of systems have been developed. Nevertheless, assessing a backward reachability analysis or synthesis remains…

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…