Power-Law Property of High Clustering Network Induced by Deactivation Mechanism

Rong Rong Dai; Zhen Ting Hou

doi:10.4028/www.scientific.net/AMM.719-720.779

Paper Titles

Generation of New Collision Free S-Random Interleavers of Turbo Codes
p.750

Optimized Prefetching Scheme to Support VCR-Like Operations in P2P VoD Applications with Guided Seeks
p.756

Dual-Hop Amplify-and-Forward Variable Gain Relaying over Mixture Gamma Fading Channels
p.767

A Privacy-Preserving Intra-Cluster Data Aggregation Method in Wireless Sensor Networks
p.773

Power-Law Property of High Clustering Network Induced by Deactivation Mechanism
p.779

Performance Evaluation on a Hybrid Algorithm for Computing Constrained Shortest Paths
p.784

Research of Three-Dimensional Layered Network Architecture LDM³ for ITS
p.791

A Novel Improvement on a Crypto-System Based on a Chaotic Map in WSNs
p.798

Building a Decision Tree Model for Campus Information Score Based on the Algorithm C5.0
p.805

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 719-720Power-Law Property of High Clustering Network...

Power-Law Property of High Clustering Network Induced by Deactivation Mechanism

Abstract:

We study the high clustering model of K. Klemm and V.M. Eguiliuz [1]. The basic idea is the growing networks based on a finite memory of the nodes. Our main contributions are as follows: based on the high clustering model, we investigate analytically that it does generate a power-law degree distribution and give the exact solution from the perspective of Markov chain. And the degree exponent varying is depend on the parameters α and m.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 719-720)

Pages:

779-783

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.719-720.779

Citation:

Cite this paper

Online since:

January 2015

Authors:

Rong Rong Dai*, Zhen Ting Hou

Keywords:

High Clustering Model Induced by Deactivation Mechanism, Markov Chain, Power-Law

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] K. Klemm and V. M. Eguiluz, Highly clustered scale-free networks, Phys. Rev. E 65, 036123 (2002).

Google Scholar

[2] A. -L. Barabasi and R. Albert, Emergence of scaling in random networks, Science 286, 509 (1999).

Google Scholar

[3] S. H. Strogatz, Exploring complex networks, Nature 410, 268 (2001).

Google Scholar

[4] S.N. Dorogovtsev, J.F.F. Mendes, Evolution of networks, Adv. Phys. 51, 1079 (2002).

Google Scholar

[5] M. E. J. Newman, The structure and Function of complex networks, SIAM Rev. 45, 167 (2003).

Google Scholar

[6] J. Watts and S. H. Strogatz, Collective dynamics of small-world networks, Nature (London) 393, 440 (1998).

DOI: 10.1038/30918

Google Scholar

[7] Fronczak, P. Fronzak, and J. A. Holyst, Mean- field theory for clustering coefficients in Barabasi-Albert networks, Phys. Rev. E 68, 046126 (2003).

DOI: 10.1103/physreve.68.046126

Google Scholar

[8] K. Klemm and V. M. Eguiluz, Growing Scale-free networks with small-world behavior, Phys. Rev. E 65, 057102 (2002).

Google Scholar

[9] A. -L. Barabasi and R. Albert, Statistical mechanics of complex networks, Rev. Mod. Phys. 74, 47 (2002).

Google Scholar

[10] Dorogovstsev, S. N., and J. F. F. Mendes, and A. N. Samukhin, Structure of growing networks with preferential linking, Phys. Rev. Lett. 85, 4633 (2000).

DOI: 10.1103/physrevlett.85.4633

Google Scholar