Upper and lower bounds for the \(q\)-entropy of network models with application to network model selection

DOI10.1016/j.ipl.2016.11.002zbMath1401.68069OpenAlexW2556799122MaRDI QIDQ503599

Mostafa Haghir Chehreghani, Talel Abdessalem

Publication date: 13 January 2017

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2016.11.002

zbMATH Keywords

graph algorithms\(q\)-entropyBarabasi-Albert modelnetwork model selectionsmall-world model

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (2)

On the von Neumann entropy of a graph ⋮ KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation

Uses Software

• KronFit

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
• Information processing in complex networks: Graph entropy and information functionals
• Entanglement, mixedness, and \(q\)-entropies
• On the spectral radius of graphs with cut vertices
• Sharp upper bounds for the Laplacian graph eigenvalues
• Depth-based hypergraph complexity traces from directed line graphs
• A spectral approach to learning structural variations in graphs
• Emergence of Scaling in Random Networks
• Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition
• Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs
• Algorithms and Models for the Web-Graph
• On the \(k\)th largest eigenvalue of the Laplacian matrix of a graph
• On the size of randomized OBDDs and read-once branching programs for \(k\)-stable functions

This page was built for publication: Upper and lower bounds for the \(q\)-entropy of network models with application to network model selection