Graph characteristics from the heat kernel trace
From MaRDI portal
Publication:2270728
DOI10.1016/j.patcog.2008.12.029zbMath1175.68403OpenAlexW2051998685WikidataQ60431130 ScholiaQ60431130MaRDI QIDQ2270728
Bai Xiao, Edwin R. Hancock, Richard C. Wilson
Publication date: 29 July 2009
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2008.12.029
Computing methodologies for image processing (68U10) Pattern recognition, speech recognition (68T10) Machine vision and scene understanding (68T45)
Related Items (10)
Graph characterization by counting sink star subgraphs ⋮ The many facets of the Estrada indices of graphs and networks ⋮ Graph kernels from the Jensen-Shannon divergence ⋮ Efficient multi-modal fusion on supergraph for scalable image annotation ⋮ Depth-based hypergraph complexity traces from directed line graphs ⋮ Modeling generation of the router-level topology of an ISP network ⋮ Hierarchical graph embedding in vector space by graph pyramid ⋮ Characteristic Polynomial Analysis on Matrix Representations of Graphs ⋮ A New Entropy for Hypergraphs ⋮ Notes on discrete Gaussian scale space
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A spectral algorithm for learning mixture models
- Laplace eigenvalues of graphs---a survey
- The Selberg trace formula for \(\text{PSL}(2,\mathbb R)\). Vol. 2
- Spanning trees in regular graphs
- Spectral embedding of graphs.
- Zeta functions of finite graphs and coverings
- Diffusion maps
- A matrix representation of graphs and its spectrum as a graph invariant
- Diffusions on graphs, Poisson problems and spectral geometry
- A Spectral Algorithm for Seriation and the Consecutive Ones Problem
- Isospectral polygons, planar graphs and heat content
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Learning Theory
This page was built for publication: Graph characteristics from the heat kernel trace
