Map equation centrality: community-aware centrality based on the map equation

  title={Map equation centrality: community-aware centrality based on the map equation},
  author={Christopher Bl{\"o}cker and Juan Carlos Nieves and Martin Rosvall},
  journal={Applied Network Science},
To measure node importance, network scientists employ centrality scores that typically take a microscopic or macroscopic perspective, relying on node features or global network structure. However, traditional centrality measures such as degree centrality, betweenness centrality, or PageRank neglect the community structure found in real-world networks. To study node importance based on network flows from a mesoscopic perspective, we analytically derive a community-aware information-theoretic… 

Ranking influential nodes in complex networks with community structure

Experimental results indicate the superiority of the proposed ranking strategy over all its counterparts agnostic about the community structure, and results show that it performs better in networks with a strong community structure and a high number of communities of heterogeneous sizes.

Exploring influential nodes using global and local information

An accurate and efficient algorithm for critical node mining using both global and local information (GLI) to solve the shortcoming of the existing key node identification methods that consider either local or global information.

An influential node identification method considering multi-attribute decision fusion and dependency

This work considers a nonlinear load-capacity cascading failure model on interdependent networks, where the initial load distribution is not random, as usually assumed, but determined by the influence of each node in the interdependent network.

Functional network organization of the mouse cortex determined by wide-field fluorescence imaging shares some —but not all— properties revealed with simultaneous fMRI-BOLD

The hypothesis that functional networks of the mouse brain are organized in an overlapping manner for both BOLD and Ca 2+ data is tested and it is demonstrated that BOLD large-scale networks can be detected via Ca 2- signals.

Urban Agglomeration High-Speed Railway Backbone Network Planning: A Case Study of Beijing-Tianjin-Hebei Region, China

In order to optimize the network layout of urban agglomerations, improve the comprehensive benefits of transportation networks and promote the sustainable development of urban agglomerations, this

Measuring Node Contribution to Community Structure With Modularity Vitality

It is demonstrated that modularity vitality provides a new approach to community-deception, as it consistently outperforms existing community-aware centrality measures and is well-grounded in both centrality and community detection theory.

Analyzing Community-aware Centrality Measures Using The Linear Threshold Model

This work investigates the consistency of previous analyses using the popular Linear Threshold propagation model, which characterizes many spreading processes in real life, and shows that Community-based Mediator, Comm Centrality, and Modularity Vitality outperform the other measures.

Comparing Community-Aware Centrality Measures in Online Social Networks

Results show that K-shell with Community and Community-based Centrality measures are the most accurate in identifying influential nodes under a single-spreader problem and the epidemic transmission rate doesn’t significantly affect the behavior of the community-aware centrality measures.

Identifying influential nodes using overlapping modularity vitality

The "Overlapping Modularity Vitality" centrality measure is proposed and investigated and shows that selecting the nodes with the top positive or the top absolute centrality values is more effective than choosing the ones with the maximum negative values to spread the epidemic.

A Community-Based Approach to Identifying Influential Spreaders

This paper introduces a new centrality index to identify influential spreaders in a network based on the community structure of the network, and finds that CbC can help to identify some critical influential nodes that other indices cannot find.

Maps of random walks on complex networks reveal community structure

An information theoretic approach is introduced that reveals community structure in weighted and directed networks of large-scale biological and social systems and reveals a directional pattern of citation from the applied fields to the basic sciences.

Directed network modules

It is found that directed modules of real-world graphs inherently overlap and the investigated networks can be classified into two major groups in terms of the overlaps between the modules.

Finding and evaluating community structure in networks.

  • M. NewmanM. Girvan
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
It is demonstrated that the algorithms proposed are highly effective at discovering community structure in both computer-generated and real-world network data, and can be used to shed light on the sometimes dauntingly complex structure of networked systems.

Exploring Network Structure, Dynamics, and Function using NetworkX

Some of the recent work studying synchronization of coupled oscillators is discussed to demonstrate how NetworkX enables research in the field of computational networks.

On community structure in complex networks: challenges and opportunities

This work focuses on generative models of communities in complex networks and their role in developing strong foundation for community detection algorithms, and introduces deterministic strategies that have proven to be very efficient in controlling the epidemic outbreaks, but require complete knowledge of the network.