IDEAS home Printed from https://ideas.repec.org/a/hin/complx/6210878.html
   My bibliography  Save this article

Structure Properties of Koch Networks Based on Networks Dynamical Systems

Author

Listed:
  • Yinhu Zhai
  • Jia-Bao Liu
  • Shaohui Wang

Abstract

We introduce an informative labeling algorithm for the vertices of a family of Koch networks. Each label consists of two parts: the precise position and the time adding to Koch networks. The shortest path routing between any two vertices is determined only on the basis of their labels, and the routing is calculated only by few computations. The rigorous solutions of betweenness centrality for every node and edge are also derived by the help of their labels. Furthermore, the community structure in Koch networks is studied by the current and voltage characterizations of its resistor networks.

Suggested Citation

  • Yinhu Zhai & Jia-Bao Liu & Shaohui Wang, 2017. "Structure Properties of Koch Networks Based on Networks Dynamical Systems," Complexity, Hindawi, vol. 2017, pages 1-7, March.
    • Handle: RePEc:hin:complx:6210878
    DOI: 10.1155/2017/6210878
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2017/6210878.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/8503/2017/6210878.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2017/6210878?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Comellas, Francesc & Miralles, Alicia, 2009. "Modeling complex networks with self-similar outerplanar unclustered graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 388(11), pages 2227-2233.
    2. Barabási, Albert-László & Ravasz, Erzsébet & Vicsek, Tamás, 2001. "Deterministic scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 299(3), pages 559-564.
    3. Wei, Daijun & Deng, Xinyang & Zhang, Xiaoge & Deng, Yong & Mahadevan, Sankaran, 2013. "Identifying influential nodes in weighted networks based on evidence theory," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(10), pages 2564-2575.
    4. Chandra, Anjan Kumar & Dasgupta, Subinay, 2005. "A small world network of prime numbers," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 357(3), pages 436-446.
    5. Z.-Z. Zhang & S.-G. Zhou & T. Zou, 2007. "Self-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 56(3), pages 259-271, April.
    6. Zhou, Tao & Wang, Bing-Hong & Hui, P.M. & Chan, K.P., 2006. "Topological properties of integer networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 367(C), pages 613-618.
    Full references (including those not matched with items on IDEAS)

    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.
    1. Knor, Martin & Škrekovski, Riste, 2013. "Deterministic self-similar models of complex networks based on very symmetric graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(19), pages 4629-4637.
    2. Li, Yinwei & Jiang, Guo-Ping & Wu, Meng & Song, Yu-Rong & Wang, Haiyan, 2021. "Undirected Congruence Model: Topological characteristics and epidemic spreading," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 565(C).
    3. Lu, Xi & Mo, Hongming & Deng, Yong, 2015. "An evidential opinion dynamics model based on heterogeneous social influential power," Chaos, Solitons & Fractals, Elsevier, vol. 73(C), pages 98-107.
    4. Gao, Yan & Liu, Gengyuan & Casazza, Marco & Hao, Yan & Zhang, Yan & Giannetti, Biagio F., 2018. "Economy-pollution nexus model of cities at river basin scale based on multi-agent simulation: A conceptual framework," Ecological Modelling, Elsevier, vol. 379(C), pages 22-38.
    5. Blasi, Monica Francesca & Casorelli, Ida & Colosimo, Alfredo & Blasi, Francesco Simone & Bignami, Margherita & Giuliani, Alessandro, 2005. "A recursive network approach can identify constitutive regulatory circuits in gene expression data," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 348(C), pages 349-370.
    6. Hao Wu & Rene van den Brink & Arantza Estevez-Fernandez, 2022. "The locally partial permission value for games with a permission structure," Tinbergen Institute Discussion Papers 22-037/II, Tinbergen Institute.
    7. Hollingshad, Nicholas W. & Turalska, Malgorzata & Allegrini, Paolo & West, Bruce J. & Grigolini, Paolo, 2012. "A new measure of network efficiency," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(4), pages 1894-1899.
    8. Salavati, Chiman & Abdollahpouri, Alireza & Manbari, Zhaleh, 2018. "BridgeRank: A novel fast centrality measure based on local structure of the network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 496(C), pages 635-653.
    9. Wang, Yanhui & Bi, Lifeng & Lin, Shuai & Li, Man & Shi, Hao, 2017. "A complex network-based importance measure for mechatronics systems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 466(C), pages 180-198.
    10. Zhang, Zhongzhi & Rong, Lili & Comellas, Francesc, 2006. "High-dimensional random Apollonian networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 364(C), pages 610-618.
    11. Lu, Zhe-Ming & Guo, Shi-Ze, 2012. "A small-world network derived from the deterministic uniform recursive tree," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(1), pages 87-92.
    12. Deng, Xinyang & Deng, Yong, 2014. "On the axiomatic requirement of range to measure uncertainty," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 406(C), pages 163-168.
    13. Farkas, I & Derényi, I & Jeong, H & Néda, Z & Oltvai, Z.N & Ravasz, E & Schubert, A & Barabási, A.-L & Vicsek, T, 2002. "Networks in life: scaling properties and eigenvalue spectra," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 314(1), pages 25-34.
    14. Sheikhahmadi, Amir & Nematbakhsh, Mohammad Ali & Zareie, Ahmad, 2017. "Identification of influential users by neighbors in online social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 486(C), pages 517-534.
    15. Zheng, Xiaolong & Zeng, Daniel & Li, Huiqian & Wang, Feiyue, 2008. "Analyzing open-source software systems as complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(24), pages 6190-6200.
    16. Zhu, Hengmin & Yin, Xicheng & Ma, Jing & Hu, Wei, 2016. "Identifying the main paths of information diffusion in online social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 452(C), pages 320-328.
    17. Pedro A. Solares-Hernández & Fernando A. Manzano & Francisco J. Pérez-Benito & J. Alberto Conejero, 2020. "Divisibility Patterns within Pascal Divisibility Networks," Mathematics, MDPI, vol. 8(2), pages 1-10, February.
    18. Dai, Meifeng & Shao, Shuxiang & Su, Weiyi & Xi, Lifeng & Sun, Yanqiu, 2017. "The modified box dimension and average weighted receiving time of the weighted hierarchical graph," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 475(C), pages 46-58.
    19. Gao, Cai & Wei, Daijun & Hu, Yong & Mahadevan, Sankaran & Deng, Yong, 2013. "A modified evidential methodology of identifying influential nodes in weighted networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(21), pages 5490-5500.
    20. Li, Tianyu & Yan, Weigen, 2019. "Enumeration of spanning trees of 2-separable networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 536(C).

    More about this item

    Statistics

    Access and download statistics

    Corrections

    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:hin:complx:6210878. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.