Skip to main content
SpringerLink
Log in

Graph Signal Processing for Directed Graphs Based on the Hermitian Laplacian

  • Conference paper
  • First Online:
Machine Learning and Knowledge Discovery in Databases (ECML PKDD 2019)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11906))

Abstract

Graph signal processing is a useful tool for representing, analyzing, and processing the signal lying on a graph, and has attracted attention in several fields including data mining and machine learning. A key to construct the graph signal processing is the graph Fourier transform, which is defined by using eigenvectors of the graph Laplacian of an undirected graph. The orthonormality of eigenvectors gives the graph Fourier transform algebraically desirable properties, and thus the graph signal processing for undirected graphs has been well developed. However, since eigenvectors of the graph Laplacian of a directed graph are generally not orthonormal, it is difficult to simply extend the graph signal processing to directed graphs. In this paper, we present a general framework for extending the graph signal processing to directed graphs. To this end, we introduce the Hermitian Laplacian which is a complex matrix obtained from an extension of the graph Laplacian. The Hermitian Laplacian is defined so as to preserve the edge directionality and Hermitian property and enables the graph signal processing to be straightforwardly extended to directed graphs. Furthermore, the Hermitian Laplacian guarantees some desirable properties, such as non-negative real eigenvalues and the unitarity of the Fourier transform. Finally, experimental results for representation learning and signal denoising of/on directed graphs show the effectiveness of our framework.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Latitude and temperature data are respectively obtained from following web sites: https://inkplant.com/code/state-latitudes-longitudes and https://www.currentresults.com/Weather/US/average-annual-state-temperatures.php.

