Depth-based complexity traces of graphs

DOI10.1016/J.PATCOG.2013.09.010MaRDI QIDQ898379zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Lu Bai, Edwin R. Hancock

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)

Recommendations

• Depth-based hypergraph complexity traces from directed line graphs
• Fast depth-based subgraph kernels for unattributed graphs
• Entropy and the complexity of graphs revisited
• Structural information content of networks: graph entropy based on local vertex functionals
• An axiomatic approach to network complexity

Cites work

• scientific article; zbMATH DE number 3427210 (Why is no real title available?)
• scientific article; zbMATH DE number 3735873 (Why is no real title available?)
• A history of graph entropy measures
• A quantum Jensen-Shannon graph kernel using the continuous-time quantum walk
• Bridging the Gap between Graph Edit Distance and Kernel Machines
• Center of a graph with respect to edges
• Centers to centroids in graphs
• Chromatic number and the 2-rank of a graph
• Complexity in chemistry, biology and ecology.
• Diffusion kernels on statistical manifolds
• Efficient Algorithms for Shortest Paths in Sparse Networks
• Entropy and the complexity of graphs revisited
• Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
• Graph complexity
• Graph kernels from the Jensen-Shannon divergence
• Information processing in complex networks: Graph entropy and information functionals
• Measures of statistical complexity: why?
• Mining Graph Data
• Network analysis. Methodological foundations.
• Nonextensive information theoretic kernels on measures
• On graph kernels: hardness results and efficient alternatives.
• The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states

Cited in

(9)

• Graph characterization by counting sink star subgraphs
• Flow Complexity: Fast Polytopal Graph Complexity and 3D Object Clustering
• Depth-based hypergraph complexity traces from directed line graphs
• A nested alignment graph kernel through the dynamic time warping framework
• Minimising entropy changes in dynamic network evolution
• Branch-depth: generalizing tree-depth of graphs
• Fast depth-based subgraph kernels for unattributed graphs
• Estimation of expressions' complexities for two-terminal directed acyclic graphs
• scientific article; zbMATH DE number 7029306 (Why is no real title available?)

Describes a project that uses

Uses Software

• COIL-20
• AFGen

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

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