An evolving pseudofractal network model
Xing Li,
Qunqiang Feng,
Clearance Abel and
Ao Shen
Communications in Statistics - Theory and Methods, 2025, vol. 54, issue 1, 191-203
Abstract:
In this work, we consider a randomized version of the deterministic pseudofractal graph model, which was first proposed in the physical literature. Our model is a sequence of dynamic networks, in which the increment of network size at each time depends on the current size and a sequence of evolving parameters. We first show that the network size is closely related to a branching process in the varying environment. Under a mild assumption, we then prove that the asymptotic degree distribution in our model obeys the power law with an exponent three. Based on this asymptotic degree distribution, we show that the clustering coefficient of our network model converges to a given constant in probability.
Date: 2025
References: Add references at CitEc
Citations:
Downloads: (external link)
http://hdl.handle.net/10.1080/03610926.2024.2306524 (text/html)
Access to full text is restricted to subscribers.
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:taf:lstaxx:v:54:y:2025:i:1:p:191-203
Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/lsta20
DOI: 10.1080/03610926.2024.2306524
Access Statistics for this article
Communications in Statistics - Theory and Methods is currently edited by Debbie Iscoe
More articles in Communications in Statistics - Theory and Methods from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().