Centrality and mode detection in dynamic contact graphs; A Joint Diagonalisation approach

Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2013

Volumn , Issue , 2013, Pages 41-48

  Fay, Damien ^a   Kunegis, Jérôme ^b   Yoneki, Eiko ^c  

^a BOURNEMOUTH UNIVERSITY   (United Kingdom)

^b Centre for Web Studies University of Koblenz Landau ^*  (Germany)

^c UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; ROLLING RESISTANCE; SOCIAL NETWORKING (ONLINE);

CONTACT NETWORKS; DYNAMIC CONTACTS; DYNAMIC NETWORK; MODES OF OPERATION; PROPAGATION PATHS; REAL-WORLD NETWORKS; REPEATED APPLICATION; SYNTHETIC NETWORKS;

GRAPHIC METHODS;

EID: 84893305845     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2492517.2492540     Document Type: Conference Paper

References (22)

1. A. Bunse-Gerstner, R. Byers, and V. Mehrmann. Numerical methods for simultaneous diagonalization. SIAM Journal on Matrix Analysis and Applications, 14:927-949, 1993.
2. J.-F. Cardoso, J. fran Cois Cardoso, and A. Souloumiac. Jacobi angles for simultaneous diagonalization. SIAM J. Mat. Anal. Appl, 17:161-164, 1996.
3. J.-F. Cardoso and A. Souloumiac. Blind beam-forming for non gaussian signals. IEE Proceedings-F, 140:362-370, 1993.
4. N. Eagle and A. Pentland. Reality mining: sensing complex social systems. Personal and Ubiquitous Computing, V10(4):255-268, May 2006.
5. EU FP6 Haggle Project. http://www.haggleproject.org, 2010.
6. M. Freeman, N. Watkins, E. Yoneki, and J. Crowcroft. Rhythm and randomness in human contact. In Proc. International Conference on Advances in Social Networks Analysis and Mining, 2010.
7. P. Hui, J. Crowcroft, and E. Yoneki. Bubble rap: social-based forwarding in delay tolerant networks. In Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), pages 241-250. ACM, 2008.
8. T. G. Kolda and B. W. Bader. Tensor decompositions and applications. SIAM Review, 51(3):455-500, September 2009.
9. Y.-R. Lin, J. Sun, P. Castro, R. Konuru, H. Sundaram, and A. Kelliher. Metafac: community discovery via relational hypergraph factorization. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '09, pages 527-536, New York, NY, USA, 2009. ACM.
10. D. Macagnano and G. T. F. de Abreu:. Gershgorin analysis of random gramian matrices with application to mds tracking. IEEE Transactions on Signal Processing, accepted for publication; available on IEEE early access (15/02/2011).
11. G. J. McLaughlan. Finite Mixture Models. Wiley, 2000.
12. T. Opsahl, F. Agneessens, and J. Skvoretz. Node centrality in weighted networks: Generalizing degree and shortest paths. Social Networks, 32(3):245-251, 2010.
13. Prakash, H. Tong, N. Valler, M. Faloutsos, and C. Faloutsos. Virus Propagation on Time-Varying Networks: Theory and Immunization Algorithms. In J. Balcázar, F. Bonchi, A. Gionis, and M. Sebag, editors, Machine Learning and Knowledge Discovery in Databases, volume 6323 of Lecture Notes in Computer Science, chapter 7, pages 99-114. Springer Berlin Heidelberg, Berlin, Heidelberg, 2010.
14. I. Rhee, M. Shin, S. Hong, K. Lee, and S. Chong. On the levywalk nature of human mobility. In Journal of Selected Areas in Communications, volume 6(9), 2008.
15. C. Riolo, J. Koopman, and S. Chick. Methods and measures for the description of epidemiologic contact networks. Journal of Urban Health: Bulletin of the New York Academy of Medicine, 78:446-457(12), 1 September 2001.
16. C. Roth. Generalized preferential attachment: Towards realistic sociosemantic network models. In ISWC 4th Intl Semantic Web Conference, Workshop on Semantic Network Analysis, volume 171 of CEUR-WS Series (ISSN 1613-0073), pages 29-42, Galway, Ireland, November 2005.
17. S. Scellato, M. Musolesi, C. Mascolo, and V. Latora. On nonstationarity of human contact networks. In Proceedings of 2nd Annual Workshop on Simplifying Complex Networks for Practitioners (SIMPLEX 2010). Co-located with ICDCS 2010., June 2010.
18. J. Sun, D. Tao, and C. Faloutsos. Beyond streams and graphs: Dynamic tensor analysis. In Proc. Int. Conf. on Knowledge Discovery and Data Mining, pages 374-383, 2006.
19. W. Wang, S. Sanei, and J. Chambers. Penalty function-based joint diagonalization approach for convolutive blind separation of nonstationary sources. IEEE Transactions on Signal Processing, 53:1654-1669, May 2005.
20. M. Wax and J. Sheinvald. A least-squares approach to joint diagonalization. IEEE Signal Processing Letters, 4(2):52-53, 1997.
21. B. Waxman. Routing of multipoint connections. IEEE J. Select. Areas Commun., 6(9):1617-1622, 1988.
22. E. Yoneki. Visualizing communities and centralities from encounter traces. In ACM MobiCom Workshop on Challenged Networks (CHANTS), 2008.