Stochastic blockmodels: First steps, Social Networks, vol.5, issue.2, pp.109-137, 1983. ,
DOI : 10.1016/0378-8733(83)90021-7
Stochastic blockmodels for directed graphs, Journal of the American Statistical Association, vol.82, issue.397, pp.8-19, 1987. ,
A tutorial on spectral clustering, Statistics and Computing, vol.17, issue.4, pp.395-416, 2007. ,
Inference and Phase Transitions in the Detection of Modules in Sparse Networks, Physical Review Letters, vol.107, issue.6, p.65701, 2011. ,
DOI : 10.1103/PhysRevLett.107.065701
Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications, Physical Review E, vol.84, issue.6, p.66106, 2011. ,
DOI : 10.1103/PhysRevE.84.066106
URL : https://hal.archives-ouvertes.fr/hal-00661643
Quiet Planting in the Locked Constraint Satisfaction Problems, SIAM Journal on Discrete Mathematics, vol.25, issue.2, pp.750-770, 2011. ,
DOI : 10.1137/090750755
A nonparametric view of network models and newmangirvan and other modularities, Proceedings of the National Academy of Sciences, pp.21068-21073, 2009. ,
A Spectral Approach to Analysing Belief Propagation for 3-Colouring, Combinatorics, Probability and Computing, vol.18, issue.06, pp.881-912, 2009. ,
DOI : 10.1007/s00493-006-0029-7
Graph Partitioning via Adaptive Spectral Techniques, Combinatorics, Probability and Computing, vol.51, issue.02, pp.227-284 ,
DOI : 10.1137/S0097539794270248
Spectral partitioning of random graphs, Proceedings 2001 IEEE International Conference on Cluster Computing, pp.529-537, 2001. ,
DOI : 10.1109/SFCS.2001.959929
Graph Spectra and the Detectability of Community Structure in Networks, Physical Review Letters, vol.108, issue.18, p.188701, 2012. ,
DOI : 10.1103/PhysRevLett.108.188701
Consistency of spectral partitioning of uniform hypergraphs under planted partition model ,
Learning with hypergraphs: Clustering, classification, and embedding, Advances in Neural Information Processing Systems 19, pp.1601-1608, 2007. ,
Beyond Pairwise Clustering, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05), pp.838-845, 2005. ,
DOI : 10.1109/CVPR.2005.89
Spectral redemption in clustering sparse networks, Proceedings of the National Academy of Sciences, pp.20935-20940, 2013. ,
DOI : 10.1073/pnas.1312486110
URL : https://hal.archives-ouvertes.fr/cea-01223434
Zeta functions of finite graphs and representations of p-adic groups automorphic forms and geometry of arithmetic varieties, pp.211-280, 1989. ,
Conditional Random Fields, Planted Constraint Satisfaction and Entropy Concentration, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp.332-346, 2013. ,
DOI : 10.1007/978-3-642-40328-6_24
Algorithmic Barriers from Phase Transitions, 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pp.793-802, 2008. ,
DOI : 10.1109/FOCS.2008.11
Hiding Quiet Solutions in Random Constraint Satisfaction Problems, Physical Review Letters, vol.102, issue.23, p.238701, 2009. ,
DOI : 10.1103/PhysRevLett.102.238701
Reweighted belief propagation and quiet planting for random k-sat, Journal on Satisfiability Boolean Modeling and Computation, vol.8, pp.149-171, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01087411
Subsampled power iteration: a new algorithm for block models and planted csp's. arXiv preprint, 2014. ,
Non-backtracking Spectrum of Random Graphs: Community Detection and Non-regular Ramanujan Graphs, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 2015. ,
DOI : 10.1109/FOCS.2015.86
URL : https://hal.archives-ouvertes.fr/hal-01226796
Information, Physics, and Computation, 2009. ,
DOI : 10.1093/acprof:oso/9780198570837.001.0001
Constraint satisfaction problems with isolated solutions are hard, Journal of Statistical Mechanics: Theory and Experiment, vol.2008, issue.12, p.12004, 2008. ,
DOI : 10.1088/1742-5468/2008/12/P12004