Centrality Measures of Dynamic Social Networks

2012 ◽  
Author(s):  
Allison Moore
2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Douglas Guilbeault ◽  
Damon Centola

AbstractThe standard measure of distance in social networks – average shortest path length – assumes a model of “simple” contagion, in which people only need exposure to influence from one peer to adopt the contagion. However, many social phenomena are “complex” contagions, for which people need exposure to multiple peers before they adopt. Here, we show that the classical measure of path length fails to define network connectedness and node centrality for complex contagions. Centrality measures and seeding strategies based on the classical definition of path length frequently misidentify the network features that are most effective for spreading complex contagions. To address these issues, we derive measures of complex path length and complex centrality, which significantly improve the capacity to identify the network structures and central individuals best suited for spreading complex contagions. We validate our theory using empirical data on the spread of a microfinance program in 43 rural Indian villages.


MethodsX ◽  
2020 ◽  
Vol 7 ◽  
pp. 101030
Author(s):  
Leonardo López ◽  
Maximiliano Fernández ◽  
Leonardo Giovanini

2020 ◽  
pp. 114536
Author(s):  
Weimin Li ◽  
Heng Zhu ◽  
Shaohua Li ◽  
Hao Wang ◽  
Hongning Dai ◽  
...  

2021 ◽  
Vol 15 (4) ◽  
pp. 1-22
Author(s):  
Huan Wang ◽  
Chunming Qiao ◽  
Xuan Guo ◽  
Lei Fang ◽  
Ying Sha ◽  
...  

Recently, dynamic social network research has attracted a great amount of attention, especially in the area of anomaly analysis that analyzes the anomalous change in the evolution of dynamic social networks. However, most of the current research focused on anomaly analysis of the macro representation of dynamic social networks and failed to analyze the nodes that have anomalous structural changes at a micro level. To identify and evaluate anomalous structural change-based nodes in generalized dynamic social networks that only have limited structural information, this research considers undirected and unweighted graphs and develops a multiple-neighbor superposition similarity method ( ), which mainly consists of a multiple-neighbor range algorithm ( ) and a superposition similarity fluctuation algorithm ( ). introduces observation nodes, characterizes the structural similarities of nodes within multiple-neighbor ranges, and proposes a new multiple-neighbor similarity index on the basis of extensional similarity indices. Subsequently, maximally reflects the structural change of each node, using a new superposition similarity fluctuation index from the perspective of diverse multiple-neighbor similarities. As a result, based on and , not only identifies anomalous structural change-based nodes by detecting the anomalous structural changes of nodes but also evaluates their anomalous degrees by quantifying these changes. Results obtained by comparing with state-of-the-art methods via extensive experiments show that can accurately identify anomalous structural change-based nodes and evaluate their anomalous degrees well.


Sign in / Sign up

Export Citation Format

Share Document