Related references
Note: Only part of the references are listed.Improved Mixing Rates of Directed Cycles by Added Connection
Balazs Gerencser et al.
JOURNAL OF THEORETICAL PROBABILITY (2019)
Bounds on Lifting Continuous-State Markov Chains to Speed Up Mixing
Kavita Ramanan et al.
JOURNAL OF THEORETICAL PROBABILITY (2018)
Simulation of quantum walks and fast mixing with classical processes
Simon Apers et al.
PHYSICAL REVIEW A (2018)
LINEAR TIME AVERAGE CONSENSUS AND DISTRIBUTED OPTIMIZATION ON FIXED GRAPHS
Alex Olshevsky
SIAM JOURNAL ON CONTROL AND OPTIMIZATION (2017)
Accelerating Consensus by Spectral Clustering and Polynomial Filters
Simon Apers et al.
IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS (2017)
A PIECEWISE DETERMINISTIC SCALING LIMIT OF LIFTED METROPOLIS-HASTINGS IN THE CURIE WEISS MODEL
Joris Bierkens et al.
ANNALS OF APPLIED PROBABILITY (2017)
Non-reversible Metropolis-Hastings
Joris Bierkens
STATISTICS AND COMPUTING (2016)
Adding a Single State Memory Optimally Accelerates Symmetric Linear Maps
Alain Sarlette
IEEE TRANSACTIONS ON AUTOMATIC CONTROL (2016)
Improving the Convergence of Reversible Samplers
Luc Rey-Bellet et al.
JOURNAL OF STATISTICAL PHYSICS (2016)
Revisiting Finite-Time Distributed Algorithms via Successive Nulling of Eigenvalues
Sam Safavi et al.
IEEE SIGNAL PROCESSING LETTERS (2015)
Finite-Time Consensus Using Stochastic Matrices With Positive Diagonals
Julien M. Hendrickx et al.
IEEE TRANSACTIONS ON AUTOMATIC CONTROL (2015)
Positive contraction mappings for classical and quantum Schrodinger systems
Tryphon T. Georgiou et al.
JOURNAL OF MATHEMATICAL PHYSICS (2015)
Graph diameter, eigenvalues, and minimum-time consensus
Julien M. Hendrickx et al.
AUTOMATICA (2014)
Analysis of accelerated gossip algorithms
Ji Liu et al.
AUTOMATICA (2013)
Some things we've learned (about Markov chain Monte Carlo)
Persi Diaconis
BERNOULLI (2013)
Chebyshev Polynomials in Distributed Consensus Applications
Eduardo Montijano et al.
IEEE TRANSACTIONS ON SIGNAL PROCESSING (2013)
Non-backtracking Random Walk
Robert Fitzner et al.
JOURNAL OF STATISTICAL PHYSICS (2013)
A LOCAL CLUSTERING ALGORITHM FOR MASSIVE GRAPHS AND ITS APPLICATION TO NEARLY LINEAR TIME GRAPH PARTITIONING
Daniel A. Spielman et al.
SIAM JOURNAL ON COMPUTING (2013)
Irreversible Monte Carlo algorithms for efficient sampling
Konstantin S. Turitsyn et al.
PHYSICA D-NONLINEAR PHENOMENA (2011)
Markov chain mixing time on cycles
Balazs Gerencser
STOCHASTIC PROCESSES AND THEIR APPLICATIONS (2011)
Location-Aided Fast Distributed Consensus in Wireless Networks
Wenjun Li et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2010)
Distributed Averaging Via Lifted Markov Chains
Kyomin Jung et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2010)
Optimization and Analysis of Distributed Averaging With Short Node Memory
Boris N. Oreshkin et al.
IEEE TRANSACTIONS ON SIGNAL PROCESSING (2010)
Discrete-time classical and quantum Markovian evolutions: Maximum entropy problems on path space
Michele Pavon et al.
JOURNAL OF MATHEMATICAL PHYSICS (2010)
Polynomial Filtering for Fast Convergence in Distributed Consensus
Effrosyni Kokiopoulou et al.
IEEE TRANSACTIONS ON SIGNAL PROCESSING (2009)
FASTEST MIXING MARKOV CHAIN ON GRAPHS WITH SYMMETRIES
Stephen Boyd et al.
SIAM JOURNAL ON OPTIMIZATION (2009)
Non-backtracking random walks mix faster
Noga Alon et al.
COMMUNICATIONS IN CONTEMPORARY MATHEMATICS (2007)
Fastest mixing Markov chain on a graph
S Boyd et al.
SIAM REVIEW (2004)
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
M Jerrum et al.
JOURNAL OF THE ACM (2004)
Quantum random walks: an introductory overview
J Kempe
CONTEMPORARY PHYSICS (2003)
The art of data augmentation
DA van Dyk et al.
JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS (2001)
Share Paper
