Finding role communities in directed networks using Role-Based Similarity, Markov Stability and the Relaxed Minimum Spanning Tree

2013 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013 - Proceedings

Volumn , Issue , 2013, Pages 937-940

  Beguerisse Diaz, Mariano ^a   Vangelov, Borislav ^a   Barahona, Mauricio ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER NODES; DIRECTED NETWORK; GEOMETRIC STRUCTURE; MINIMUM SPANNING TREES; ON FLOW; ROLE-BASED; SIMILARITY MATRIX; SIMILARITY NETWORK;

DATA PROCESSING;

EID: 84897712496     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GlobalSIP.2013.6737046     Document Type: Conference Paper

References (15)

1. L. Katz, "A new status index derived from sociometric analysis," P.IYchometrika, vol. IS, pp. 39-43, 1953.
2. L. Page, S. Brin, R. Motwani, and T. Winograd, "The PageRank citation ranking: Bringing order to the web." Stanford InfoLab, Technical Report 1999-66, November 1999, previous number = SIDL-WP-1999-0120.
3. J. M. Kleinberg, "Authoritative sources in a hyperlinked environment," 1. ACM, vol. 46, no. 5, pp. 604-632, Sep. 1999.
4. K. Cooper and M. Barahona, "Role-based similarity in directed networks;' arXiv: 1 012. 2726, Dec. 2010.
5. K. Cooper, "Complex networks: Dynamics and similarity," PhD. dissertation, University of London, 2010.
6. M. A. Carreira-Perpifiiin and R. S. Zemel, "Proximity graphs for clustering and manifold learning," in Advances in Neural In/ormation Processing Systems 17, L. K. Saul, Y. Weiss, and L. Bottou, Eds. Cambridge, MA: MIT Press, 2005, pp. 225-232.
7. L. R. Varshney, B. L. Chen, E. Paniagua, D. H. Hall, and D. B. Chklovskii, "Structural properties of the caenorhabditis elegans neuronal network."PLoS CompUl Bioi, vol. 7, no. 2, p. e1001066, 201l.
8. S. Fortunato, "Community detection in graphs," Physics Reports, vol. 4S6, no. 3-5, pp. 75-174, 2010.
9. J.-c. Delvenne, S. Yaliraki, and M. Barahona, "Stability of graph communities across time scales," P Nat Acad Sci USA, vol. 107, no. 29, pp. 12 755-12760, 2010, also: arXiv:OSI2.ISll (200S).
10. J.-c. Delvenne, M. T. Schaub, S. N. Yaliraki, and M. Barahona, "The stability of a graph partition: A dynamics-based framework for community detection;' in Dynamics On and Of Complex Networks, Volume 2, A. Mukherjee, M. Choudhury, F. Peruani, N. Ganguly, and B. Mitra, Eds. Springer New York, 2013, pp. 221-242.
11. R. Lambiotte, J. Delvenne, and M. Barahona, "Laplacian dynamics and multiscale modular structure in networks;' arXiv:0812.1770, Dec. 200S.
12. V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre, "Fast unfolding of communities in large networks," J Stat Mech-Theory £, vol. 200S, no. 10, p. PIOOOS, 200S.
13. M. Meila, "Comparing clusterings-an information based distance;' J Multivariate Anal, vol. 9S, no. 5, pp. S73-S95, 2007.
14. T. Opsahl. (2011) Why anchorage is not (that) important: Binary ties and sample selection. [Online]. Available: http://wp.me/poFcY-V w
15. J. Kunegis, "KONECT-the Koblenz Network Collection;' 2012. [Online]. Available: http://konect.uni-koblenz.de