Home /  Workshop /  Schedules /  Fastest mixing Markov chain on a graph

Fastest mixing Markov chain on a graph

Semidefinite Programming and Applications October 07, 2002 - October 11, 2002

October 07, 2002 (09:15 AM PDT - 10:15 AM PDT)
Speaker(s): Stephen Boyd (Stanford University)
Location: SLMath: Eisenbud Auditorium
Primary Mathematics Subject Classification No Primary AMS MSC
Secondary Mathematics Subject Classification No Secondary AMS MSC
Video

241-1455-Fastest mixing Markov chain on a graph-Stephen P. Boyd
Abstract No Abstract Uploaded
Supplements
Asset no preview boyd.pdf 99.6 KB application/pdf Download
Video/Audio Files

241-1455-Fastest mixing Markov chain on a graph-Stephen P. Boyd

H.264 Video 241-1455-Fastest_mixing_Markov_chain_on_a_graph-Stephen_P._Boyd.mp4 65.3 MB video/mp4 Download
241-1455-Fastest_mixing_Markov_chain_on_a_graph-Stephen_P._Boyd.rm 23.7 MB application/vnd.rn-realmedia Download
Troubles with video?

Please report video problems to itsupport@slmath.org.

See more of our Streaming videos on our main VMath Videos page.