Probabilistic inequalities for evaluating structural network measures

DOI10.1016/J.INS.2014.07.018MaRDI QIDQ508736zbMATH OpenOpenAlexFDO

Authors Veronika Kraus, Matthias Dehmer, Frank Emmert-Streib

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) Measures of information, entropy (94A17) Structural characterization of families of graphs (05C75)

Recommendations

• Inequalities for entropy-based measures of network information content
• Properties of graph distance measures by means of discrete inequalities
• New inequalities between information measures of network information content
• New inequalities for network distance measures by using graph spectra
• Bounds for degree-based network entropies

Cites work

• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 3781233 (Why is no real title available?)
• scientific article; zbMATH DE number 2050468 (Why is no real title available?)
• scientific article; zbMATH DE number 1866312 (Why is no real title available?)
• scientific article; zbMATH DE number 5251354 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• scientific article; zbMATH DE number 3062467 (Why is no real title available?)
• A framework for linear information inequalities
• A history of graph entropy measures
• A new geometric-arithmetic index
• Collective dynamics of `small-world' networks
• Emergence of Scaling in Random Networks
• Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
• Graph energy
• Inequalities for entropy-based measures of network information content
• Information processing in complex networks: Graph entropy and information functionals
• Information theory of networks
• Laplacian energy of a graph
• Networks. An introduction.
• Note on Estrada and \(L\)-Estrada indices of graphs
• On characterization of entropy function via information inequalities
• On extremal properties of graph entropies
• On sphere-regular graphs and the extremality of information-theoretic network measures
• On structure-sensitivity of degree-based topological indices
• Some bounds on entropy measures in information theory
• Spectra of graphs
• Spektren endlicher Grafen
• Statistical mechanics of complex networks
• The structure and dynamics of networks
• Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges
• Universal construction mechanism for networks from one-dimensional symbol sequences

Cited in

(12)

• Estimation of extremal properties in non-negative networks
• Entropy of weighted graphs with Randić weights
• Graph distance measures based on topological indices revisited
• Note on two generalizations of the Randić index
• Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth
• Szeged and Mostar root-indices of graphs
• Network entropies based on independent sets and matchings
• scientific article; zbMATH DE number 3821434 (Why is no real title available?)
• On graph entropy measures based on the number of independent sets and matchings
• Bounds for degree-based network entropies
• Inertia of complex unit gain graphs
• Large-scale analysis of structural branching measures

Describes a project that uses

Uses Software

• igraph
• QuACN

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q508736)