Upper and lower bounds for the \(q\)-entropy of network models with application to network model selection
type: Item
instance of: scholarly article
title: Upper and lower bounds for the \(q\)-entropy of network models with application to network model selection
zbMATH Open document ID: 1401.68069
author: Mostafa Haghir Chehreghani
author: Talel Abdessalem
published in: Information Processing Letters
publication date: 2017-01-13T00:00:00Z
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 05C82
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6674417
zbMATH Keywords: graph algorithms
zbMATH Keywords: \(q\)-entropy
zbMATH Keywords: Barabasi-Albert model
zbMATH Keywords: small-world model
zbMATH Keywords: network model selection
describes a project that uses: KronFit
MaRDI profile type: Publication
full work available at URL: j.ipl.2016.11.002
OpenAlex ID: W2556799122
cites work: Depth-based hypergraph complexity traces from directed line graphs
cites work: Emergence of Scaling in Random Networks
cites work: Entanglement, mixedness, and \(q\)-entropies
cites work: On the spectral radius of graphs with cut vertices
cites work: The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
cites work: Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs
cites work: Information processing in complex networks: Graph entropy and information functionals
cites work: Algorithms and Models for the Web-Graph
cites work: Q3286850
cites work: Kronecker graphs: an approach to modeling networks
cites work: Q3556939
cites work: A spectral approach to learning structural variations in graphs
cites work: Sharp upper bounds for the Laplacian graph eigenvalues
cites work: On the size of randomized OBDDs and read-once branching programs for \(k\)-stable functions
cites work: Q3370780
cites work: Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition
cites work: On the \(k\)th largest eigenvalue of the Laplacian matrix of a graph
DOI: 10.1016/J.IPL.2016.11.002
description: scientific article; zbMATH DE number 6674417