(50 pts.) Markov Chains Markov chains are a mathematical model of stochastic processes where random decisions...
Fantastic news! We've Found the answer you've been seeking!
Question:
Transcribed Image Text:
(50 pts.) Markov Chains Markov chains are a mathematical model of stochastic processes where random decisions are made at suc- cessive time steps, each depending only on the current state of the system and not its past history. They are used in a huge variety of applications, both in computer science (natural language processing, compression, queueing theory) and other fields including physics, biology, economics, chemistry, you name it (they are the basis of so-called Markov chain Monte Carlo algorithms universally used in the sciences to estimate the best model parameters matching observed data). Formally, a Markov chain is a directed graph M whose vertices are the set S of possible states (with a des- ignated start state so), and whose edges indicate the possible random choices: for each state s, the outgoing edges have weights which sum to 1 (self-loops being allowed), and the probability of following a particular edge is its weight. For example: 1/2 SO 1/4 $1 1/4 1 $2 2/3 $3 1/3 1 If we take a random walk in a Markov chain for k steps starting from so, then every possible path has a probability given by multiplying all of the weights of the edges along the path: for instance, in our example above, the path (so, S0, S1,S3,S2) has probability (1/2). (1/4). (1)-(2/3)=1/12. One basic question about Markov chains is the following: given a Markov chain M, a start state so S, and an ending state g = S, what is the most likely path to take from so to g? Describe an efficient algorithm to solve this problem. (Hint: If the probability of a path were the sum of the weights instead of the product, this would look like a problem you've seen before. Can you transform the weights so that maximizing their sum is equivalent to maximizing the product of the original weights?) The time it takes an individual popcorn kernel to pop conforms to a normal distribution very closely. Assume that the mean time to popping is 165.0 seconds with a standard deviation of 92.1 seconds. What is the probability that a kernel of popcorn would take longer than 200 seconds to pop? Give your answer to five decimal places. Use Statistical Table B. probability: What is the probability that a kernel of popcorn would pop in less than 120 seconds? Give your answer to five decimal places. Use Statistical Table B. probability: (50 pts.) Markov Chains Markov chains are a mathematical model of stochastic processes where random decisions are made at suc- cessive time steps, each depending only on the current state of the system and not its past history. They are used in a huge variety of applications, both in computer science (natural language processing, compression, queueing theory) and other fields including physics, biology, economics, chemistry, you name it (they are the basis of so-called Markov chain Monte Carlo algorithms universally used in the sciences to estimate the best model parameters matching observed data). Formally, a Markov chain is a directed graph M whose vertices are the set S of possible states (with a des- ignated start state so), and whose edges indicate the possible random choices: for each state s, the outgoing edges have weights which sum to 1 (self-loops being allowed), and the probability of following a particular edge is its weight. For example: 1/2 SO 1/4 $1 1/4 1 $2 2/3 $3 1/3 1 If we take a random walk in a Markov chain for k steps starting from so, then every possible path has a probability given by multiplying all of the weights of the edges along the path: for instance, in our example above, the path (so, S0, S1,S3,S2) has probability (1/2). (1/4). (1)-(2/3)=1/12. One basic question about Markov chains is the following: given a Markov chain M, a start state so S, and an ending state g = S, what is the most likely path to take from so to g? Describe an efficient algorithm to solve this problem. (Hint: If the probability of a path were the sum of the weights instead of the product, this would look like a problem you've seen before. Can you transform the weights so that maximizing their sum is equivalent to maximizing the product of the original weights?) The time it takes an individual popcorn kernel to pop conforms to a normal distribution very closely. Assume that the mean time to popping is 165.0 seconds with a standard deviation of 92.1 seconds. What is the probability that a kernel of popcorn would take longer than 200 seconds to pop? Give your answer to five decimal places. Use Statistical Table B. probability: What is the probability that a kernel of popcorn would pop in less than 120 seconds? Give your answer to five decimal places. Use Statistical Table B. probability:
Expert Answer:
Related Book For
Artificial Intelligence Structures And Strategies For Complex Problem Solving
ISBN: 9780321545893
6th Edition
Authors: George Luger
Posted Date:
Students also viewed these computer network questions
-
QUIZ... Let D be a poset and let f : D D be a monotone function. (i) Give the definition of the least pre-fixed point, fix (f), of f. Show that fix (f) is a fixed point of f. [5 marks] (ii) Show that...
-
Let A, B be sets. Define: (a) the Cartesian product (A B) (b) the set of relations R between A and B (c) the identity relation A on the set A [3 marks] Suppose S, T are relations between A and B, and...
-
A car is randomly selected at a traffic safety checkpoint, and the car has 6 cylinders. Determine whether the given values are from a discrete or continuous data set.
-
What is the least-risky asset for each of the following investors? a. A person investing for her 3-year-old child's college tuition. b. A defined benefit pension fund with benefit obligations that...
-
Is Dillers approach value-creating diversification? Why or Why not?
-
The loop in Figure P25.20 has an induced current as shown. The loop has a resistance of \(0.10 \Omega\). Is the magnetic field strength increasing or decreasing? What is the rate of change of the...
-
Lara Fredericks is interested in two mutually exclusive investments. Both investments cover the same time horizon of 6 years. The cost of the first investment is $10,000, and Lara expects equal and...
-
In the ordered pair (-5,3) - what are the x and y coordinates? x- coordinate: y-coordinate:
-
Why is competition in internet streaming services heating up? Who is jumping into the fray, and why? How do these companies differ? What do you expect the result of this intensifying competition will...
-
Acc 501 Ethics case Due: April 5, 2022 You are the accountant for the Fastway Company, a manufacturing firm in the heartland of the United States. Like other firms in the area, Fastway has...
-
You are going to create an innovative product or service Each Project Innovation Team will have the opportunity to frame their challenge based on their selection of a particular UN SDG and a...
-
Duval inc budgets direct materials at $1/liter and requires 4 liters per unit of finished product. Aprils activities show usage of 832 liters to complete 196 units at a cost of $798.72. Calculate the...
-
It is January 1, 2019. Find the present value of a $100 perpetuity when the first payment is at the end of year 2019. The discount rate is 6%. It is January 1, 2019. Find the present value of a $100...
-
Smith Corp. bonds were issued 25 years ago. These bonds have a 15% required rate of return, mature in 11 years, and have a current market value of $995.10. Find the coupon rate. Round intermediate...
-
On January 1st, an investor purchases security A for $105. Over the next four months, dividends totaling $15 were paid on security A. On March 31st, security A was sold for $95. What is the holding...
-
John Little who is single is a new client of yours that has come to you with several tax issues with which he needs your help. He is an engineer that has his own practice for which he files a...
-
Catalytic hydrogenation of naphthalene over PdC results in rapid addition of 2 moles of H 2 . Propose a structure for this product.
-
Build a genetic algorithm to search for a solution for the traveling salesperson problem.
-
Extend the dogs world grammar so it will include the illegal sentences in Exercise 3. Data from Exercise 3 Parse each of these sentences using the dogs world grammar of Section 15.2.1. Which of these...
-
Given the hidden Markov model and Viterbi algorithm of Section 9.3.6, perform a full trace, including setting up the appropriate back pointers, that shows how the observation #, n, iy, t, # would be...
-
Let \(\delta_{j}, j \geqslant 1\), be iid Bernoulli random variables with \(\mathbb{P}\left(\delta_{j}= \pm 1ight)=1 / 2\). We set \[S_{0}:=0, \quad S_{n}:=\delta_{1}+\cdots+\delta_{n} \quad \text {...
-
Let \(X_{n}, Y_{n}: \Omega ightarrow \mathbb{R}, n \geqslant 1\), be two sequences of random variables. a) If \(X_{n} \xrightarrow{d} X\) and \(Y_{n} \xrightarrow{\mathbb{P}} c\), then \(X_{n} Y_{n}...
-
Let \(G\) and \(G^{\prime}\) be two independent real N \((0,1)\)-random variables. Show that It: !! G+ G' ~N(0, 1) and . 2
Study smarter with the SolutionInn App