Fast Counting of Triangles in Large Real Networks without Counting: Algorithms and Laws, 2008 Eighth IEEE International Conference on Data Mining, pp.608-617, 2008. ,
DOI : 10.1109/ICDM.2008.72
A decentralized algorithm for spectral analysis, STOC, pp.561-568, 2004. ,
Networks, crowds, and markets: Reasoning about a highly connected world, 2010. ,
DOI : 10.1017/CBO9780511761942
Eigenspokes: Surprising patterns and scalable community chipping in large graphs, PAKDD, pp.435-448, 2010. ,
A tutorial on spectral clustering, Statistics and Computing, vol.21, issue.1, pp.395-416, 2007. ,
DOI : 10.1007/s11222-007-9033-z
Normalized cuts and image segmentation, IEEE Trans. Pattern Anal. Mach. Intell, vol.22, issue.8, pp.888-905, 2000. ,
Non-backtracking Spectrum of Random Graphs: Community Detection and Non-regular Ramanujan Graphs, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pp.1347-1357, 2015. ,
DOI : 10.1109/FOCS.2015.86
URL : https://hal.archives-ouvertes.fr/hal-01226796
Hearing the clusters of a graph: A distributed algorithm, Automatica, vol.48, issue.1, pp.15-24, 2012. ,
DOI : 10.1016/j.automatica.2011.09.019
Decentralized estimation of Laplacian eigenvalues in multi-agent systems, Automatica, vol.49, issue.4, pp.1031-1036, 2013. ,
DOI : 10.1016/j.automatica.2013.01.029
URL : https://hal.archives-ouvertes.fr/hal-01479646
Asynchronous Gossip for Averaging and Spectral Ranking, IEEE Journal of Selected Topics in Signal Processing, vol.8, issue.4, pp.703-716, 2014. ,
DOI : 10.1109/JSTSP.2014.2320229
Ordinary Differential Equations, 1985. ,
Quantum Walks for Computer Scientists, Synthesis Lectures on Quantum Computing, vol.1, issue.1, pp.1-119, 2008. ,
DOI : 10.2200/S00144ED1V01Y200808QMC001
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, SIAM Journal on Computing, vol.26, issue.5, pp.1484-1509, 1997. ,
DOI : 10.1137/S0097539795293172
Eigenvalues of graphs, 2007. ,
SNAP Datasets: Stanford large network dataset collection, 2014. ,