Fetching the paper…
Reading the bibliography…
One of the key challenges in the area of signal processing on graphs is to design dictionaries and transform methods to identify and exploit structure in signals on weighted graphs.
M. Abramowitz, I. Stegun, Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, tenth Edition, Dover, 1972
1972
Earlier work this paper cites.
K. E. Atkinson, An Introduction to Numerical Analysis, John Wiley & Sons, 1989
1989
Earlier work this paper cites.
A. K. Jain, F. Farrokhnia, Unsupervised texture segmentation using Gabor filters, Pattern Recognition 24 (12) (1991) 1167–1186
1991
Earlier work this paper cites.
F. R. K. Chung, S.-T. Yau, Eigenvalues of graphs and Sobolev inequalities, Combinatorics, Prob., and Comput. 4 (1) (1995) 11–26
1995
Earlier work this paper cites.
F. K. Chung, Spectral Graph Theory, Vol. 92 of the CBMS Regional Conference Series in Mathematics, AMS Bokstore, 1997
1997
Earlier work this paper cites.
P. Flandrin, Time-Frequency / Time-Scale Analysis, Academic Press, 1999
1999
Earlier work this paper cites.
G. Strang, The discrete cosine transform, SIAM Review 41 (1) (1999) 135–147
1999
Earlier work this paper cites.
M. Benzi, G. H. Golub, Bounds for the entries of matrix functions with applications to preconditioning, BIT 39 (1999) 417–438
1999
Earlier work this paper cites.
B. Metzger, P. Stollmann, Heat kernel estimates on weighted graphs, Bull. London Math. Soc. 32 (4) (2000) 477–483
2000
Earlier work this paper cites.
K. Gröchenig, Foundations of Time-Frequency Analysis, Birkhäuser, 2001
2001
Earlier work this paper cites.
O. Chapelle, B. Schölkopf, A. Zien (Eds.), Semi-Supervised Learning, MIT Press, 2006
2006
Earlier work this paper cites.
R. M. Gray, Toeplitz and Circulant Matrices: A Review, Now Publishers, 2006
2006
Earlier work this paper cites.
U. von Luxburg, A tutorial on spectral clustering, Stat. Comput. 17 (4) (2007) 395–416
2007
Cited alongside, same era.
R. Olfati-Saber, Algebraic connectivity ratio of Ramanujan graphs, in: Proc. Amer. Control Conf., New York, NY, 2007, pp. 4619–4624
2007
Cited alongside, same era.
J. Kovačević, A. Chebira, Life beyond bases: The advent of frames (part I), IEEE Signal Process. Mag. 24 (2007) 86–104
2007
Cited alongside, same era.
J. Kovačević, A. Chebira, Life beyond bases: The advent of frames (part II), IEEE Signal Process. Mag. 24 (2007) 115–125
2007
Cited alongside, same era.
M. Benzi, N. Razouk, Decay bounds and O ( n ) O(n) algorithms for approximating functions of sparse matrices, Elec. Trans. Numer. Anal. 28 (2007) 16–39
2007
Cited alongside, same era.
G. H. Golub, G. Meurant, Matrices, Moments and Quadrature with Applications, Princeton University Press, 2010
2010
Later among the works it cites.
Y. Dekel, J. R. Lee, N. Linial, Eigenvectors of random graphs: Nodal domains, Random Structures & Algorithms 39 (1) (2011) 39–58
2011
Later among the works it cites.
N. Saito, E. Woei, On the phase transition phenomenon of graph Laplacian eigenfunctions on trees, RIMS Kokyuroku 1743 (2011) 77–90
2011
Later among the works it cites.
D. K. Hammond, P. Vandergheynst, R. Gribonval, Wavelets on graphs via spectral graph theory, Appl. Comput. Harmon. Anal. 30 (2) (2011) 129–150
2011
Later among the works it cites.
A. Agaskar, Y. M. Lu, An uncertainty principle for functions defined on graphs, in: Proc. SPIE, Vol. 8138, San Diego, CA, 2011, pp. 81380T–1 – 81380T–11
2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. G. Mallat, A Wavelet Tour of Signal Processing, Academic Press, 2008
2008
Cited alongside, same era.
A. Elmoataz, O. Lezoray, S. Bougleux, Nonlocal discrete regularization on weighted graphs: a framework for image and manifold processing, IEEE Trans. Image Process. 17 (2008) 1047–1060
2008
Cited alongside, same era.
P. N. McGraw, M. Menzinger, Laplacian spectra as a diagnostic tool for network structure and dynamics, Phys. Rev. E 77 (3) (2008) 031102–1 – 031102–14
2008
Cited alongside, same era.
N. J. Higham, Functions of Matrices, Society for Industrial and Applied Mathematics, 2008
2008
Cited alongside, same era.
O. Christensen, Frames and Bases, Birkhäuser, 2008
2008
Cited alongside, same era.
R. Rubinstein, A. M. Bruckstein, M. Elad, Dictionaries for sparse representation modeling, Proc. IEEE 98 (6) (2010) 1045–1057
2010
Cited alongside, same era.
L. J. Grady, J. R. Polimeni, Discrete Calculus, Springer, 2010
2010
Cited alongside, same era.
P. L. Combettes, J.-C. Pesquet, Proximal splitting methods in signal processing, in: H. H. Bauschke, R. Burachik, P. L. Combettes, V. Elser, D. R. Luke, H. Wolkowicz (Eds.), Fixed-Point Algorithms for Inverse Problems in Science and Engineering, Springer-Verlag, 2011, pp. 185–212
2011
Later among the works it cites.
D. I Shuman, B. Ricaud, P. Vandergheynst, A windowed graph Fourier tranform, in: Proc. IEEE Stat. Signal Process. Wkshp., Ann Arbor, MI, 2012, pp. 133–136
2012
Later among the works it cites.
X. Zhu, M. Rabbat, Approximating signals supported on graphs, in: Proc. IEEE Int. Conf. Acc., Speech, and Signal Process., Kyoto, Japan, 2012, pp. 3921–3924
2012
Later among the works it cites.
I. Dumitriu, S. Pal, Sparse regular random graphs: Spectral density and eigenvectors, Ann. Probab. 40 (5) (2012) 2197–2235
2012
Later among the works it cites.
A. Agaskar, Y. M. Lu, Uncertainty principles for signals defined on graphs: Bounds and characterizations, in: Proc. IEEE Int. Conf. Acc., Speech, and Signal Process., Kyoto, Japan, 2012, pp. 3493–3496
2012
Later among the works it cites.
D. I Shuman, S. K. Narang, P. Frossard, A. Ortega, P. Vandergheynst, The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains, IEEE Signal Process. Mag. 30 (2013) 83–98
2013
Closest in time.
L. V. Tran, V. H. Vu, K. Wang, Sparse random graphs: Eigenvalues and eigenvectors, Random Struct. Algo. 42 (1) (2013) 110–134
2013
Closest in time.