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

^*Corresponding author for this work

School of Mathematical Sciences

Beihang University

Research output: Contribution to journal › Article › peer-review

11 Scopus citations

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.

Original language	English
Article number	1850039
Journal	Fractals
Volume	26
Issue number	3
DOIs	https://doi.org/10.1142/S0218348X18500391
State	Published - 1 Jun 2018

Keywords

Fractal
Network
Self-Similarity
Sierpinski Carpet

Access to Document

10.1142/S0218348X18500391

Cite this

@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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this