-
Notifications
You must be signed in to change notification settings - Fork 0
/
what-is-markov.html
28 lines (28 loc) · 1.53 KB
/
what-is-markov.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>Markov Chains</title>
<link rel="stylesheet" href="css/styles.css">
<link href="images/favicon.ico" rel="icon" type="image/x-icon" />
</head>
<body>
<h1>What Is A Markov Chain?</h1>
<img class="content-image" src="images/markov_chain.png"></img>
<p>A Markov Chain is a method of diagramming outcomes determined by chance. For example, on
any given day, the weather can either remain sunny or turn rainy; this is a two-element
Markov Chain. Other elements, such as wind or snow (heaven forbid), can be added as well,
but the probability of each occuring decreases with every additional outcome.</p>
<p>Markov Chains can be written like so:</p>
<code>[[0.5,0.5],[0.5,0.5]]</code>
<p>Above is an example of a 2-element Markov Chain, where every outcome (Point 1 remains at
Point 1 or moves to Point 2, and vice versa) has a 50% chance of occuring. </p>
<p><a href="http://setosa.io/ev/markov-chains/" target="_blank">Learn more about Markov Chains and make your own here!</a></p>
<p>Markov chains can be used to generate text by making one element for
every word. The markov chain used in our website is a markov chain with
an order of two, meaning it not only considers the previous word but the
word before that when picking the next word.</p>
<footer><b><a href="/">Back to Home</a></b</footer>
</body>
</html>