Depth-based complexity traces of graphs

DOI10.1016/j.patcog.2013.09.010zbMath1326.68241OpenAlexW1976159745WikidataQ60430863 ScholiaQ60430863MaRDI QIDQ898379

Edwin R. Hancock, Lu Bai

Publication date: 8 December 2015

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2013.09.010

zbMATH Keywords

entropygraph classificationcentroid expansion subgraphscentroid vertexdepth-based complexity tracesentropy difference

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Applications of graph theory (05C90) Pattern recognition, speech recognition (68T10) Measures of information, entropy (94A17) Random walks on graphs (05C81)

Related Items (4)

Graph characterization by counting sink star subgraphs ⋮ A Nested Alignment Graph Kernel Through the Dynamic Time Warping Framework ⋮ Minimising Entropy Changes in Dynamic Network Evolution ⋮ Depth-based hypergraph complexity traces from directed line graphs

Uses Software

• AFGen
• COIL-20

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph kernels from the Jensen-Shannon divergence
• Entropy and the complexity of graphs revisited
• A history of graph entropy measures
• 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
• Graph complexity
• Chromatic number and the 2-rank of a graph
• Measures of statistical complexity: why?
• Network analysis. Methodological foundations.
• Mining Graph Data
• Centers to centroids in graphs
• Efficient Algorithms for Shortest Paths in Sparse Networks
• A Quantum Jensen-Shannon Graph Kernel Using the Continuous-Time Quantum Walk
• Learning Theory and Kernel Machines
• Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
• Bridging the Gap between Graph Edit Distance and Kernel Machines

This page was built for publication: Depth-based complexity traces of graphs