A Novel Metric for Edge Centrality

As we are in the age of big data, graph data become bigger. A big graph normally has the overwhelming numbers of edges. Existing metrics of edge centrality are not suitable for dealing with such a large graph. A novel metric for measuring the importance of edges in a graph is presented. This metric not only captures the structural feature of a graph, but also has the good scalability. The extensive experiments have demonstrated the performance of the proposed metric by comparing it with several popular metrics against real-world graphs.

[1]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[2]  Ulrik Brandes,et al.  Correlations among centrality indices and a class of uniquely ranked graphs , 2017, Soc. Networks.

[3]  K. Goh,et al.  Betweenness centrality correlation in social networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Xiaodi Huang,et al.  UsageQoS: Estimating the QoS of Web Services through Online User Communities , 2013, TWEB.

[5]  Azer Bestavros,et al.  A Divide-and-Conquer Algorithm for Betweenness Centrality , 2014, SDM.

[6]  Phillip Bonacich,et al.  Some unique properties of eigenvector centrality , 2007, Soc. Networks.

[7]  Weidong Huang,et al.  GO: A cluster algorithm for graph visualization , 2015, J. Vis. Lang. Comput..

[8]  Andy M. Yip,et al.  The Generalized Topological Overlap Matrix for Detecting Modules in Gene Networks , 2006, BIOCOMP.

[9]  Massimo Marchiori,et al.  Method to find community structures based on information centrality. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Pasquale De Meo,et al.  A Novel Measure of Edge Centrality in Social Networks , 2012, Knowl. Based Syst..

[11]  Panos Kalnis,et al.  A Benchmark for Betweenness Centrality Approximation Algorithms on Large Graphs , 2017, SSDBM.

[12]  Xiaodi Huang,et al.  NGD: Filtering Graphs for Visual Analysis , 2018, IEEE Transactions on Big Data.

[13]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[14]  Adriana Iamnitchi,et al.  K-path centrality: a new centrality measure in social networks , 2011, SNS '11.

[15]  Timothy A. Davis,et al.  The university of Florida sparse matrix collection , 2011, TOMS.

[16]  Jimeng Sun,et al.  Centralities in Large Networks: Algorithms and Observations , 2011, SDM.