Related papers: Betweenness centrality for temporal multiplexes

The structure entropy is one of the most important parameters to describe the structure property of the complex networks. Most of the existing struc- ture entropies are based on the degree or the betweenness centrality. In order to describe…

Temporal Graph Neural Networks, a new and trending area of machine learning, suffers from a lack of formal analysis. In this paper, information theory is used as the primary tool to provide a framework for the analysis of temporal GNNs. For…

Much of the past work in network analysis has focused on analyzing discrete graphs, where binary edges represent the "presence" or "absence" of a relationship. Since traditional network measures (e.g., betweenness centrality) utilize a…

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…

Data classification is a major machine learning paradigm, which has been widely applied to solve a large number of real-world problems. Traditional data classification techniques consider only physical features (e.g., distance, similarity,…

The increasing urbanization process we have been witnessing in the last decades is accompanied by a significant increase in traffic congestion in cities around the world. The effect of the congestion is represented in the enormous time…

Centrality measures quantify the importance of a node in a network based on different geometric or diffusive properties, and focus on different scales. Here, we adopt a geometrical viewpoint to define a multi-scale centrality in networks.…

We propose a method to reconstruct and analyze a complex network from data generated by a spatio-temporal dynamical system, relying on the nonlinear mutual information of time series analysis and betweenness centrality of complex network…

Complex networks are made up of vertices and edges. The edges, which may be directed or undirected, are equipped with positive weights. Modeling complex systems that consist of different types of objects leads to multilayer networks, in…

The analysis of complex and time-evolving interactions like social dynamics represents a current challenge for the science of complex systems. Temporal networks stand as a suitable tool to schematise such systems, encoding all the appearing…

Centrality describes the importance of nodes in a graph and is modeled by various measures. Its global analogue, called centralization, is a general formula for calculating a graph-level centrality score based on the node-level centrality…

Eigenvector centrality is a common measure of the importance of nodes in a network. Here we show that under common conditions the eigenvector centrality displays a localization transition that causes most of the weight of the centrality to…

This paper is concerned with distributed computation of several commonly used centrality measures in complex networks. In particular, we propose deterministic algorithms, which converge in finite time, for the distributed computation of the…

In a temporal network, the presence and activity of nodes and links can change through time. To describe temporal networks we introduce the notion of temporal quantities. We define the addition and multiplication of temporal quantities in a…

We introduce a quantitative method to compare arbitrary pairs of graph centrality measures, based on the ordering of vertices induced by them. The proposed method is conceptually simple, mathematically elegant, and allows for a quantitative…

Network embedding techniques are powerful to capture structural regularities in networks and to identify similarities between their local fabrics. However, conventional network embedding models are developed for static structures, commonly…

Several studies demonstrate that there are critical differences between real wireless networks and simulation models. This finding has permitted to extract spatial and temporal properties for links and to provide efficient methods as biased…

The determination of node centrality is a fundamental topic in social network studies. As an addition to established metrics, which identify central nodes based on their brokerage power, the number and weight of their connections, and the…

Pairwise network comparison is essential for various applications, including neuroscience, disease research, and dynamic network analysis. While existing literature primarily focuses on comparing entire network structures, we address a…

We develop a framework to track the structure of temporal networks with a signal processing approach. The method is based on the duality between networks and signals using a multidimensional scaling technique. This enables a study of the…