Fetching the paper…
Reading the bibliography…
We consider the problem of designing spectral graph filters for the construction of dictionaries of atoms that can be used to efficiently represent signals residing on weighted graphs.
P. Erdős and A. Rényi, “On random graphs,” Publ. Math. Debrecen , vol. 6, pp. 290–297, 1959
1959
Earlier work this paper cites.
F. J. Harris, “On the use of windows for harmonic analysis with the discrete Fourier transform,” Proc. of the IEEE , vol. 66, no. 1, pp. 51–83, 1978
1978
Earlier work this paper cites.
F. N. Fritsch and R. E. Carlson, “Monotone piecewise cubic interpolation,” SIAM J. Numer. Anal. , vol. 17, no. 2, pp. 238–246, Apr. 1980
1980
Earlier work this paper cites.
A. Nuttall, “Some windows with very good sidelobe behavior,” IEEE Trans. Acoustics, Speech, Signal Process. , vol. 29, no. 1, pp. 84–91, 1981
1981
Earlier work this paper cites.
B. D. McKay, “The expected eigenvalue distribution of a large regular graph,” Lin. Alg. Appl. , vol. 40, pp. 203–216, Oct. 1981
1981
Earlier work this paper cites.
W. N. Anderson and T. D. Morley, “Eigenvalues of the Laplacian of a graph,” Linear Multilinear Algebra , vol. 18, no. 2, pp. 141–145, 1985
1985
Earlier work this paper cites.
D. V. Voiculescu, K. J. Dykema, and A. Nica, Free Random Variables . Vol. 1 of the CRM Monograph Series, American Mathematical Society, 1992
1992
Earlier work this paper cites.
B. N. Parlett, The Symmetric Eigenvalue Problem . SIAM, 1998
1998
Earlier work this paper cites.
A. B. J. Kuijlaars, “Which eigenvalues are found by the Lanczos method?” SIAM J. Matrix Anal. Appl. , vol. 22, no. 1, pp. 306–321, Jun. 2000
2000
Earlier work this paper cites.
B. Bollobás, Random Graphs . Cambridge University Press, 2001
2001
Earlier work this paper cites.
M. Crovella and E. Kolaczyk, “Graph wavelets for spatial traffic analysis,” in Proc. IEEE INFOCOM , vol. 3, Mar. 2003, pp. 1848–1857
2003
Earlier work this paper cites.
F. Chung, L. Lu, and V. Vu, “Spectra of random graphs with given expected degrees,” Proc. Natl. Acad. Sci. , vol. 100, no. 11, pp. 6313–6318, May 2003
2003
Earlier work this paper cites.
J. A. Tropp, “Greed is good: Algorithmic results for sparse approximation,” IEEE. Trans. Inform. Theory , vol. 50, no. 10, pp. 2231–2242, Oct. 2004
2004
Earlier work this paper cites.
T. A. Davis, “Algorithm 849: A concise sparse Cholesky factorization package,” ACM Trans. Mathem. Software , vol. 31, no. 4, pp. 587–591, Dec. 2005
2005
Cited alongside, same era.
R. R. Coifman and M. Maggioni, “Diffusion wavelets,” Appl. Comput. Harmon. Anal. , vol. 21, no. 1, pp. 53–94, 2006
2006
Cited alongside, same era.
F. Chung and L. Lu, Complex Graphs and Networks . Vol. 107 of the CBMS Regional Conference Series in Mathematics, American Mathematical Society, 2006
2006
Cited alongside, same era.
J. Kovačević and A. Chebira, “Life beyond bases: The advent of frames (part I),” IEEE Signal Process. Mag. , vol. 24, no. 4, pp. 86–104, Jul. 2007
2007
Cited alongside, same era.
——, “Life beyond bases: The advent of frames (part II),” IEEE Signal Process. Mag. , vol. 24, no. 5, pp. 115–125, Sep. 2007
2007
Cited alongside, same era.
D. I Shuman, P. Vandergheynst, and P. Frossard, “Chebyshev polynomial approximation for distributed signal processing,” in Proc. Int. Conf. Distr. Comput. Sensor Sys. , Barcelona, Spain, Jun. 2011
2011
Later among the works it cites.
P. Van Mieghem, Graph Spectra for Complex Networks . Cambridge University Press, 2011
2011
Later among the works it cites.
D. I Shuman, B. Ricaud, and P. Vandergheynst, “A windowed graph Fourier tranform,” in Proc. IEEE Stat. Signal Process. Wkshp. , Ann Arbor, MI, Aug. 2012, pp. 133–136
2012
Later among the works it cites.
X. Zhang, X. Dong, and P. Frossard, “Learning of structured graph dictionaries,” in Proc. IEEE Int. Conf. Acc., Speech, and Signal Process. , Kyoto, Japan, Mar. 2012, pp. 3373–3376
2012
Later among the works it cites.
T. Tao, Topics in Random Matrix Theory . American Mathematical Society, 2012
2012
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
I. S. Gradshteyn and I. M. Ryzhik, Table of Integrals, Series, and Products, Seventh Edition . Elsevier, 2007
2007
Cited alongside, same era.
2007
Cited alongside, same era.
O. Christensen, Frames and Bases . Birkhäuser, 2008
2008
Cited alongside, same era.
X. Ding and T. Jiang, “Spectral distributions of adjacency and Laplacian matrices of random graphs,” Ann. Appl. Probab. , vol. 20, no. 6, pp. 2086–2117, Nov. 2010
2010
Cited alongside, same era.
D. K. Hammond, P. Vandergheynst, and R. Gribonval, “Wavelets on graphs via spectral graph theory,” Appl. Comput. Harmon. Anal. , vol. 30, no. 2, pp. 129–150, Mar. 2011
2011
Cited alongside, same era.
N. Leonardi and D. Van De Ville, “Wavelet frames on graphs defined by FMRI functional connectivity,” in Proc. IEEE Int. Symp. Biomed. Imag. , Chicago, IL, Mar. 2011, pp. 2136–2139
2011
Cited alongside, same era.
P. L. Combettes and J.-C. Pesquet, “Proximal splitting methods in signal processing,” in Fixed-Point Algorithms for Inverse Problems in Science and Engineering , H. H. Bauschke, R. Burachik, P. L. Combettes, V. Elser, D. R. Luke, and H. Wolkowicz, Eds. Springer-Verlag, 2011, pp. 185–212
2011
Cited alongside, same era.
Later among the works it cites.
S. Olver and R. R. Nadakuditi, “Numerical computation of convolutions in free probability theory,” arXiv Preprints , Mar. 2012
2012
Later among the works it cites.
T. Jiang, “Empirical distributions of Laplacian matrices of large dilute graphs,” Random Matrices: Theory Appl. , vol. 1, no. 3, p. 1250004, Jul. 2012
2012
Later among the works it cites.
D. I Shuman, S. K. Narang, P. Frossard, A. Ortega, and 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. , vol. 30, no. 3, pp. 83–98, May 2013
2013
Closest in time.
——, “Vertex-frequency analysis on graphs,” ArXiv e-prints , Jul. 2013
2013
Closest in time.
——, “Tight wavelet frames on multislice graphs,” IEEE Trans. Signal Process. , vol. 61, no. 13, pp. 3357–3367, Jul. 2013
2013
Closest in time.
D. Thanou, D. I Shuman, and P. Frossard, “Parametric dictionary learning for graph signals,” in Proc. IEEE Glob. Conf. Signal and Inform. Process. , Austin, TX, Dec. 2013
2013
Closest in time.
O. Christensen and S. S. Goh, “From dual pairs of Gabor frames to dual pairs of wavelet frames,” Appl. Comput. Harmon. Anal. , Apr. 2013
2013
Closest in time.