John D. Cook
Skip to content
  • MATH
    • PROBABILITY
    • SIGNAL PROCESSING
    • NUMERICAL COMPUTING
    • SEE ALL …
  • STATS
    • EXPERT TESTIMONY
    • WEB ANALYTICS
    • FORECASTING
    • RNG TESTING
    • SEE ALL …
  • PRIVACY
    • HIPAA
    • SAFE HARBOR
    • CRYPTOGRAPHY
    • DIFFERENTIAL PRIVACY
    • PRIVACY FAQ
  • WRITING
    • BLOG
    • RSS FEED
    • TWITTER
    • SUBSTACK
    • ARTICLES
    • TECH NOTES
  • ABOUT
    • CLIENTS
    • ENDORSEMENTS
    • TEAM
    • SERVICES
(832) 422-8646
Contact

Ten spectral graph theory posts

Posted on 5 June 2016 by John

Erdős-Rényi graph

Here are 10 blog posts I wrote earlier this year about spectral graph theory, studying graphs via the eigenvalues of matrices associated with the graphs.

  • Measuring graph connectivity with eigenvalues
  • Graph regularity and Laplacian eigenvalues
  • Adding an edge increases eigenvalues
  • Spectral coordinates in Python
  • Bipartite graphs and the signless Lapacian
  • Spectra of random graphs
  • Can you hear the shape of a network?
  • Fourier transform of a function on a graph
  • Bounding a graph’s diameter by its spectrum
  • Spectra of complete graphs, stars, and rings

Categories : Math
Tags : Networks
Bookmark the permalink

Post navigation

Previous PostODE solver as a functional fold
Next PostGrateful for failures
John D. Cook

John D. Cook, PhD

My colleagues and I have decades of consulting experience helping companies solve complex problems involving data privacy, applied math, and statistics.

Let’s talk. We look forward to exploring the opportunity to help your company too.

John D. Cook

© All rights reserved.

(832) 422-8646

EMAIL