Manageable to unmanageable transition in a fractal model of project networks

Alexei Vazquez

Chaos, Solitons & Fractals, 2024, vol. 180, issue C

Abstract: Project networks are characterized by power law degree distributions, a property that is known to promote spreading. In contrast, the longest path length of project networks scales algebraically with the network size, which improves the impact of random interventions. Using the duplication-split model of project networks, I provide convincing evidence that project networks are fractal networks. The average distance between nodes scales as 〈d〉∼Nβ with 0<β<1. The average number of nodes 〈N〉d within a distance d scales as 〈N〉d∼dDf, with a fractal dimension Df=1/β>1. Furthermore, I demonstrate that the duplication-split networks are fragile for duplication rates qqc, in spite the mean out-degree diverges with increasing the network size. I conclude the project networks generated by the duplication-split model are manageable for qKeywords: Project networks; Duplication-split model; Fractal growth; Percolation; Risk propagation (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077924000791
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:180:y:2024:i:c:s0960077924000791

DOI: 10.1016/j.chaos.2024.114528

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().