In Problems 87 - 90 , several experiments are simulated using the random number feature on a graphing calculator. For example, the roll of a fair die can be simulated by selecting a random integer from, and 50 rolls of a fair die by selecting 50 random integers from 1 to 6 (see Fig. A for Problem 87 and your user's manual). Use a graphing calculator to simulate 200 tosses of a nickel and dime, representing the outcomes HH, HT, TH, TT by 1, 2, 3, and 4 , respectively. (A) Find the empirical probabilities of the four outcomes. (B) What is the probability of each outcome under the equally likely assumption?
In Problems 87 - 90 , several experiments are simulated using the random number feature on a graphing calculator. For example, the roll of a fair die can be simulated by selecting a random integer from, and 50 rolls of a fair die by selecting 50 random integers from 1 to 6 (see Fig. A for Problem 87 and your user's manual). Use a graphing calculator to simulate 200 tosses of a nickel and dime, representing the outcomes HH, HT, TH, TT by 1, 2, 3, and 4 , respectively. (A) Find the empirical probabilities of the four outcomes. (B) What is the probability of each outcome under the equally likely assumption?
Solution Summary: The author explains how to determine empirical probability using graphing utility for 200 tosses of a nickel and dime representing the outcomes.
In Problems
87
-
90
, several experiments are simulated using the random number feature on a graphing calculator. For example, the roll of a fair die can be simulated by selecting a random integer from, and
50
rolls of a fair die by selecting
50
random integers from
1
to
6
(see Fig. A for Problem
87
and your user's manual).
Use a graphing calculator to simulate
200
tosses of a nickel and dime, representing the outcomes
HH,
HT,
TH,
TT
by
1,
2,
3,
and
4
, respectively.
(A) Find the empirical probabilities of the four outcomes.
(B) What is the probability of each outcome under the equally likely assumption?
Module Code: MATH380202
3. (a) Let {} be a white noise process with variance σ2.
Define an ARMA(p,q) process {X} in terms of {+} and state (without proof)
conditions for {X} to be (i) weakly stationary and (ii) invertible.
Define what is meant by an ARIMA (p, d, q) process. Let {Y} be such an ARIMA(p, d, q)
process and show how it can also be represented as an ARMA process, giving the
AR and MA orders of this representation.
(b) The following tables show the first nine sample autocorrelations and partial auto-
correlations of X and Y₁ = VX+ for a series of n = 1095 observations. (Notice
that the notation in this part has no relationship with the notation in part (a) of
this question.)
Identify a model for this time series and obtain preliminary estimates for the pa-
rameters of your model.
X₁
= 15.51, s² = 317.43.
k
1
2
3
4
5
6
7
Pk
0.981
0.974
0.968
akk 0.981 0.327
8
9
0.927
0.963 0.957 0.951 0.943 0.935
0.121 0.104 0.000 0.014 -0.067 -0.068 -0.012
Y₁ = VX : y = 0.03, s² = 11.48.
k
1…
Let G be a graph with n ≥ 2 vertices x1, x2, . . . , xn, and let A be the adjacency matrixof G. Prove that if G is connected, then every entry in the matrix A^n−1 + A^nis positive.
Module Code: MATH380202
1. (a) Define the terms "strongly stationary" and "weakly stationary".
Let {X} be a stochastic process defined for all t € Z. Assuming that {X+} is
weakly stationary, define the autocorrelation function (acf) Pk, for lag k.
What conditions must a process {X+) satisfy for it to be white noise?
(b) Let N(0, 1) for t€ Z, with the {+} being mutually independent. Which of
the following processes {X+} are weakly stationary for t> 0? Briefly justify your
answers.
i. Xt for all > 0.
ii. Xo~N(0,) and X₁ = 2X+-1+ &t for t > 0.
(c) Provide an expression for estimating the autocovariance function for a sample
X1,..., X believed to be from a weakly stationary process. How is the autocor-
relation function Pk then estimated, and a correlogram (or acf plot) constructed?
(d) Consider the weakly stationary stochastic process ✗+ = + + +-1+ +-2 where
{E} is a white noise process with variance 1. Compute the population autocorre-
lation function Pk for all k = 0, 1, ....
Chapter 8 Solutions
Pearson eText for Finite Mathematics for Business, Economics, Life Sciences, and Social Sciences -- Instant Access (Pearson+)
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.
Discrete Distributions: Binomial, Poisson and Hypergeometric | Statistics for Data Science; Author: Dr. Bharatendra Rai;https://www.youtube.com/watch?v=lHhyy4JMigg;License: Standard Youtube License