Fractality of multiple colored substitution networks
Author
Abstract
Suggested Citation
DOI: 10.1016/j.physa.2019.03.079
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Barabási, Albert-László & Albert, Réka & Jeong, Hawoong, 2000. "Scale-free characteristics of random networks: the topology of the world-wide web," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 281(1), pages 69-77.
- Sun, Bingbin & Yao, Jialing & Xi, Lifeng, 2019. "Eigentime identities of fractal sailboat networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 520(C), pages 338-349.
- Li, Ziyu & Yu, Zhouyu & Xi, Lifeng, 2018. "Scale-free effect of substitution networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 492(C), pages 1449-1455.
- Xi, Lifeng & Wang, Lihong & Wang, Songjing & Yu, Zhouyu & Wang, Qin, 2017. "Fractality and scale-free effect of a class of self-similar networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 478(C), pages 31-40.
- Barabási, Albert-László & Albert, Réka & Jeong, Hawoong, 1999. "Mean-field theory for scale-free random networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 272(1), pages 173-187.
- Chaoming Song & Shlomo Havlin & Hernán A. Makse, 2005. "Self-similarity of complex networks," Nature, Nature, vol. 433(7024), pages 392-395, January.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Hu, Zhongren & Wu, Bo, 2023. "The average shortest distance of three colored substitution networks," Chaos, Solitons & Fractals, Elsevier, vol. 176(C).
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Yao, Jialing & Sun, Bingbin & Xi, lifeng, 2019. "Fractality of evolving self-similar networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 515(C), pages 211-216.
- Duan, Shuyu & Wen, Tao & Jiang, Wen, 2019. "A new information dimension of complex network based on Rényi entropy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 516(C), pages 529-542.
- Sun, Bingbin & Yao, Jialing & Xi, Lifeng, 2019. "Eigentime identities of fractal sailboat networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 520(C), pages 338-349.
- Fetta, A.G. & Harper, P.R. & Knight, V.A. & Vieira, I.T. & Williams, J.E., 2012. "On the Peter Principle: An agent based investigation into the consequential effects of social networks and behavioural factors," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(9), pages 2898-2910.
- Claes Andersson & Koen Frenken & Alexander Hellervik, 2006.
"A Complex Network Approach to Urban Growth,"
Environment and Planning A, , vol. 38(10), pages 1941-1964, October.
- Claes Andersson & Koen Frenken & Alexander Hellervik, 2005. "A complex network approach to urban growth," Papers in Evolutionary Economic Geography (PEEG) 0505, Utrecht University, Department of Human Geography and Spatial Planning, Group Economic Geography, revised Feb 2005.
- Matthew O. Jackson & Brian W. Rogers, 2005.
"Search in the Formation of Large Networks: How Random are Socially Generated Networks?,"
Game Theory and Information
0503005, University Library of Munich, Germany.
- Jackson, Matthew O. & Rogers, Brian W., 2005. "Search in the formation of large networks: How random are socially generated networks?," Working Papers 1216, California Institute of Technology, Division of the Humanities and Social Sciences.
- Seroussi, Inbar & Sochen, Nir, 2020. "Localization phase transition in stochastic dynamics on networks with hub topology," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 554(C).
- Ikeda, Nobutoshi, 2019. "Growth model for fractal scale-free networks generated by a random walk," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 521(C), pages 424-434.
- Dangalchev, Chavdar, 2004. "Generation models for scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 338(3), pages 659-671.
- S Konini & E J Janse van Rensburg, 2017. "Mean field analysis of algorithms for scale-free networks in molecular biology," PLOS ONE, Public Library of Science, vol. 12(12), pages 1-34, December.
- Miralles, Alicia & Comellas, Francesc & Chen, Lichao & Zhang, Zhongzhi, 2010. "Planar unclustered scale-free graphs as models for technological and biological networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(9), pages 1955-1964.
- Dong, Xuefan & Liu, Yijung & Wu, Chao & Lian, Ying, 2019. "The topology of scale-free networks with an S-shaped nonlinear growth characteristic," Chaos, Solitons & Fractals, Elsevier, vol. 121(C), pages 137-148.
- Dai, Meifeng & Feng, Wenjing & Wu, Xianbin & Chi, Huijia & Li, Peng & Su, Weiyi, 2019. "The Laplacian spectrum and average trapping time for weighted Dyson hierarchical network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 515(C), pages 510-518.
- Chen, Qinghua & Shi, Dinghua, 2006. "Markov chains theory for scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 360(1), pages 121-133.
- Chandra, Anita & Garg, Himanshu & Maiti, Abyayananda, 2019. "A general growth model for online emerging user–object bipartite networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 517(C), pages 370-384.
- Huang, Yuke & Zhang, Hanxiong & Zeng, Cheng & Xue, Yumei, 2020. "Scale-free and small-world properties of a multiple-hub network with fractal structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 558(C).
- Yao, Xin & Zhang, Chang-shui & Chen, Jin-wen & Li, Yan-da, 2005. "On the formation of degree and cluster-degree correlations in scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 353(C), pages 661-673.
- Lian, Ying & Dong, Xuefan & Liu, Yijun, 2017. "Topological evolution of the internet public opinion," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 486(C), pages 567-578.
- Zhao, Star X. & Rousseau, Ronald & Ye, Fred Y., 2011. "h-Degree as a basic measure in weighted networks," Journal of Informetrics, Elsevier, vol. 5(4), pages 668-677.
- Liang, Wei & Shi, Yuming & Huang, Qiuling, 2014. "Modeling the Chinese language as an evolving network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 393(C), pages 268-276.
More about this item
Keywords
Fractal networks; Fractality; Substitution networks;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:525:y:2019:i:c:p:402-408. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.