Results 81 to 90 of about 111 (110)
Metastability of the Three Dimensional Ising Model on a Torus at Very Low Temperatures
, 1996 : We study the metastability of the stochastic three dimensional Ising model on a finite torus under a small positive magnetic field at very low temperatures. Keywords Ising, metastability, droplet, Freidlin--Wentzell theory, large deviations.
G. Ben Arous +3 more
core
Exact Mixing in an Unknown Markov Chain
, 1995 We give a simple stopping rule which will stop an unknown, irreducible n-state Markov chain at a state whose probability distribution is exactly the stationary distribution of the chain.
Peter Winkler, László Lovász
core
Extension of Fill's perfect rejection sampling algorithm to general chains (Extended Abstract)
, 1999 . We provide an extension of the perfect sampling algorithm of Fill (1998) to general chains, and describe how use of bounding processes can ease computational burden. Along the way, we unearth a simple connection between the Coupling From The Past (CFTP)
Motoya Machida +3 more
core
On The Structure of Stochastic Matrices with a Subdominant Eigenvalue Near 1
, 1998 An n × n irreducible stochastic matrix P can possess a subdominant eigenvalue, say # 2 (P), near # = 1. In this article we clarify the relationship between the nearness of these eigenvalues and the nearly uncoupling (some authors say "nearly ...
Carl D. Meyer, An N, D. J. Hartfiel
core
Numerically optimized Markovian coupling and mixing in one-dimensional maps
, 2007 Algorithms are introduced that produce optimal Markovian couplings for large finite-state-space discrete-time Markov chains with sparse transition matrices; these algorithms are applied to some toy models motivated by fluid-dynamical mixing problems at ...
P, D, Jansons, KMM
core
Stochastic Complementation, Uncoupling Markov Chains, And The Theory Of Nearly Reducible Systems
, 1989 . A concept called stochastic complementation is an idea which occurs naturally, although not always explicitly, in the theory and application of finite Markov chains.
C. D. Meyer
core
A Canonical Representation for Aggregated Markov Processes
, 1998 A deterministic function of a Markov process is called an aggregated Markov process. We give necessary and sufficient conditions for the equivalence of continuous-time aggregated Markov processes.
Bret Larget
core
Range and Speed of Rotor Walks on Trees. [PDF]
J Theor Probab, 2020 Huss W, Sava-Huss E.
europepmc +1 more source
Analysis of Algorithms for Listing Equivalence Classes of k-ary Strings
, 1996 We give efficient algorithms for listing equivalence classes of k-ary strings under reversal and permutation of alphabet symbols. As representative of each equivalence class we choose that string which is lexicographically smallest.
Frank Ruskey +2 more
core
Asymptotic Behavior of some Interactive Population Flow Models
, 2007 . The paper is concerned with Markov chain models for flows of a finite population among a set of groups, where the individuals base their decisions to which group to go next partially on the current frequency distribution (profile).
Wolfgang Stadje
core