65 search results - page 2 / 13 » Mixing Time of Exponential Random Graphs |
CP
2004
Springer
13 years 10 months ago
2004
Springer
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
EMMCVPR
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. This paper presents a Bayesian inference algorithm for image layer representation [26], 2.1D sketch [6], with mixed Markov random field. 2.1D sketch is an very important...
ISTCS
1993
Springer
13 years 9 months ago
1993
Springer
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and distinct sets of edges, each of which has a color. A par...
STOC
1997
ACM
13 years 9 months ago
1997
ACM
The Swendsen-Wang process provides one possible dynamics for the Qstate Potts model in statistical physics. Computer simulations of this process are widely used to estimate the ex...
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
We show that no Markovian Coupling argument can prove rapid mixing of the Jerrum-Sinclair Markov chain for sampling almost uniformly from the set of perfect and near perfect match...