118 search results - page 11 / 24 » A phase transition in the random transposition random walk |
ALGORITHMICA
2007
15 years 17 days ago
2007
Two classic “phase transitions” in discrete mathematics are the emergence of a giant component in a random graph as the density of edges increases, and the transition of a rand...
119
Voted
APPROX
2006
Springer
15 years 4 months ago
2006
Springer
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...
98
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We prove that the Walksat algorithm from [16, 17] finds a satisfying assignment of Φ in pol...
CORR
2007
Springer
15 years 13 days ago
2007
Springer
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the s...
121
click to vote
INFOCOM
2011
IEEE
14 years 3 months ago
2011
IEEE
Abstract—Market-based mechanisms offer promising approaches for spectrum access in cognitive radio networks. In this paper, we focus on two market models, one with a monopoly pri...