NDLI: Fast Computing Betweenness Centrality with Virtual Nodes on Large Sparse Networks

Content Provider	PubMed Central
Author	Yang, Jing Chen, Yingwu
Editor	Tomassini, Marco
Copyright Year	2011
Abstract	Betweenness centrality is an essential index for analysis of complex networks. However, the calculation of betweenness centrality is quite time-consuming and the fastest known algorithm uses time and space for weighted networks, where and are the number of nodes and edges in the network, respectively. By inserting virtual nodes into the weighted edges and transforming the shortest path problem into a breadth-first search (BFS) problem, we propose an algorithm that can compute the betweenness centrality in time for integer-weighted networks, where is the average weight of edges and is the average degree in the network. Considerable time can be saved with the proposed algorithm when , indicating that it is suitable for lightly weighted large sparse networks. A similar concept of virtual node transformation can be used to calculate other shortest path based indices such as closeness centrality, graph centrality, stress centrality, and so on. Numerical simulations on various randomly generated networks reveal that it is feasible to use the proposed algorithm in large network analysis.
Related Links	http://dx.doi.org/10.1371/journal.pone.0022557
Starting Page	22557
File Format	PDF
ISSN	19326203
e-ISSN	19326203
Journal	PLoS ONE
Issue Number	7
Volume Number	6
Language	English
Publisher	Public Library of Science
Publisher Date	2011-07-01
Access Restriction	Open
Rights Holder	Public Library of Science
Subject Keyword	Biochemistry, Genetics and Molecular Biology(all) Agricultural and Biological Sciences(all) Medicine(all) Research in Higher Education
Content Type	Text
Resource Type	Article
Subject	Multidisciplinary

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Percolation Centrality: Quantifying Graph-Theoretic Impact of Nodes during Percolation in Networks

Identifying Influential Nodes in Large-Scale Directed Networks: The Role of Clustering

Attack Robustness and Centrality of Complex Networks

Control Centrality and Hierarchical Structure in Complex Networks

Structural Controllability and Controlling Centrality of Temporal Networks

A Framework of Algorithms: Computing the Bias and Prestige of Nodes in Trust Networks

A New Measure of Centrality for Brain Networks

Correction: A Framework of Algorithms: Computing the Bias and Prestige of Nodes in Trust Networks

Host Centrality in Food Web Networks Determines Parasite Diversity

Fast Computing Betweenness Centrality with Virtual Nodes on Large Sparse Networks

Similar Documents

Percolation Centrality: Quantifying Graph-Theoretic Impact of Nodes during Percolation in Networks

Identifying Influential Nodes in Large-Scale Directed Networks: The Role of Clustering

Attack Robustness and Centrality of Complex Networks

Control Centrality and Hierarchical Structure in Complex Networks

Structural Controllability and Controlling Centrality of Temporal Networks

A Framework of Algorithms: Computing the Bias and Prestige of Nodes in Trust Networks

A New Measure of Centrality for Brain Networks

Correction: A Framework of Algorithms: Computing the Bias and Prestige of Nodes in Trust Networks

Host Centrality in Food Web Networks Determines Parasite Diversity

Fast Computing Betweenness Centrality with Virtual Nodes on Large Sparse Networks