2 papers indexed here
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
Computes the edge weights that make averaging, gossip or a random walk converge as fast as possible on a given graph — the fastest-mixing Markov chain problem (Boyd, Diaconis & Xiao 2004) and its free-weight variant FDLA (Xiao & Boyd 2004). Returns a sparse weight matrix together with a rigorous bound on the distance f...
Computes the edge weights that make averaging, gossip or a random walk converge as fast as possible on a given graph — the fastest-mixing Markov chain problem (Boyd, Diaconis & Xiao 2004) and its free-weight variant FDLA (Xiao & Boyd 2004). Returns a sparse weight matrix together with a rigorous bound on the distance f...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
