The number of large graphs with a positive density of triangles

Journal of Statistical Physics

Volumn 109, Issue 5-6, 2002, Pages 923-943

  Collet, P ^a   Eckmann, J P ^b  

^a CENTRE DE PHYSIQUE THÉORIQUE   (France)

^b UNIVERSITY OF GENEVA   (Switzerland)

Author keywords

Random graphs; Very large deviations; World wide web

Indexed keywords

EID: 0036387772     PISSN: 00224715     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1020489507547     Document Type: Article

References (6)

1. J.-P. Eckmann and E. Moses, Curvature of co-links uncovers hidden thematic layers in the World Wide Web, PNAS 99:5825-5829 (2002).
2. R. Albert and A.-L. Barabási, Statistical mechanics of complex networks, Rev. Mod. Phys. 47:47-97 (2002).
3. B. Bollobas, Random Graphs (Academic Press, New York, 1985).
4. H. Vu, On the concentration of multi-variate polynomials with small expectation, Random Structures and Algorithms 16:344-363 (2000).
5. S. Janson, T. Łuczak, and A. Ruciński, An exponential bound for the probability of nonexistence of a specified subgraph in a random graph, in Random Graphs 87, M. Karoński et al., eds. (Wiley, New York, 1990), pp. 73-87.
6. S. Janson, T. Łuczak, and A. Ruciński, Random Graphs (Wiley, New York, 2000).