Uncovering the Useful Structures of Complex Networks in Socially-Rich and Dynamic Environments

被引:0
作者
Wu, Jie [1 ]
机构
[1] Temple Univ, Dept Comp & Informat Sci, Ctr Networked Comp, Philadelphia, PA 19122 USA
来源
2017 IEEE 37TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2017) | 2017年
关键词
Complex networks; distributed and localized solutions; dynamic systems; social networks; structural properties; AD HOC; ALGORITHMS;
D O I
10.1109/ICDCS.2017.129
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Many group activities can be represented as a complex network where entities (vertices) are connected in pairs by lines (edges). Uncovering a useful global structure of complex networks is important for understanding system behaviors and in providing global guidance 14 application designs. We briefly review existing network models, discuss several tools used in the traditional graph theory, distributed computing, distributed systems, and social network communities, and point out their limitations. We discuss opportunities to uncover the structural properties of complex networks, especially in a mobile environment, and we summarize three promising approaches for uncovering useful structures: trimming, layering, and remapping. Finally, we present some challenges in algorithmic techniques, with a focus on distributed and localized solutions, to represent various structures.
引用
收藏
页码:1787 / 1795
页数:9
相关论文
共 31 条
[1]  
[Anonymous], P ICDCS 2003 MAY
[2]  
Borgatti S. P., SOCIAL NETWORKS, V28, P466
[3]   A survey of mobility models for ad hoc network research [J].
Camp, T ;
Boleng, J ;
Davies, V .
WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2002, 2 (05) :483-502
[4]   Optimal Dynamic Distributed MIS [J].
Censor-Hillel, Keren ;
Haramaty, Elad ;
Karnin, Zohar .
PROCEEDINGS OF THE 2016 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC'16), 2016, :217-226
[5]   Time Complexity of Link Reversal Routing [J].
Charron-Bost, Bernadette ;
Fuegger, Matthias ;
Welch, Jennifer L. ;
Widder, Josef .
ACM TRANSACTIONS ON ALGORITHMS, 2015, 11 (03)
[6]   Information spreading in dynamic graphs [J].
Clementi, Andrea ;
Silvestri, Riccardo ;
Trevisan, Luca .
DISTRIBUTED COMPUTING, 2015, 28 (01) :55-73
[7]  
Conan V., 2008, IEEE J SELECTED AREA, V26
[8]   Building a reference combinatorial model for MANETs [J].
Ferreira, A .
IEEE NETWORK, 2004, 18 (05) :24-29
[9]   Hundreds of impossibility results for distributed computing [J].
Fich, F ;
Ruppert, E .
DISTRIBUTED COMPUTING, 2003, 16 (2-3) :121-163
[10]   DISTRIBUTED ALGORITHMS FOR GENERATING LOOP-FREE ROUTES IN NETWORKS WITH FREQUENTLY CHANGING TOPOLOGY [J].
GAFNI, EM ;
BERTSEKAS, DP .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1981, 29 (01) :11-18