Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
IMC
2010
ACM
11 years 3 months ago
Measuring the mixing time of social graphs
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
Abedelaziz Mohaisen, Aaram Yun, Yongdae Kim
SODA
2004
ACM
111views Algorithms» more  SODA 2004»
11 years 6 months ago
Fast mixing for independent sets, colorings and other models on trees
We study the mixing time of the Glauber dynamics for general spin systems on bounded-degree trees, including the Ising model, the hard-core model (independent sets) and the antife...
Fabio Martinelli, Alistair Sinclair, Dror Weitz
SODA
2008
ACM
135views Algorithms» more  SODA 2008»
11 years 7 months ago
Rapid mixing of Gibbs sampling on graphs that are sparse on average
Gibbs sampling also known as Glauber dynamics is a popular technique for sampling high dimensional distributions defined on graphs. Of special interest is the behavior of Gibbs sa...
Elchanan Mossel, Allan Sly
FOCS
2004
IEEE
11 years 9 months ago
Shuffling by Semi-Random Transpositions
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...
Elchanan Mossel, Yuval Peres, Alistair Sinclair
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
11 years 9 months ago
Robust Mixing
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
Murali K. Ganapathy
ISAAC
2003
Springer
129views Algorithms» more  ISAAC 2003»
11 years 10 months ago
Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution
Abstract. In this paper, we propose a Markov chain for sampling a random vector distributed according to a discretized Dirichlet distribution. We show that our Markov chain is rapi...
Tomomi Matsui, Mitsuo Motoki, Naoyuki Kamatani
FOCS
2006
IEEE
11 years 11 months ago
A simple condition implying rapid mixing of single-site dynamics on spin systems
Spin systems are a general way to describe local interactions between nodes in a graph. In statistical mechanics, spin systems are often used as a model for physical systems. In c...
Thomas P. Hayes
FOCS
2007
IEEE
11 years 12 months ago
Mixing Time Power Laws at Criticality
We study the mixing time of some Markov Chains converging to critical physical models. These models are indexed by a parameter β and there exists some critical value βc where th...
Yun Long, Asaf Nachmias, Yuval Peres
STOC
2009
ACM
137views Algorithms» more  STOC 2009»
12 years 6 months ago
Mixing time for the solid-on-solid model
We analyze the mixing time of a natural local Markov chain (the Glauber dynamics) on configurations of the solid-onsolid model of statistical physics. This model has been proposed...
Fabio Martinelli, Alistair Sinclair
books