ASYMPTOTIC FORMULA on AVERAGE PATH LENGTH of A SPECIAL NETWORK BASED on SIERPINSKI CARPET

Yumei Xue; Dongxue Zhou

doi:10.1142/S0218348X18500391

ASYMPTOTIC FORMULA on AVERAGE PATH LENGTH of A SPECIAL NETWORK BASED on SIERPINSKI CARPET

Yumei Xue^*
, Dongxue Zhou

^*此作品的通讯作者

数学科学学院

Beihang University

科研成果: 期刊稿件 › 文章 › 同行评审

11 引用（Scopus）

摘要

In this paper, we construct a special network based on the construction of the Sierpinski carpet. Using the self-similarity and renewal theorem, we obtain the asymptotic formula for the average path length of our evolving network.

源语言	英语
文章编号	1850039
期刊	Fractals
卷	26
期	3
DOI	https://doi.org/10.1142/S0218348X18500391
出版状态	已出版 - 1 6月 2018

访问文件

10.1142/S0218348X18500391

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{aac2a645cfa74cc3afdd4f44c8d0ded2,

title = "ASYMPTOTIC FORMULA on AVERAGE PATH LENGTH of A SPECIAL NETWORK BASED on SIERPINSKI CARPET",

abstract = "In this paper, we construct a special network based on the construction of the Sierpinski carpet. Using the self-similarity and renewal theorem, we obtain the asymptotic formula for the average path length of our evolving network.",

keywords = "Fractal, Network, Self-Similarity, Sierpinski Carpet",

author = "Yumei Xue and Dongxue Zhou",

note = "Publisher Copyright: {\textcopyright} 2018 World Scientific Publishing Company.",

year = "2018",

month = jun,

day = "1",

doi = "10.1142/S0218348X18500391",

language = "英语",

volume = "26",

journal = "Fractals",

issn = "0218-348X",

publisher = "World Scientific",

number = "3",

}

TY - JOUR

T1 - ASYMPTOTIC FORMULA on AVERAGE PATH LENGTH of A SPECIAL NETWORK BASED on SIERPINSKI CARPET

AU - Xue, Yumei

AU - Zhou, Dongxue

PY - 2018/6/1

Y1 - 2018/6/1

N2 - In this paper, we construct a special network based on the construction of the Sierpinski carpet. Using the self-similarity and renewal theorem, we obtain the asymptotic formula for the average path length of our evolving network.

AB - In this paper, we construct a special network based on the construction of the Sierpinski carpet. Using the self-similarity and renewal theorem, we obtain the asymptotic formula for the average path length of our evolving network.

KW - Fractal

KW - Network

KW - Self-Similarity

KW - Sierpinski Carpet

UR - https://www.scopus.com/pages/publications/85048994689

U2 - 10.1142/S0218348X18500391

DO - 10.1142/S0218348X18500391

M3 - 文章

AN - SCOPUS:85048994689

SN - 0218-348X

VL - 26

JO - Fractals

JF - Fractals

IS - 3

M1 - 1850039

ER -

ASYMPTOTIC FORMULA on AVERAGE PATH LENGTH of A SPECIAL NETWORK BASED on SIERPINSKI CARPET

摘要

访问文件

其它文件与链接

学术指纹

引用此