Related papers: Random walk centrality for temporal networks
Predicting links in complex networks has been one of the essential topics within the realm of data mining and science discovery over the past few years. This problem remains an attempt to identify future, deleted, and redundant links using…
Over the last two decades, network theory has shown to be a fruitful paradigm in understanding the organization and functioning of real-world complex systems. One technique helpful to this endeavor is identifying functionally influential…
Stimulated by the growing interest in the applications of complex networks framework on time series analysis, we devise a network model in which each of $N$ nodes is associated with a random walk of length $L$. Connectivity between any two…
Because diffusion typically involves symmetric interactions, scant attention has been focused on studying asymmetric cases. However, important networked systems underlain by diffusion (e.g. cortical networks and WWW) are inherently…
A heterogeneous continuous time random walk is an analytical formalism for studying and modeling diffusion processes in heterogeneous structures on microscopic and macroscopic scales. In this paper we study both analytically and numerically…
Hypergraph has been selected as a powerful candidate for characterizing higher-order networks and has received increasing attention in recent years. In this article, we study random walks with resetting on hypergraph by utilizing spectral…
We obtain Central Limit Theorems in Functional form for a class of time-inhomogeneous interacting random walks on the simplex of probability measures over a finite set. Due to a reinforcement mechanism, the increments of the walks are…
Networks evolve continuously over time with the addition, deletion, and changing of links and nodes. Such temporal networks (or edge streams) consist of a sequence of timestamped edges and are seemingly ubiquitous. Despite the importance of…
Despite the traditional focus of network science on static networks, most networked systems of scientific interest are characterized by temporal links. By disrupting the paths, link temporality has been shown to frustrate many dynamical…
Random walks have been proven to be useful for constructing various algorithms to gain information on networks. Algorithm node2vec employs biased random walks to realize embeddings of nodes into low-dimensional spaces, which can then be…
We propose a procedure to generate dynamical networks with bursty, possibly repetitive and correlated temporal behaviors. Regarding any weighted directed graph as being composed of the accumulation of paths between its nodes, our…
Temporal networks are such networks where nodes and interactions may appear and disappear at various time scales. With the evidence of ubiquity of temporal networks in our economy, nature and society, it's urgent and significant to focus on…
Many complex networks are described by directed links; in such networks, a link represents, for example, the control of one node over the other node or unidirectional information flows. Some centrality measures are used to determine the…
Novelty attracts attention like popularity. Hence predicting novelty is as important as popularity. Novelty is the side effect of competition and aging in evolving systems. Recent behavior or recent link gain in networks plays an important…
In this thesis we contribute to the understanding of the pivotal role of the temporal dimension in networked social systems, previously neglected and now uncovered by the data revolution recently blossomed in this field. To this aim, we…
We introduce a set of techniques that allow for efficiently generating many independent random walks in the Massive Parallel Computation (MPC) model with space per machine strongly sublinear in the number of vertices. In this…
Nodes movements play a significant role in disseminating messages in the sparse mobile ad-hoc network. In the network scenarios, where traditional end-to-end paths do not exist, mobility creates opportunities for nodes to connect and…
We study discrete-time random walks on arbitrary networks with first-passage resetting processes. To the end, a set of nodes are chosen as observable nodes, and the walker is reset instantaneously to a given resetting node whenever it hits…
We show that prominent centrality measures in network analysis are all based on additively separable and linear treatments of statistics that capture a node's position in the network. This enables us to provide a taxonomy of centrality…
We study an exactly solvable random walk model with long-range memory on arbitrary networks. The walker performs unbiased random steps to nearest-neighbor nodes and intermittently resets to previously visited nodes in a preferential way,…