References

  1. Anis, A., El Gamal, A., Avestimehr, S., Ortega, A.: Asymptotic justification of bandlimited interpolation of graph signals for semi-supervised learning. In: 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 5461–5465. IEEE (2015)

    Google Scholar 

  2. Berkolaiko, G.: Nodal count of graph eigenfunctions via magnetic perturbation. Anal. PDE 6(5), 1213–1233 (2013)

    Article  MathSciNet  Google Scholar 

  3. Bronstein, M.M., Bruna, J., LeCun, Y., Szlam, A., Vandergheynst, P.: Geometric deep learning: going beyond Euclidean data. IEEE Signal Process. Mag. 34(4), 18–42 (2017)

    Article  Google Scholar 

  4. Chen, S., Varma, R., Sandryhaila, A., Kovačević, J.: Discrete signal processing on graphs: sampling theory. IEEE Trans. Signal Process. 63(24), 6510–6523 (2015)

    Article  MathSciNet  Google Scholar 

  5. Chung, F.: Laplacians and the cheeger inequality for directed graphs. Ann. Comb. 9(1), 1–19 (2005). https://doi.org/10.1007/s00026-005-0237-z

    Article  MathSciNet  MATH  Google Scholar 

  6. Defferrard, M., Bresson, X., Vandergheynst, P.: Convolutional neural networks on graphs with fast localized spectral filtering. In: Advances in Neural Information Processing Systems, pp. 3844–3852 (2016)

    Google Scholar 

  7. Dodziuk, J., Mathai, V.: Kato’s inequality and asymptotic spectral properties for discrete magnetic Laplacians. In: Contemporary Mathematics, vol. 398, pp. 69–81 (2006)

    Google Scholar 

  8. Donnat, C., Zitnik, M., Hallac, D., Leskovec, J.: Spectral graph wavelets for structural role similarity in networks. arXiv preprint arXiv:1710.10321 (2017)

  9. Fanuel, M., Alaíz, C.M., Fernández, Á., Suykens, J.A.: Magnetic eigenmaps for the visualization of directed networks. Appl. Comput. Harmonic Anal. 44(1), 189–199 (2018)

    Article  MathSciNet  Google Scholar 

  10. Fanuel, M., Alaíz, C.M., Suykens, J.A.: Magnetic eigenmaps for community detection in directed networks. Phys. Rev. E 95(2), 022302 (2017)

    Article  MathSciNet  Google Scholar 

  11. Gadde, A., Anis, A., Ortega, A.: Active semi-supervised learning using sampling theory for graph signals. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 492–501 (2014)

    Google Scholar 

  12. Golub, G.H., Wilkinson, J.H.: Ill-conditioned eigensystems and the computation of the Jordan canonical form. SIAM Rev. 18(4), 578–619 (1976)

    Article  MathSciNet  Google Scholar 

  13. Hammond, D.K., Vandergheynst, P., Gribonval, R.: Wavelets on graphs via spectral graph theory. Appl. Comput. Harmonic Anal. 30(2), 129–150 (2011)

    Article  MathSciNet  Google Scholar 

  14. Higuchi, Y., Shirai, T.: A remark on the spectrum of magnetic Laplacian on a graph. Yokohama Math. J. 47 (1999)

    Google Scholar 

  15. Kato, T.: Schrödinger operators with singular potentials. Israel J. Math. 13(1–2), 135–148 (1972). https://doi.org/10.1007/BF02760233

    Article  MathSciNet  Google Scholar 

  16. Masoumi, M., Hamza, A.B.: Shape classification using spectral graph wavelets. Appl. Intell. 47(4), 1256–1269 (2017). https://doi.org/10.1007/s10489-017-0955-7

    Article  Google Scholar 

  17. Messias, B., Costa, L.d.F.: Characterization and space embedding of directed graphs trough magnetic Laplacians. arXiv preprint arXiv:1812.02160 (2018)

  18. Narang, S.K., Ortega, A.: Perfect reconstruction two-channel wavelet filter banks for graph structured data. IEEE Trans. Signal Process. 60(6), 2786–2799 (2012)

    Article  MathSciNet  Google Scholar 

  19. Narang, S.K., Ortega, A.: Compact support biorthogonal wavelet filterbanks for arbitrary undirected graphs. IEEE Trans. Signal Process. 61(19), 4673–4685 (2013)

    Article  MathSciNet  Google Scholar 

  20. Ngo, K.V.: An approach of eigenvalue perturbation theory. Appl. Numer. Anal. Comput. Math. 2(1), 108–125 (2005)

    Article  MathSciNet  Google Scholar 

  21. Puschel, M., Moura, J.M.: Algebraic signal processing theory: foundation and 1-D time. IEEE Trans. Signal Process. 56(8), 3572–3585 (2008)

    Article  MathSciNet  Google Scholar 

  22. Sakiyama, A., Namiki, T., Tanaka, Y.: Design of polynomial approximated filters for signals on directed graphs. In: 2017 IEEE Global Conference on Signal and Information Processing (GlobalSIP), pp. 633–637. IEEE (2017)

    Google Scholar 

  23. Sandryhaila, A., Moura, J.M.: Discrete signal processing on graphs. IEEE Trans. Signal Process. 61(7), 1644–1656 (2013)

    Article  MathSciNet  Google Scholar 

  24. Sandryhaila, A., Moura, J.M.: Discrete signal processing on graphs: frequency analysis. IEEE Trans. Signal Process. 62(12), 3042–3054 (2014)

    Article  MathSciNet  Google Scholar 

  25. Sardellitti, S., Barbarossa, S., Di Lorenzo, P.: On the graph Fourier transform for directed graphs. IEEE J. Sel. Top. Sig. Process. 11(6), 796–811 (2017)

    Article  Google Scholar 

  26. Sevi, H., Rilling, G., Borgnat, P.: Multiresolution analysis of functions on directed networks. In: Wavelets and Sparsity XVII, vol. 10394, p. 103941Q. International Society for Optics and Photonics (2017)

    Google Scholar 

  27. Sevi, H., Rilling, G., Borgnat, P.: Harmonic analysis on directed graphs and applications: from Fourier analysis to wavelets. arXiv preprint arXiv:1811.11636 (2018)

  28. Shafipour, R., Khodabakhsh, A., Mateos, G., Nikolova, E.: A directed graph Fourier transform with spread frequency components. arXiv preprint arXiv:1804.03000 (2018)

  29. Shuman, D.I., Narang, S.K., Frossard, P., Ortega, A., Vandergheynst, P.: The emerging field of signal processing on graphs: extending high-dimensional data analysis to networks and other irregular domains. IEEE Signal Process. Mag. 30(3), 83–98 (2013)

    Article  Google Scholar 

  30. Shuman, D.I., Ricaud, B., Vandergheynst, P.: Vertex-frequency analysis on graphs. Appl. Comput. Harmonic Anal. 40(2), 260–291 (2016)

    Article  MathSciNet  Google Scholar 

  31. Singh, R., Chakraborty, A., Manoj, B.: Graph Fourier transform based on directed Laplacian. In: 2016 International Conference on Signal Processing and Communications (SPCOM), pp. 1–5. IEEE (2016)

    Google Scholar 

  32. Tanaka, Y.: Spectral domain sampling of graph signals. IEEE Trans. Signal Process. 66(14), 3752–3767 (2018)

    Article  MathSciNet  Google Scholar 

  33. Tremblay, N., Borgnat, P.: Graph wavelets for multiscale community mining. IEEE Trans. Signal Process. 62(20), 5227–5239 (2014)

    Article  MathSciNet  Google Scholar 

  34. de Verdière, Y.C.: Magnetic interpretation of the nodal defect on graphs. Anal. PDE 6(5), 1235–1242 (2013)

    Article  MathSciNet  Google Scholar 

  35. Verma, S., Zhang, Z.L.: Hunt for the unique, stable, sparse and fast feature learning on graphs. In: Advances in Neural Information Processing Systems, pp. 88–98 (2017)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. NTT Secure Platform Laboratories, Tokyo, Japan

    Satoshi Furutani, Toshiki Shibahara, Mitsuaki Akiyama & Kunio Hato

  2. Tokyo Metropolitan University, Tokyo, Japan

    Masaki Aida

Authors
  1. Satoshi Furutani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Toshiki Shibahara
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mitsuaki Akiyama
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Kunio Hato
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Masaki Aida
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Satoshi Furutani .

Editor information

Editors and Affiliations

  1. Leuphana University, Lüneburg, Germany

    Ulf Brefeld

  2. IRISA/Inria, Rennes, France

    Elisa Fromont

  3. University of Würzburg, Würzburg, Germany

    Andreas Hotho

  4. Leiden University, Leiden, The Netherlands

    Arno Knobbe

  5. ETH Zurich, Zurich, Switzerland

    Marloes Maathuis

  6. Institut National des Sciences Appliquées, Villeurbanne, France

    Céline Robardet

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Furutani, S., Shibahara, T., Akiyama, M., Hato, K., Aida, M. (2020). Graph Signal Processing for Directed Graphs Based on the Hermitian Laplacian. In: Brefeld, U., Fromont, E., Hotho, A., Knobbe, A., Maathuis, M., Robardet, C. (eds) Machine Learning and Knowledge Discovery in Databases. ECML PKDD 2019. Lecture Notes in Computer Science(), vol 11906. Springer, Cham. https://doi.org/10.1007/978-3-030-46150-8_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-46150-8_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-46149-2

  • Online ISBN: 978-3-030-46150-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Societies and partnerships

Search

Navigation