Quantification and statistical analysis of topological features of recursive trees

Balázs Király, István Borsos and György Szabó

Physica A: Statistical Mechanics and its Applications, 2023, vol. 617, issue C

Abstract: Some topological features of recursive trees are quantified by exploiting the decomposition of directed graphs into a suitable combination of starlike hierarchical and three-edge cyclic components. This approach requires the adoption of the formalism of weighted directed graphs and allows us to quantify the proportion of hierarchical and hidden cyclic components. Using this concept, we can introduce new local parameters and global measures that quantify certain topological features of recursive trees. The average values of some of these measures over the general set of same-sized recursive trees are also determined.

Keywords: Recursive trees; Topological features of graphs; Matrix decomposition; Network analysis; Adjacency matrix; Game theory (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437123002273
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

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:phsmap:v:617:y:2023:i:c:s0378437123002273

DOI: 10.1016/j.physa.2023.128672

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().