Spanning trees of recursive scale-free graphs

被引：1

作者：

Diggans, C. Tyler ^{[1
,2
,3
]}

Bollt, Erik M. ^{[1
,4
]}

ben-Avraham, Daniel ^{[1
,2
]}

机构：

[1] Clarkson Univ, Clarkson Ctr Complex Syst Sci, Potsdam, NY 13699 USA

[2] Clarkson Univ, Dept Phys, Potsdam, NY 13699 USA

[3] Air Force Res Lab, Informat Directorate, Rome, NY 13441 USA

[4] Clarkson Univ, Dept Elect & Comp Engn, Potsdam, NY 13699 USA

来源：

PHYSICAL REVIEW E | 2022年 / 105卷 / 02期

关键词：

MINIMUM NUMBER; MODELS;

D O I：

10.1103/PhysRevE.105.024312

中图分类号：

O35 [流体力学]; O53 [等离子体物理学];

学科分类号：

070204 ; 080103 ; 080704 ;

摘要：

We present a link-by-link rule-based method for constructing all members of the ensemble of spanning trees for any recursively generated, finitely articulated graph, such as the Dorogovtsev-Goltsev-Mendes (DGM) net. The recursions allow for many large-scale properties of the ensemble of spanning trees to be analytically solved exactly. We show how a judicious application of the prescribed growth rules selects for certain subsets of the spanning trees with particular desired properties (small world, extended diameter, degree distribution, etc.), and thus approximates and/or provides solutions to several optimization problems on undirected and unweighted networks. The analysis of spanning trees enhances the usefulness of recursive graphs as sophisticated models for everyday life complex networks.

引用

页数：6

共 50 条

[21] Degree correlation in scale-free graphs
Babak Fotouhi
Michael G. Rabbat
[J]. The European Physical Journal B, 2013, 86
[22] Scalable generation of scale-free graphs
Sanders, Peter
Schulz, Christian
[J]. INFORMATION PROCESSING LETTERS, 2016, 116 (07) : 489 - 491
[23] PageRank in Scale-Free Random Graphs
Chen, Ningyuan
Litvak, Nelly
Olvera-Cravioto, Mariana
[J]. ALGORITHMS AND MODELS FOR THE WEB GRAPH (WAW 2014), 2014, 8882 : 120 - 131
[24] Scale-Free Graphs of Increasing Degree
Cooper, Colin
Pralat, Pawel
[J]. RANDOM STRUCTURES & ALGORITHMS, 2011, 38 (04) : 396 - 421
[25] Efficiency-Controllable Random Walks on a Class of Recursive Scale-Free Trees with a Deep Trap
李玲
关佶红
周水庚
[J]. Chinese Physics Letters, 2015, (03) : 17 - 20
[26] Efficiency-Controllable Random Walks on a Class of Recursive Scale-Free Trees with a Deep Trap
Li Ling
Guan Ji-Hong
Zhou Shui-Geng
[J]. CHINESE PHYSICS LETTERS, 2015, 32 (03)
[27] A recursive method for calculating the total number of spanning trees and its applications in self-similar small-world scale-free network models
Ma, Fei
Su, Jing
Yao, Bing
[J]. EUROPEAN PHYSICAL JOURNAL B, 2018, 91 (05):
[28] A recursive method for calculating the total number of spanning trees and its applications in self-similar small-world scale-free network models
Fei Ma
Jing Su
Bing Yao
[J]. The European Physical Journal B, 2018, 91
[29] Efficiency-Controllable Random Walks on a Class of Recursive Scale-Free Trees with a Deep Trap
李玲
关佶红
周水庚
[J]. Chinese Physics Letters., 2015, 32 (03) - 20
[30] Underlying scale-free trees in complex networks
Kim, DH
Son, SW
Ahn, YY
Kim, PJ
Eom, YH
Jeong, H
[J]. PROGRESS OF THEORETICAL PHYSICS SUPPLEMENT, 2005, (157): : 213 - 220

← 1 2 3 4 5 →