Results 201 to 210 of about 3,741,395 (255)
Some of the next articles are maybe not open access.
2006
Motivated by the computational difficulty of analyzing very large Markov chains, we define a notion of clusters in (not necessarily reversible) Markov chains, and explore the possibility of analyzing a cluster “in vitro,” without regard to the remainder of the chain.
Nir Ailon, Steve Chien, Cynthia Dwork
openaire +1 more source
Motivated by the computational difficulty of analyzing very large Markov chains, we define a notion of clusters in (not necessarily reversible) Markov chains, and explore the possibility of analyzing a cluster “in vitro,” without regard to the remainder of the chain.
Nir Ailon, Steve Chien, Cynthia Dwork
openaire +1 more source
On sampling with Markov chains
Random Structures and Algorithms, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fan R. K. Chung +2 more
openaire +3 more sources
Markov chains and embedded Markov chains in geology
Journal of the International Association for Mathematical Geology, 1969Geological data are structured as first-order, discrete-state discrete-time Markov chains in two main ways. In one, observations are spaced equally in time or space to yield transition probability matrices with nonzero elements in the main diagonal; in the other, only state transitions are recorded, to yield matrices with diagonal elements exactly ...
W. C. Krumbein, Michael F. Dacey
openaire +1 more source
The SAGE Encyclopedia of Research Design, 2022
T. Tomé, Mário J. de Oliveira
semanticscholar +1 more source
T. Tomé, Mário J. de Oliveira
semanticscholar +1 more source
Theory of Probability & Its Applications, 1961
This paper discusses some new results related to ergodic and limit theorems and also to the repeated logarithm low for inhomogeneous Markov chains. Theorems are formulated and proved for conditions that were not treated in the literature; some estimates obtained previously by S. N. Bernshtein are employed.Lemma 1 is of greatest importance in the paper.
openaire +2 more sources
This paper discusses some new results related to ergodic and limit theorems and also to the repeated logarithm low for inhomogeneous Markov chains. Theorems are formulated and proved for conditions that were not treated in the literature; some estimates obtained previously by S. N. Bernshtein are employed.Lemma 1 is of greatest importance in the paper.
openaire +2 more sources
The Markov chain of colourings
1995The Markov chain of good (proper) colourings of an n-vertex graph starts with an n-colouring and converges to a uniform distribution over all proper colourings with at most n colours. We study theoretically and experimentally the behaviour of this chain and concentrate in particular on a quantity μ which is the mean number of colours used in the ...
J. Eric Bartels, Dominic Welsh
openaire +1 more source
Markov Chains and Stochastic Stability
Communications and Control Engineering Series, 1993S. Meyn, R. Tweedie
semanticscholar +1 more source
Monte Carlo Sampling Methods Using Markov Chains and Their Applications
, 1970W. K. Hastings
semanticscholar +1 more source
Annals of Mathematics and Artificial Intelligence, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources