Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
IEEE Intelligent Systems
The link-prediction problem for social networks
Journal of the American Society for Information Science and Technology
Measurement and analysis of online social networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Grammar-based random walkers in semantic networks
Knowledge-Based Systems
Short communication: Knowledge management perspective on e-learning effectiveness
Knowledge-Based Systems
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
On the evolution of user interaction in Facebook
Proceedings of the 2nd ACM workshop on Online social networks
Finding reliable users and social networks in a social internetworking system
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
Data integration for the relational web
Proceedings of the VLDB Endowment
Approximating betweenness centrality
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
Schema clustering and retrieval for multi-domain pay-as-you-go data integration systems
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Grammar-based geodesics in semantic networks
Knowledge-Based Systems
K-path centrality: a new centrality measure in social networks
Proceedings of the 4th Workshop on Social Network Systems
Centrality measures based on current flow
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Enhancing community detection using a network weighting strategy
Information Sciences: an International Journal
An O(n2) algorithm for detecting communities of unbalanced sizes in large scale social networks
Knowledge-Based Systems
Identifying influential nodes in complex networks with community structure
Knowledge-Based Systems
Mixing local and global information for community detection in large networks
Journal of Computer and System Sciences
Hi-index | 0.00 |
The problem of assigning centrality values to nodes and edges in graphs has been widely investigated during last years. Recently, a novel measure of node centrality has been proposed, called @k-path centrality index, which is based on the propagation of messages inside a network along paths consisting of at most @k edges. On the other hand, the importance of computing the centrality of edges has been put into evidence since 1970s by Anthonisse and, subsequently by Girvan and Newman. In this work we propose the generalization of the concept of @k-path centrality by defining the @k-path edge centrality, a measure of centrality introduced to compute the importance of edges. We provide an efficient algorithm, running in O(@km), being m the number of edges in the graph. Thus, our technique is feasible for large scale network analysis. Finally, the performance of our algorithm is analyzed, discussing the results obtained against large online social network datasets.