TY - JOUR
T1 - A general approach for modules identification in evolving networks
AU - Dinh, Thang N.
AU - Shin, Incheol
AU - Thai, Nhi K.
AU - Thai, My T.
AU - Znati, Taieb
N1 - Publisher Copyright:
© Springer Science+Business Media, LLC 2010.
PY - 2010
Y1 - 2010
N2 - Most complex networks exhibit a network modular property that is nodes within a network module are more densely connected among each other than with the rest of the network. Identifying network modules can help deeply understand the structures and functions of a network as well as design a robust system with minimum costs. Although there are several algorithms identifying the modules in literature, none can adaptively update modules in evolving networks without recomputing the modules from scratch. In this chapter, we introduce a general approach to efficiently detect and trace the evolution of modules in an evolving network. Our solution can identify the modules of each network snapshot based on the modules of previous snapshots, thus dynamically updating these modules. Moreover, we also provide a network compact representation which significantly reduces the size of the network, thereby minimizing the running time of any existing algorithm on the modules identification.
AB - Most complex networks exhibit a network modular property that is nodes within a network module are more densely connected among each other than with the rest of the network. Identifying network modules can help deeply understand the structures and functions of a network as well as design a robust system with minimum costs. Although there are several algorithms identifying the modules in literature, none can adaptively update modules in evolving networks without recomputing the modules from scratch. In this chapter, we introduce a general approach to efficiently detect and trace the evolution of modules in an evolving network. Our solution can identify the modules of each network snapshot based on the modules of previous snapshots, thus dynamically updating these modules. Moreover, we also provide a network compact representation which significantly reduces the size of the network, thereby minimizing the running time of any existing algorithm on the modules identification.
UR - http://www.scopus.com/inward/record.url?scp=84906730571&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84906730571&partnerID=8YFLogxK
U2 - 10.1007/978-1-4419-5689-7_4
DO - 10.1007/978-1-4419-5689-7_4
M3 - Article
AN - SCOPUS:84906730571
SN - 1931-6828
VL - 40
SP - 83
EP - 100
JO - Springer Optimization and Its Applications
JF - Springer Optimization and Its Applications
ER -