Modeling and measuring graph similarity: The case for centrality distance

Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

Volumn 2014-August, Issue August, 2014, Pages 47-52

  Roy, Matthieu ^a   Schmid, Stefan ^b   Tredan, Gilles ^a  

^a LAAS CNRS   (France)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Centrality; Complex networks; Dynamics; Graph similarity; Link prediction

Indexed keywords

DYNAMICS; MOBILE COMPUTING;

CENTRALITY; CLOSENESS CENTRALITIES; DYNAMIC SOCIAL NETWORKS; EVOLUTIONARY PATH; GRAPH SIMILARITY; LINK PREDICTION; SIMILARITY MEASURE; TOPOLOGICAL STRUCTURE;

COMPLEX NETWORKS;

EID: 84937720193     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2634274.2634277     Document Type: Conference Paper

References (20)

1. BARABÁSI, A.-L., AND ALBERT, R. Emergence of Scaling in Random Networks. Science 286 (1999).
2. BARABASI, A.-L., AND ALBERT, R. Emergence of scaling in random networks. Science 286 (1999).
3. BERRY, J. W., HENDRICKSON, B., LAVIOLETTE, R. A., AND PHILLIPS, C. A. Tolerating the community detection resolution limit with edge weighting. In arXiv (2009).
4. BOCCALETTI, S., LATORA, V., MORENO, Y., CHAVEZ, M., AND HWANG, D.-U. Complex networks: Structure and dynamics. Physics Reports 424, 4 U5(2006), 175-308.
5. BRANDES, U., AND ERLEBACH, T. Network Analysis: Methodological Foundations. LNCS 3418, Springer-Verlag New York, Inc., 2005.
6. CONTRACTOR, N. S., WASSERMAN, S., AND FAUST, K. Testing multitheoretical organizational networks: An analytic framework and empirical example. Academy of Management Review (2006).
7. ERDOS, P., AND RÉNYI, A. On the evolution of random graphs. In Math. Inst. Hungarian Academy of Sciences (1960), pp. 17-61.
8. GAO, X., XIAO, B., TAO, D., AND LI, X. A survey of graph edit distance. Pattern Anal. Appl. 13, 1(2010), 113-129.
9. KILLIJIAN, M.-O., ROY, M., TRÉDAN, G., AND ZANON, C. SOUK: Social Observation of hUman Kinetics. In Proc. ACM International Joint Conference on Pervasive and Ubiquitous Computing (UbiComp) (2013).
10. KOSSINETS, G., AND WATTS, D. J. Empirical analysis of an evolving social network. Science 311, 5757(2006), 88-90.
11. KUNEGIS, J. On the spectral evolution of large networks. PhD thesis (2011).
12. LIBEN-NOWELL, D., AND KLEINBERG, J. The link prediction problem for social networks. In Proc. 12th International Conference on Information and Knowledge Management (CIKM) (2003).
13. MILO, R., SHEN-ORR, S., ITZKOVITZ, S., KASHTAN, N., CHKLOVSKII, D., AND ALON, U. Network motifs: Simple building blocks of complex networks. In SCIENCE (2001).
14. NEWMAN, M. Clustering and preferential attachment in growing networks. Phys. Rev. E (2001).
15. OPSAHL, T., AND PANZARASA, P. Clustering in weighted networks. Social networks 31, 2(2009), 155-163.
16. PRZULJ, N. Biological network comparison using graphlet degree distribution. Bioinformatics (2007).
17. SCHREIBER, F., AND SCHWÖBBERMEYER, H. Frequency concepts and pattern detection for the analysis of motifs in networks. Transactions on Computational Systems Biology 3(2005), 89-104.
18. WATTS, D., AND STROGATZ, S. The small world problem. Collective Dynamics of Small-World Networks 393(1998), 440-442.
19. WERNICKE, S. Efficient detection of network motifs. IEEE/ACM Trans. Comput. Biol. Bioinformatics 3, 4(Oct. 2006), 347-359.
20. YANG, S. H., LONG, B., SMOLA, A., SADAGOPAN, N., ZHENG, Z., AND ZHA, H. Like like alike: joint friendship and interest propagation in social networks. In Proc. 20th International Conference on World Wide Web (WWW) (2011), pp. 537-546.