The following are some applications of the Markovinequality of Exercise 29:(a) The scores that high school juniors get on the verbalpart of the PSAT/NMSQT test may be looked upon asvalues of a random variable with the mean μ = 41. Findan upper bound to the probability that one of the studentswill get a score of 65 or more.(b) The weight of certain animals may be looked uponas a random variable with a mean of 212 grams. If noneof the animals weighs less than 165 grams, find an upperbound to the probability that such an animal will weigh atleast 250 grams.

The following are some applications of the Markovinequality of Exercise 29:(a) The scores that high school juniors get on the verbalpart of the PSAT/NMSQT test may be looked upon asvalues of a random variable with the mean μ = 41. Findan upper bound to the probability that one of the studentswill get a score of 65 or more.(b) The weight of certain animals may be looked uponas a random variable with a mean of 212 grams. If noneof the animals weighs less than 165 grams, find an upperbound to the probability that such an animal will weigh atleast 250 grams.

Linear Algebra: A Modern Introduction

4th Edition

ISBN:9781285463247

Author:David Poole

Publisher:David Poole

Chapter3: Matrices

Section3.7: Applications

Problem 9EQ

See similar textbooks

Similar questions

12. Robots have been programmed to traverse the maze shown in Figure 3.28 and at each junction randomly choose which way to go. Figure 3.28 (a) Construct the transition matrix for the Markov chain that models this situation. (b) Suppose we start with 15 robots at each junction. Find the steady state distribution of robots. (Assume that it takes each robot the same amount of time to travel between two adjacent junctions.)
Based on the data that has been gathered what is the probability of disasters in July & Augustus using Markov chain ?
From yrs of teaching experience , an english teacher knows that her student's score will be va random variabel between variance = 25 adn mean = 75 how many students in general ,would have to take exam with a probability of atleast 0.9 , such that the class average would be within 5 of 75 dont use CLT , use markov /Chevyshev
Suppose you toss a six-sided die repeatedly until the product of the last two outcomes is equal to 12. What is the average number of times you toss your die? Construct a Markov chain and solve the problem.
The computer center at Rockbottom University has been experiencing computer downtime. Let us assume that the trials of an associated Markov process are defined as one-hour periods and that the probability of the system being in a running state or a down state is based on the state of the system in the previous period. Historical data show the following transition probabilities. To From Running Down Running 0.90 0.10 Down 0.20 0.80 (a) If the system is initially running, what is the probability of the system being down in the next hour of operation? (b) What are the steady-state probabilities of the system being in the running state and in the down state? (Enter your probabilities as fractions.) Running?1= Down?2=
PLEASE HELP ME GET THE ANSWER FOR PART B AND IT HAS TO BE FRACTION/INTEGER/ OR EXACT DECIMAL AND THE ASWER I GOT 0.66 FOR FIRST AND 0.99 FOR SECOND AND BOTHER WERE WRONG. The computer center at Rockbottom University has been experiencing computer downtime. Let us assume that the trials of an associated Markov process are defined as one-hour periods and that the probability of the system being in a running state or a down state is based on the state of the system in the previous period. Historical data show the following transition probabilities. To From Running Down Running 0.90 0.10 Down 0.20 0.80 (a) If the system is initially running, what is the probability of the system being down in the next hour of operation? ANSWER FOR PART A IS 0.10 (b) What are the steady-state probabilities of the system being in the running state and in the down state? (Enter your probabilities as fractions.) Running?1= Your answer must be a fraction, integer, or exact decimal. .66 IS…
Consider the following stochastic system. Let Xn be the price of a certain stock (rounded to the nearest cent) at the time that the stock market closes on the n-th day starting today. Would it be appropriate to model this system as a Discrete-time Markov Chain?
Data collected from selected major metropolitan areas in the eastern United States show that 3% of individuals living within the city limits move to the suburbs during a one-year period, while 1% of individuals living in the suburbs move to the city during a one-year period. Answer the following questions assuming that this process is modeled by a Markov process with two states: city and suburbs. (a) Prepare the matrix of transition probabilities. To From City Suburbs City Suburbs (b) Compute the steady-state probabilities. (Enter your probabilities as fractions.) City?1= Suburbs?2=
Consider the problem of sending a binary message, 0 or 1, through a signal channelconsisting of several stages, where transmission through each stage is subject to a fixedprobability of error α. Suppose that X0 = 0 is the signal that is sent and let Xn, be thesignal that is received at the nth stage. Assume that {Xn} is a Markov chain with transitionprobabilities, Poo = P11 = 1- α and P01 = P10 = α, where 0 < α < 1.(a) Determine P {Xo = 0, X1 = 0, X2 = 0}, the probability that no error α occurs up tostage n = 2.(b) Determine the probability that a correct signal is received at stage 2.
A study of pine nut crops in the American southwest from 1940 to 1947 hypothised that nut production followed a Markov chain. The data suggested that if one year's crop was good, then the probabilities that the following year's crop would be good, fair, or poor were 0.08, 0.07, and 0.85, respectively; if one year's crop was fair, then the probabilities that the follow-ing year's crop would be good, fair, or poor were 0.09, 0.11, and 0.80, respectively; if one year's crop was poor, then the probabilities that the following year's crop would be good, fair, or poor were 0.11, 0.05, and 0.84, respectively. (a) Write down the transition matrix for this Markov chain. (b) If the pine nut crop was good in 1940, find the probabilities of a good crop in the years 1941 through 1945. (c) In the long run, what proportion of the crops will be good, fair, and poor
We know that the expected height of trees in a national park is 25 meters, with a standard deviation of 5 meters. By using Markov's inequality, estimate the upper bound for the probability that a tree is equal to or taller than 60 meters. Please round your result to three decimal places.
A manufacturer has a machine that if it ran all day today has a proba- bility of 0.2 of breaking down sometime during the day tomorrow. When the machine breaks down, it goes offline for the remainder of the day and then a technician will spend the next day (after the breakdown) repairing it. A newly repaired machine only has a proability of 0.1 of breaking down sometime tomorrow. (a) Formulate the evolution of the status of the machine at the end of the day as a Markov Chain by identifying the three possible states at the end of the day and providing the transition probabilities between these states. (b) Determine the expected first passage times, µij , for all combinations of states i and j where i cannot equal to j (i.e., you don’t need to determine the recurrence times). You must provide the set of equations used to calculate these µij (micro with lowercase i and j). (c) Using your results from (b): (i) Identify the expected number of full days that the machine will remain…