Large Network Generator: a simple, efficient, and flexible graph formation algorithm
Journal of Physics: Complexity · 01.06.2026 · 7 (2) · 025011
DOI: 10.1088/2632-072x/ae6eab ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Physics: Complexity, online erschienen am 27.05.2026. Verfasst von João Pedro C Morais und 2 weiteren Autor:innen. Die Arbeit nennt 27 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Conselho Nacional de Desenvolvimento Científico e Tecnológico, Instituto Kunumi, Universidade Estadual de Campinas.
Abstract (Originalsprache)
This study introduces the Large Network Generator, an algorithm capable of creating undirected graphs with three main characteristics of real-world networks: long-tailed degree distribution, short distances between nodes (small-world phenomenon), and large clustering coefficients. The main idea is to add one node to the network at each step, perform random walks on the existing nodes, and select a subset of marked nodes to connect to the new node. Additionally, with an adjustable probability, edges may be created between the marked nodes themselves. Key advantages of our algorithm are its simplicity, efficiency, and flexibility in creating networks with different characteristics without using global information about network topology. The parameters can be adjusted to generate networks with specific characteristics, producing a wide range of values for each parameter, including high clustering (up to C ― ≈ 0.7 ), markedly short average distances (as low as L ― ≈ 2.8 for N = 200 000 ), and a strong presence of hubs. Additionally, the algorithm’s near-linear time complexity allows the creation of networks with one million nodes in less than 60 s. The implementation of our algorithm is publicly available on a GitHub repository.
Förderung
- Conselho Nacional de Desenvolvimento Científico e Tecnológico
- Instituto Kunumi
- Universidade Estadual de Campinas
- São Paulo Research Foundation
Zitieren
APA
Morais, J. P. C., Ribeiro, C. C., & Interian, R. (2026). Large Network Generator: a simple, efficient, and flexible graph formation algorithm. Journal of Physics: Complexity, 7(2), 025011. https://doi.org/10.1088/2632-072x/ae6eab
Vancouver
Morais JPC, Ribeiro CC, Interian R. Large Network Generator: a simple, efficient, and flexible graph formation algorithm. Journal of Physics: Complexity. 2026;7(2):025011. doi:10.1088/2632-072x/ae6eab
BibTeX
@article{Morais2026,
author = {Morais, João Pedro C and Ribeiro, Celso C and Interian, Ruben},
title = {Large Network Generator: a simple, efficient, and flexible graph formation algorithm},
journal = {Journal of Physics: Complexity},
year = {2026},
volume = {7},
number = {2},
pages = {025011},
doi = {10.1088/2632-072x/ae6eab}
}
EUVIMED