Heat diffusion distance processes: a statistically founded method to analyze graph data sets
From MaRDI portal
Publication:6650219
DOI10.1007/S41468-023-00125-WMaRDI QIDQ6650219
Publication date: 6 December 2024
Published in: Journal of Applied and Computational Topology (Search for Journal in Brave)
Nonparametric hypothesis testing (62G10) Central limit and other weak theorems (60F05) Nonparametric tolerance and confidence regions (62G15) Persistent homology and applications, topological data analysis (55N31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Diffusion processes (60J60)
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?)
- A study of graph spectra for comparing graphs and trees
- Extending persistence using Poincaré and Lefschetz duality
- An estimate for the nonstochastic eigenvalues of doubly stochastic matrices
- Weak convergence and empirical processes. With applications to statistics
- Fifty years of graph matching, network alignment and network comparison
- Diffusion maps for changing data
- Introduction to empirical processes and semiparametric inference
- Diffusion maps
- On the problem of the most efficient tests of statistical hypotheses.
- Stable and efficient spectral divide and conquer algorithms for the symmetric eigenvalue decomposition and the SVD
- The Gudhi Library: Simplicial Complexes and Persistent Homology
- The Structure and Stability of Persistence Modules
- Revisiting two strong approximation results of Dudley and Philipp
- Random Geometric Graphs
- Collective dynamics of ‘small-world’ networks
This page was built for publication: Heat diffusion distance processes: a statistically founded method to analyze graph data sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6650219)
