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

DOI10.1016/j.physa.2020.125666OpenAlexW3110753556MaRDI QIDQ2068490

Ismo T. Koponen, Esko Keski-Vakkuri, Elina Palmgren

Publication date: 19 January 2022

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.07311

zbMATH Keywords

generalised thermodynamicsadjacency kernelsheavy tailed networksq-entropy

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Related Items

Complex-valued Rényi entropy

Uses Software

• igraph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A history of graph entropy measures
• Information processing in complex networks: Graph entropy and information functionals
• Ranking hubs and authorities using matrix functions
• Possible generalization of Boltzmann-Gibbs statistics.
• On the putative essential discreteness of q-generalized entropies
• A new status index derived from sociometric analysis
• On aq-generalization of circular and hyperbolic functions
• On the Limiting Behavior of Parameter-Dependent Network Centrality Measures
• On quantum Rényi entropies: A new generalization and some properties
• Some properties of \(q\)-logarithm and \(q\)-exponential functions in Tsallis statistics