Generalized Farey tree network with small-world

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Generalized Farey tree network (GFTN) model with small-world is proposed, and the topological characteristics are studied by both theoretical analysis and numerical simulations, which are in good accordance with each other. Analytical results show that the degree distribution of the GFTN is exponential. As the number of network nodes increasing with time interval (or level number), t, the clustering coefficient of the networks tends to a constant, ln2; the diameter of the network is increasing with t, the resulting networks are evolved from disassortative to assortative and show assortative coefficient tends to 0.25 for large t. © 2009 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.

Cite

CITATION STYLE

APA

Fang, J. Q., & Li, Y. (2009). Generalized Farey tree network with small-world. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (Vol. 5 LNICST, pp. 1678–1689). https://doi.org/10.1007/978-3-642-02469-6_46

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free