Probabilistic inequalities for evaluating structural network measures
DOI10.1016/J.INS.2014.07.018zbMATH Open1355.05240OpenAlexW1963577968MaRDI QIDQ508736FDOQ508736
Frank Emmert-Streib, Veronika Kraus, 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
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- Collective dynamics of ‘small-world’ networks
- Networks
- Spectra of graphs
- Graph energy
- On structure-sensitivity of degree-based topological indices
- A history of graph entropy measures
- Spektren endlicher Grafen
- Laplacian energy of a graph
- Information processing in complex networks: Graph entropy and information functionals
- 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
- On extremal properties of graph entropies
- On characterization of entropy function via information inequalities
- Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
- A new geometric-arithmetic index
- Inequalities for entropy-based measures of network information content
- Note on Estrada and \(L\)-Estrada indices of graphs
- A framework for linear information inequalities
- Information theory of networks
- Universal construction mechanism for networks from one-dimensional symbol sequences
Cited In (12)
- Note on two generalizations of the Randić index
- Bounds for degree-based network entropies
- Large-scale analysis of structural branching measures
- Entropy of weighted graphs with Randić weights
- Title not available (Why is that?)
- Inertia of complex unit gain graphs
- Estimation of extremal properties in non-negative networks
- Network entropies based on independent sets and matchings
- On graph entropy measures based on the number of independent sets and matchings
- Szeged and Mostar root-indices of graphs
- 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
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)
