相关论文: Node and layer eigenvector centralities for multip…

As the calculation of centrality in complex networks becomes increasingly vital across technological, biological, and social systems, precise and scalable ranking methods are essential for understanding these networks. This paper introduces…

This article investigates a family of centrality models for urban networks that incorporate both topological and non-topological factors. Since centrality is inherently recursive, these models can be formulated as fixed-point equations,…

Identifying central entities and interactions is a fundamental problem in network science. While well-studied for graphs (pairwise relations), many biological and social systems exhibit higher-order interactions best modeled by hypergraphs.…

Multiplex networks are generalized network structures that are able to describe networks in which the same set of nodes are connected by links that have different connotations. Multiplex networks are ubiquitous since they describe social,…

Matrix functions play an important role in applied mathematics. In network analysis, in particular, the exponential of the adjacency matrix associated with a network provides valuable information about connectivity, as well as about the…

The graph invariant examined in this paper is the largest eigenvalue of the adjacency matrix of a graph. Previous work demonstrates the tight relationship between this invariant, the birth and death rate of a contagion spreading on the…

Core-periphery detection is a key task in exploratory network analysis where one aims to find a core, a set of nodes well-connected internally and with the periphery, and a periphery, a set of nodes connected only (or mostly) with the core.…

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…

Typing Yesterday into the search-bar of your browser provides a long list of websites with, in top places, a link to a video by The Beatles. The order your browser shows its search results is a notable example of the use of network…

Classic measures of graph centrality capture distinct aspects of node importance, from the local (e.g., degree) to the global (e.g., closeness). Here we exploit the connection between diffusion and geometry to introduce a multiscale…

There are several applications that benefit from a definition of centrality which is applicable to sets of vertices, rather than individual vertices. However, existing definitions might not be able to help us in answering several network…

Many complex systems have natural representations as multi-layer networks. While these formulations retain more information than standard single-layer network models, there is not yet a fully developed theory for computing network metrics…

Centrality is an important notion in complex networks; it could be used to characterize how influential a node or an edge is in the network. It plays an important role in several other network analysis tools including community detection.…

Centrality measures for simple graphs/networks are well-defined and each has numerous main-memory algorithms. However, for modeling complex data sets with multiple types of entities and relationships, simple graphs are not ideal. Multilayer…

Betweenness centrality is a metric that seeks to quantify a sense of the importance of a vertex in a network graph in terms of its "control" on the distribution of information along geodesic paths throughout that network. This quantity…

Centrality is a key property of complex networks that influences the behavior of dynamical processes, like synchronization and epidemic spreading, and can bring important information about the organization of complex systems, like our brain…

We perform an extensive analysis of how sampling impacts the estimate of several relevant network measures. In particular, we focus on how a sampling strategy optimized to recover a particular spectral centrality measure impacts other…

Given a social network, which of its nodes are more central? This question has been asked many times in sociology, psychology and computer science, and a whole plethora of centrality measures (a.k.a. centrality indices, or rankings) were…

A new measure to assess the centrality of vertices in an undirected and connected graph is proposed. The proposed measure, L1 centrality, can adequately handle graphs with weights assigned to vertices and edges. The study provides tools for…

We formulate and propose an algorithm (MultiRank) for the ranking of nodes and layers in large multiplex networks. MultiRank takes into account the full multiplex network structure of the data and exploits the dual nature of the network in…