Giant clusters in randomad hocnetworks

2002/11/30 by G. Nemeth, Gábor Németh, Gábor Vattay +1 · 1 citation
Computer Science · Mathematics · Physics and Astronomy · #Advanced Clustering Algorithms Research #Complex Network Analysis Techniques #Stochastic processes and statistical mechanics #cond-mat

paper · pdf · doi:10.1103/physreve.67.036110

6 pages, 5 figures; typos and corrections

arxiv created 2003/02/25 · openalex publication_date 2003/03/18 · arxiv updated 2009/11/30 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

Abstract

The present paper introduces ad hoc communication networks as examples of large scale real networks that can be prospected by statistical means. A description of giant cluster formation based on a single parameter of node neighbor numbers is given along with the discussion of some asymptotic aspects of giant cluster sizes.

Citations

• Emergence of Scaling in Random Networks
• The large-scale organization of metabolic networks
• Evolution of the social network of scientific collaborations
• On power-law relationships of the Internet topology
• On random graphs. I.

Cited by

• Enhancing robustness and immunization in geographical networks