• Corpus ID: 244709571

# Graph recovery from graph wave equation

```@article{Takayama2021GraphRF,
title={Graph recovery from graph wave equation},
author={Yuuya Takayama},
journal={ArXiv},
year={2021},
volume={abs/2111.12874}
}```
• Yuuya Takayama
• Published 25 November 2021
• Computer Science, Mathematics
• ArXiv
We propose a method by which to recover an underlying graph from a set of multivariate wave signals that is discretely sampled from a solution of the graph wave equation. Herein, the graph wave equation is defined with the graph Laplacian, and its solution is explicitly given as a mode expansion of the Laplacian eigenvalues and eigenfunctions. For graph recovery, our idea is to extract modes corresponding to the square root of the eigenvalues from the discrete wave signals using the DMD method…

## References

SHOWING 1-10 OF 27 REFERENCES
Wavelets on Graphs via Spectral Graph Theory
• Computer Science, Mathematics
ArXiv
• 2009
Spectral graph theory
• U. Feige
• Mathematics
Zeta and 𝐿-functions in Number Theory and Combinatorics
• 2019
With every graph (or digraph) one can associate several different matrices. We have already seen the vertex-edge incidence matrix, the Laplacian and the adjacency matrix of a graph. Here we shall
On dynamic mode decomposition: Theory and applications
• Computer Science
• 2014
A theoretical framework in which dynamic mode decomposition is defined as the eigendecomposition of an approximating linear operator, which generalizes DMD to a larger class of datasets, including nonsequential time series, and shows that under certain conditions, DMD is equivalent to LIM.
Wave equations for graphs and the edge-based Laplacian
• Mathematics
• 2004
In this paper we develop a wave equation for graphs that has many of the properties of the classical Laplacian wave equation. This wave equation is based on a type of graph Laplacian we call the
The Gaussian Graphical Model in Cross-Sectional and Time-Series Data
• Computer Science
Multivariate behavioral research
• 2018
The Gaussian graphical model (GGM; an undirected network of partial correlation coefficients) is discussed and its utility as an exploratory data analysis tool is described: which variables predict one-another, allows for sparse modeling of covariance structures, and may highlight potential causal relationships between observed variables.
FastGGM: An Efficient Algorithm for the Inference of Gaussian Graphical Model in Biological Networks
• Ting Wang, Wei Chen
• Computer Science
PLoS Comput. Biol.
• 2016
This study proposes an efficient algorithm to implement the estimation of GGM and obtain p-value and confidence interval for each edge in the graph and applies it to two real data sets.
Dynamic mode decomposition of numerical and experimental data
• P. Schmid
• Physics, Engineering
Journal of Fluid Mechanics
• 2010
The description of coherent features of fluid flow is essential to our understanding of fluid-dynamical and transport processes. A method is introduced that is able to extract dynamic information
The Generalized Operator Based Prony Method
• Computer Science
• 2019
This paper shows how new sets of different sampling functionals can be applied with the goal to reduce the needed number of powers of the operator \$A\$ (resp.
Asymptotic analysis of a multiple frequency estimation method
• Mathematics
• 1993
A recently proposed method of multiple frequency estimation for mixed-spectrum time series is analyzed. The so-called PF method is a procedure that combines the autoregressive (AR) representation of
Graph-based approach for 3D human skeletal action recognition
• Computer Science
Pattern Recognit. Lett.
• 2017