IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v566y2021ics037843712030964x.html
   My bibliography  Save this article

Characterising heavy-tailed networks using q-generalised entropy and q-adjacency kernels

Author

Listed:
  • Koponen, Ismo T.
  • Palmgren, Elina
  • Keski-Vakkuri, Esko

Abstract

Heavy-tailed networks, which have degree distributions characterised by slower than exponentially bounded tails, are common in many different situations. Some interesting cases, where heavy tails are characterised by inverse powers λ in the range 1<λ<2, arise for associative knowledge networks, and semantic and linguistic networks. In these cases, the differences between the networks are often delicate, calling for robust methods to characterise the differences. Here, we introduce a method for comparing networks using a density matrix based on q-generalised adjacency matrix kernels. It is shown that comparison of networks can then be performed using the q-generalised Kullback–Leibler divergence. In addition, the q-generalised divergence can be interpreted as a q-generalised free energy, which enables the thermodynamic-like macroscopic description of the heavy-tailed networks. The viability of the q-generalised adjacency kernels and the thermodynamic-like description in characterisation of complex networks is demonstrated using a simulated set of networks, which are modular and heavy-tailed with a degree distribution of inverse power law in the range 1<λ<2.

Suggested Citation

  • Koponen, Ismo T. & Palmgren, Elina & Keski-Vakkuri, Esko, 2021. "Characterising heavy-tailed networks using q-generalised entropy and q-adjacency kernels," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 566(C).
  • Handle: RePEc:eee:phsmap:v:566:y:2021:i:c:s037843712030964x
    DOI: 10.1016/j.physa.2020.125666
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037843712030964X
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

    File URL: https://libkey.io/10.1016/j.physa.2020.125666?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Yamano, Takuya, 2002. "Some properties of q-logarithm and q-exponential functions in Tsallis statistics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 305(3), pages 486-496.
    2. Abe, Sumiyoshi, 2006. "Temperature of nonextensive systems: Tsallis entropy as Clausius entropy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 368(2), pages 430-434.
    3. Abe, Sumiyoshi, 2004. "Quantum q-divergence," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 344(3), pages 359-365.
    4. Plastino, A. & Rocca, M.C., 2017. "On the putative essential discreteness of q-generalized entropies," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 488(C), pages 56-59.
    5. Estrada, Ernesto & Higham, Desmond J. & Hatano, Naomichi, 2009. "Communicability betweenness in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 388(5), pages 764-774.
    6. Anna D. Broido & Aaron Clauset, 2019. "Scale-free networks are rare," Nature Communications, Nature, vol. 10(1), pages 1-10, December.
    7. Petter Holme, 2019. "Rare and everywhere: Perspectives on scale-free networks," Nature Communications, Nature, vol. 10(1), pages 1-3, December.
    8. Tsallis, Constantino & Mendes, RenioS. & Plastino, A.R., 1998. "The role of constraints within generalized nonextensive statistics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 261(3), pages 534-554.
    9. Leo Katz, 1953. "A new status index derived from sociometric analysis," Psychometrika, Springer;The Psychometric Society, vol. 18(1), pages 39-43, March.
    10. Miguel A Ré & Rajeev K Azad, 2014. "Generalization of Entropy Based Divergence Measures for Symbolic Sequence Analysis," PLOS ONE, Public Library of Science, vol. 9(4), pages 1-11, April.
    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. Thomas J. Sargent & John Stachurski, 2022. "Economic Networks: Theory and Computation," Papers 2203.11972, arXiv.org, revised Jul 2022.
    2. Fleming, Sean W., 2021. "Scale-free networks, 1/f dynamics, and nonlinear conflict size scaling from an agent-based simulation model of societal-scale bilateral conflict and cooperation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 567(C).
    3. Alsayed, Ahmad & Higham, Desmond J., 2015. "Betweenness in time dependent networks," Chaos, Solitons & Fractals, Elsevier, vol. 72(C), pages 35-48.
    4. Meng, Xiangyi & Zhou, Bin, 2023. "Scale-free networks beyond power-law degree distribution," Chaos, Solitons & Fractals, Elsevier, vol. 176(C).
    5. Bin Zhou & Petter Holme & Zaiwu Gong & Choujun Zhan & Yao Huang & Xin Lu & Xiangyi Meng, 2023. "The nature and nurture of network evolution," Nature Communications, Nature, vol. 14(1), pages 1-8, December.
    6. Jiang, Xiong-Fei & Xiong, Long & Bai, Ling & Lin, Jie & Zhang, Jing-Feng & Yan, Kun & Zhu, Jia-Zhen & Zheng, Bo & Zheng, Jian-Jun, 2022. "Structure and dynamics of human complication-disease network," Chaos, Solitons & Fractals, Elsevier, vol. 164(C).
    7. da Silva, G.B. & Ramos, R.V., 2019. "The Lambert–Tsallis Wq function," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 525(C), pages 164-170.
    8. Johnston, Josh & Andersen, Tim, 2022. "Random processes with high variance produce scale free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 604(C).
    9. Valero, Jordi & Pérez-Casany, Marta & Duarte-López, Ariel, 2022. "The Zipf-Polylog distribution: Modeling human interactions through social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 603(C).
    10. Dukkipati, Ambedkar & Murty, M. Narasimha & Bhatnagar, Shalabh, 2006. "Nonextensive triangle equality and other properties of Tsallis relative-entropy minimization," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 361(1), pages 124-138.
    11. Goldrosen, Nicholas, 2024. "Is corrections officers' use of illegal force networked? Network structure, brokerage, and key players in the New York City Department of Correction," Journal of Criminal Justice, Elsevier, vol. 92(C).
    12. Vinayak, & Raghuvanshi, Adarsh & kshitij, Avinash, 2023. "Signatures of capacity development through research collaborations in artificial intelligence and machine learning," Journal of Informetrics, Elsevier, vol. 17(1).
    13. Karimi, Fatemeh & Lotfi, Shahriar & Izadkhah, Habib, 2021. "Community-guided link prediction in multiplex networks," Journal of Informetrics, Elsevier, vol. 15(4).
    14. D’Errico, Marco & Battiston, Stefano & Peltonen, Tuomas & Scheicher, Martin, 2018. "How does risk flow in the credit default swap market?," Journal of Financial Stability, Elsevier, vol. 35(C), pages 53-74.
    15. Naif Alotaibi & A. S. Al-Moisheer & Ibrahim Elbatal & Mansour Shrahili & Mohammed Elgarhy & Ehab M. Almetwally, 2023. "Half Logistic Inverted Nadarajah–Haghighi Distribution under Ranked Set Sampling with Applications," Mathematics, MDPI, vol. 11(7), pages 1-32, April.
    16. Liu, Xiaodong & Patacchini, Eleonora & Zenou, Yves & Lee, Lung-Fei, 2011. "Criminal Networks: Who is the Key Player?," Research Papers in Economics 2011:7, Stockholm University, Department of Economics.
    17. Agnieszka Rusinowska & Rudolf Berghammer & Harrie de Swart & Michel Grabisch, 2011. "Social networks: Prestige, centrality, and influence (Invited paper)," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-00633859, HAL.
    18. Gabrielle Demange, 2018. "Contagion in Financial Networks: A Threat Index," Management Science, INFORMS, vol. 64(2), pages 955-970, February.
    19. Lin, Dan & Wu, Jiajing & Xuan, Qi & Tse, Chi K., 2022. "Ethereum transaction tracking: Inferring evolution of transaction networks via link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 600(C).
    20. Yao Hongxing & Lu Yunxia, 2017. "Analyzing the Potential Influence of Shanghai Stock Market Based on Link Prediction Method," Journal of Systems Science and Information, De Gruyter, vol. 5(5), pages 446-461, October.

    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:eee:phsmap:v:566:y:2021:i:c:s037843712030964x. 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.

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