Probabilistic inequalities for evaluating structural network measures

DOI10.1016/j.ins.2014.07.018zbMath1355.05240OpenAlexW1963577968MaRDI QIDQ508736

Veronika Kraus, Frank Emmert-Streib, Matthias Dehmer

Publication date: 8 February 2017

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2014.07.018

zbMATH Keywords

statisticsinformation inequalityquantitative graph theoryrandom network models

Mathematics Subject Classification ID

Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Deterministic network models in operations research (90B10) Structural characterization of families of graphs (05C75) Measures of information, entropy (94A17)

Related Items (10)

Entropy of weighted graphs with Randić weights ⋮ Inertia of complex unit gain graphs ⋮ Bounds for degree-based network entropies ⋮ Note on two generalizations of the Randić index ⋮ On graph entropy measures based on the number of independent sets and matchings ⋮ Szeged and Mostar root-indices of graphs ⋮ Large-scale analysis of structural branching measures ⋮ Network entropies based on independent sets and matchings ⋮ Graph distance measures based on topological indices revisited ⋮ Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth

Uses Software

• igraph
• QuACN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Information theory of networks
• A history of graph entropy measures
• Spectra of graphs
• Spektren endlicher Grafen
• Laplacian energy of a graph
• A new geometric-arithmetic index
• Information processing in complex networks: Graph entropy and information functionals
• Inequalities for entropy-based measures of network information content
• Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges
• Some bounds on entropy measures in information theory
• Universal construction mechanism for networks from one-dimensional symbol sequences
• On structure-sensitivity of degree-based topological indices
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• A framework for linear information inequalities
• On characterization of entropy function via information inequalities
• Collective dynamics of ‘small-world’ networks
• Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
• Networks

This page was built for publication: Probabilistic inequalities for evaluating structural network measures