. Au-passage, nous avons donc ?tabli deux points moins importants, mais n?cessaires ? notre d?monstration : -une nouvelle repr?sentation visuelle des s?quences de valeurs propres d'une matrice laplacienne d'un graphe, pour les comparer ? celles des bornes correspondantes de ses contreparties randomis?es. -notre m?thode densitaire de clustering ACL, ind?pendante des conditions initiales, ? la diff?rence des K-means et de leurs d?riv?es, ne semble pas pr?senter dans l'espace intrins?que les inconv?nients

J. Banerjee, On the spectrum of the normalized graph Laplacian, Linear Algebra and its. Applications, pp.3015-3022, 1973.

C. Bouveyron, G. Celeux, and S. Girard, Intrinsic dimension estimation by maximum likelihood in isotropic probabilistic PCA, Pattern Recognition Letters, vol.32, issue.14, 2007.
DOI : 10.1016/j.patrec.2011.07.017
URL : https://hal.archives-ouvertes.fr/hal-00440372

S. Brin and L. Page, The anatomy of a large-scale hypertextual Web search engine, Computer Networks and ISDN Systems, vol.30, issue.1-7, pp.107-117, 1998.
DOI : 10.1016/S0169-7552(98)00110-X

M. Cadot, A simulation technique for extracting robust association rules, p.CSDA, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00015030

M. Cadot, Extraire et valider les relations complexes en sciences humaines : statistiques, motifs et r?gles d'association, 2006.

R. B. Cattell, The Scree Test For The Number Of Factors, Multivariate Behavioral Research, vol.1, issue.2, pp.245-276, 1966.
DOI : 10.1207/s15327906mbr0102_10

J. Chen, O. R. Zaiane, and R. Goebel, Detecting Communities in Social Networks using Max-Min Modularity, SIAM International Conference on Data Mining (SDM'09), 2009.
DOI : 10.1137/1.9781611972795.84

F. R. Chung, Spectral Graph Theory, CBMS Regional Conference Series in Mathematics, 1997.
DOI : 10.1090/cbms/092

A. Clauset, M. E. Newman, C. Moore, G. Cobb, and Y. Chen, Finding community structure in very large networks An application of Markov chain Monte Carlo to community ecology, Physical Review E The American Mathematical Monthly, vol.70, pp.66111-264, 2003.

E. Connor and D. Simberloff, The Assembly of Species Communities: Chance or Competition?, Ecology, vol.60, issue.6, pp.1132-1140, 1979.
DOI : 10.2307/1936961

W. De-nooy, A. Mrvar, and V. Batagelj, Exploratory Social Network Analysis with Pajek, 2004.

J. Droesbeke, J. Finne, and R. Fisher, Inf?rence non-param?trique ? Les statistiques de rangs The use of multiple measurements in taxonomic problems, Annals of Eugenics, pp.179-188, 1936.

A. Gionis, H. Mannila, T. Mielik?inen, and P. Tsaparas, Assessing data mining results via swap randomization, ACM Trans. Knowl. Discov. Data, 2007.

M. Girvan and M. E. Newman, Community structure in social and biological networks, Proc. Natl. Acad. Sci. USA 99, pp.7821-7826, 2002.
DOI : 10.1073/pnas.122653799

. Greenacre, Correspondence Analysis In Practice (interdisciplinary Statistics) Chapman & Hall/crc Interdisciplinary Statistics Series, 2007.

V. Hernandez, J. E. Roman, and A. Tom?s, A robust and efficient parallel SVD solver based on restarted Lanczos bidiagonalization, Electronic Transactions on Numerical Analysis, vol.31, pp.68-85, 2008.

L. Hubert and P. Arabie, Comparing partitions, Journal of Classification, vol.78, issue.1, pp.193-218, 1985.
DOI : 10.1007/BF01908075

A. Lancichinetti and S. Fortunato, Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities, Physical Review E, vol.80, issue.1, p.16118, 2009.
DOI : 10.1103/PhysRevE.80.016118
URL : http://arxiv.org/abs/0904.3940

L. Lebart, A. Morineau, and K. Et-warwick, Multivariate Descriptive Statistical Analysis, 1984.

L. Lebart, Correspondence Analysis of Graph Structure -In, Comm. Meeting of the Psychometric Society , Bulletin Technique du CESIA, vol.2, pp.5-19, 1984.

A. Lelu and M. Cadot, Statistically valid links and anti-links between words and between documents: applying TourneBool randomization test to a Reuters collection Advances in Knowledge Discovery and Management (AKDM), pp.327-344, 2010.

A. Lelu, Slimming down a high-dimensional binary datatable: relevant eigen-subspace and substantial content, In COMPSTAT, p.2010, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00462464

A. Lelu and M. Cadot, Graphes des liens et anti-liens statistiquement valides entre les mots d'un corpus textuel, Extraction et gestion de connaissance, 2009.

A. Lelu, Clusters and factors: neural algorithms for a novel representation of huge and highly multidimensional data sets, New Approaches in Classification and Data Analysis, pp.241-248, 1994.
DOI : 10.1007/978-3-642-51175-2_27

B. Manly, Randomization, Bootstrap and Monte Carlo methods in Biology, 1997.

. Milo, . Shen-orr, . Itzkovitz, . Kashtan, and A. Chklovskii, Network Motifs: Simple Building Blocks of, Complex Networks, Science, vol.298, 2002.

M. Molloy and B. Reed, A critical point for random graphs with a given degree sequence. Random structures and Algorithms, pp.161-180, 1995.

H. Ryser, Recent Advances in Matrix Theory, 1964.

T. Snijders, Enumeration and simulation methods for 0???1 matrices with given marginals, Psychometrika, vol.73, issue.3, pp.397-417, 2004.
DOI : 10.1007/BF02294482

F. Viger and M. Latapy, Random generation of large connected simple graphs with prescribed degree distribution, LNCS, COCOON Computing and Combinatorics), issue.11, 2005.

V. Luxburg and L. , A tutorial on spectral clustering, Statistics and Computing, vol.21, issue.1, p.2007
DOI : 10.1007/s11222-007-9033-z