Robustness analysis of network modularity

Cited 2 time in webofscience Cited 0 time in scopus
  • Hit : 208
  • Download : 0
Modules are commonly observed functional units in large-scale networks and the dynamics of networks are closely related to the organization of such modules. Modularity analysis has been widely used to investigate the organizing principle of complex networks. The information about network topology needed for such modularity analysis is, however, not complete in many real world networks. We noted that network structure is often reconstructed based on partial observation and therefore it is re-organized as more information is collected. Hence, it is critical to evaluate the robustness of network modules with respect to uncertainties. For this purpose, we have developed a robustness bounds algorithm that provides an estimation of the unknown minimal perturbation, which breaks down the original modularity. The proposed algorithm is computationally efficient and provides valuable information about the robustness of modularity for large-scale network analysis.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2016-12
Language
English
Article Type
Article
Citation

IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS, v.3, no.4, pp.348 - 357

ISSN
2325-5870
DOI
10.1109/TCNS.2015.2476197
URI
http://hdl.handle.net/10203/218308
Appears in Collection
BiS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 2 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0