100 research outputs found
Directed polymers on a disordered tree with a defect subtree
We study the question of how the competition between
and a affects the macroscopic behavior
of a system in the directed polymer context at the free energy level. We
consider the directed polymer model on a disordered -ary tree and represent
the localized microscopic defect by modifying the disorder distribution at each
vertex in a single path (branch), or in a subtree, of the tree. The polymer
must choose between following the microscopic defect and finding the best
branches through the bulk disorder. We describe three possible phases, called
the and phases.
When the microscopic defect is associated only with a single branch, we compute
the free energy and the critical curve of the model, and show that the
partially pinned phase does not occur. When the localized microscopic defect is
associated with a non-disordered regular subtree of the disordered tree, the
picture is more complicated. We prove that all three phases are non-empty below
a critical temperature, and that the partially pinned phase disappears above
the critical temperature.Comment: 28 pages, 7 figures. Minor changes, one figure removed, references
adde
Quantitative bounds for Markov chain convergence: Wasserstein and total variation distances
We present a framework for obtaining explicit bounds on the rate of
convergence to equilibrium of a Markov chain on a general state space, with
respect to both total variation and Wasserstein distances. For Wasserstein
bounds, our main tool is Steinsaltz's convergence theorem for locally
contractive random dynamical systems. We describe practical methods for finding
Steinsaltz's "drift functions" that prove local contractivity. We then use the
idea of "one-shot coupling" to derive criteria that give bounds for total
variation distances in terms of Wasserstein distances. Our methods are applied
to two examples: a two-component Gibbs sampler for the Normal distribution and
a random logistic dynamical system.Comment: Published in at http://dx.doi.org/10.3150/09-BEJ238 the Bernoulli
(http://isi.cbs.nl/bernoulli/) by the International Statistical
Institute/Bernoulli Society (http://isi.cbs.nl/BS/bshome.htm
Stability of adversarial Markov chains, with an application to adaptive MCMC algorithms
We consider whether ergodic Markov chains with bounded step size remain
bounded in probability when their transitions are modified by an adversary on a
bounded subset. We provide counterexamples to show that the answer is no in
general, and prove theorems to show that the answer is yes under various
additional assumptions. We then use our results to prove convergence of various
adaptive Markov chain Monte Carlo algorithms.Comment: Published at http://dx.doi.org/10.1214/14-AAP1083 in the Annals of
Applied Probability (http://www.imstat.org/aap/) by the Institute of
Mathematical Statistics (http://www.imstat.org
- …