The Unreasonable Effectiveness of Spectral Graph Theory: A Confluence of Algorithms, Geometry & ...

Рет қаралды 45,399

Күн бұрын

James R. Lee, University of Washington
Simons Institute Open Lectures
simons.berkeley...
Full title: The Unreasonable Effectiveness of Spectral Graph Theory: A Confluence of Algorithms, Geometry, and Physics

Пікірлер: 20

@rbnn 8 жыл бұрын

Great talk. I wish I'd seen that motivation when I was studying this.

@fubiao9149 2 ай бұрын

how could one predict whether the system will reach some equilibrium state or frustrated state?

@AdamGenesisArt 3 жыл бұрын

Great video! sparked some ideas

@forheuristiclifeksh7836 4 ай бұрын

aleinunas kerp lipton lovasz rackoff RandomWalk <a href="#" class="seekto" data-time="1534">25:34</a>

@roholazandie3515 Жыл бұрын

this might be the best explanation on spectral graph theory on the internet!

@aidenkim6629 3 жыл бұрын

@Onezero675 8 жыл бұрын

great watch, thanks

@forheuristiclifeksh7836 4 ай бұрын

@shashankupadhyay4163 7 жыл бұрын

awesome

@columbus8myhw 3 жыл бұрын

Can I ask what the protest was about?

@thedeathstar420 4 жыл бұрын

Can I get a citation for the proof mentioned in <a href="#" class="seekto" data-time="1950">32:30</a>?

@astromcd 4 жыл бұрын

annals.math.princeton.edu/wp-content/uploads/annals-v175-n3-p08-s.pdf

@DinHamburg 8 жыл бұрын

what is the exact reason that the random walk was done on a torus and not on a square ?

@drewduncan5774 7 жыл бұрын

A square with opposite edges identified is a torus.

@MravojedNaTrotinetu 5 жыл бұрын

Probably because square grid is topologicaly noncompact and that it requires boundary conditions to be specified while setup on torus is topologycaly compact and does not require boundary conditions (reason why it's more generic than finite square grid).

@augblog 5 жыл бұрын

The grid on a torus is 4-regular.

@alfatti1603 4 жыл бұрын

Also note that the torus is topologically nontrivial ( genus-1 surface) which impacts the long term diffusion behaviour

@wayfinder105 4 жыл бұрын

Torii have the easiest boundary conditions to program probably (just have to write every coordinate modulo, no need to write any special cases).

@honkhonk8009 2 ай бұрын

when tf did my feed go from neo nazi shit to this. I fw it though, didn't know what a Laplacian was until now. Always hated graph theory back in Uni cus I thought it was shallow. I wonder why we weren't taught this stuff?