** Georgi Markov, Bulgarian dissident ( b. 1929 )

** Hidden Markov model

** Examples of Markov chains

** Zorn's lemma: Every non-empty partially ordered set in which every chain ( i. e. totally ordered subset ) has an upper bound contains at least one maximal element.

** Medium chain acylCoA dehydrogenase deficiency ( MCAD )

** Pipeline ( software ), a chain of processes or other data processing entities

** Pipeline ( software ), a chain of data-processing processes or other software entities

** Phospholipase A1-cleaves the SN-1 acyl chain.

** Phospholipase A2-cleaves the SN-2 acyl chain, releasing arachidonic acid.

** 100. fermium, Fm, named after Enrico Fermi, the physicist who produced the first controlled chain reaction ( 1952 ).

** Hands Across America: At least 5, 000, 000 people form a human chain from New York City to Long Beach, California, to raise money to fight hunger and homelessness.

** Two million indigenous people of Estonia, Latvia and Lithuania, then still occupied by the Soviet Union, join hands to demand freedom and independence, forming an uninterrupted 600 km human chain called the Baltic Way.

** Marcus Loew, Theater chain founder ( b. 1870 )

** Heavy chain diseases

** Hilton Hotels, an international chain of hotels trademarked by Hilton Worldwide

** Hilton Garden Inn, a chain of hotels trademarked by Hilton Worldwide

** Homewood Suites by Hilton, a chain of hotels trademarked by Hilton Worldwide

** Home2 Suites by Hilton, a new chain of hotels trademarked by Hilton Worldwide

** The proton-proton chain

** F. W. Woolworth Ireland, retail chain that operated in Northern Ireland and the Republic of Ireland from 1914 until 1984

** Woolworths Group, former operator of the Woolworths chain of shops in the UK ( originally part of the F. W.

** Woolworth GmbH, the owner of the Woolworths chain of high street shops in Germany and Austria

** Woolworths ( supermarket ), a chain of supermarkets in Australia owned by Woolworths Limited

** Woolworths Supermarkets ( New Zealand ), a New Zealand chain of supermarkets originally spun off from the Australian Woolworths Limited, and now again under ownership of Woolworths Limited

** supply chain

or 15. D9 * 16. G11 * 17. G12 * 18. E5 * 19. i11 * 20. i8 21. H9 * 22. G9 * 23. D4 * 24. C4 * 25. J8 * 26. J6 ** 27. F7 trying to draw 28. J7 black must not remove his i8 / J6 link yet 29. L5 * now black can play at i5, remove the i8 / J6 link, and add the chain of three links H8 / J7 / i5 / K4.

** chain: intercept referrals and chain them instead ; code is part of back-ldap

* In analysis of Markov chain Monte Carlo data, autocorrelation must be taken into account for correct error determination.

In most cases, the computation is intractable, but good approximations can be obtained using Markov chain Monte Carlo methods.

In the 1980s, there was a dramatic growth in research and applications of Bayesian methods, mostly attributed to the discovery of Markov chain Monte Carlo methods, which removed many of the computational problems, and an increasing interest in nonstandard, complex applications.

Taken together, the two define a Markov chain ( MC ).

A famous paper by mathematician and magician Persi Diaconis and mathematician Dave Bayer on the number of shuffles needed to randomize a deck concluded that the deck did not start to become random until five good riffle shuffles, and was truly random after seven, in the precise sense of variation distance described in Markov chain mixing time ; of course, you would need more shuffles if your shuffling technique is poor.

* Markov chain Monte Carlo

Optimized Markov chain algorithms which use local searching heuristic sub-algorithms can find a route extremely close to the optimal route for 700 to 800 cities.

The key Discordian practice known as " Operation Mindfuck " is exemplified in the character of Markoff Chaney ( a play on the mathematical random process called Markov chain ).

Any version of Snakes and Ladders can be represented exactly as an absorbing Markov chain, since from any square the odds of moving to any other square are fixed and independent of any previous game history.

It is based on a Markov chain with two states G ( for good or gap ) and B ( for bad or burst ).

This was used then as a counter-example to the idea that the human speech engine was based upon statistical models, such as a Markov chain, or simple statistics of words following others.

In the simple case of discrete time, a stochastic process amounts to a sequence of random variables known as a time series ( for example, see Markov chain ).

In the 1980s, there was a dramatic growth in research and applications of Bayesian methods, mostly attributed to the discovery of Markov chain Monte Carlo methods, which removed many of the computational problems, and an increasing interest in nonstandard, complex applications.

* Mathematical notes on Bayesian statistics and Markov chain Monte Carlo

Queueing systems use a particular form of state equations known as a Markov chain that models the system in each state.

* Markov chain geostatistics

In statistics and in statistical physics, the Metropolis – Hastings algorithm is a Markov chain Monte Carlo ( MCMC ) method for obtaining a sequence of random samples from a probability distribution for which direct sampling is difficult.

The general idea of the algorithm is to generate a series of samples that are linked in a Markov chain ( where each sample is correlated only with the directly preceding sample ).

Too large or too small a jumping size will lead to a slow-mixing Markov chain, i. e. a highly correlated set of samples, so that a very large number of samples will be needed to get a reasonable estimate of any desired property of the distribution.

* Although the Markov chain eventually converges to the desired distribution, the initial samples may follow a very different distribution, especially if the starting point is in a region of low density.

The Markov chain is started from an arbitrary initial value and the algorithm is run for many iterations until this initial state is " forgotten ".

The result of three Markov chain s running on the 3D Rosenbrock function using the Metropolis-Hastings algorithm.

Category: Markov chain Monte Carlo

For example, a collection of walkers in a Markov chain Monte Carlo iteration is called an ensemble in some literature.

A simple two-state Markov chain