Homework Help is Here – Start Your Trial Now!
Math
Probability
(a) Construct the Markov diagram for this the locations of this game and show that the associate transition matrix T can be written as the following. T= || 0 1515000 1300-3-3C 0011001 100-KIING 0 0 0 00

(a) Construct the Markov diagram for this the locations of this game and show that the associate transition matrix T can be written as the following. T= || 0 1515000 1300-3-3C 0011001 100-KIING 0 0 0 00

A First Course in Probability (10th Edition)
A First Course in Probability (10th Edition)
10th Edition
ISBN:9780134753119
Author:Sheldon Ross
Publisher:Sheldon Ross
Chapter1: Combinatorial Analysis
Section: Chapter Questions
Problem 1.1P: a. How many different 7-place license plates are possible if the first 2 places are for letters and...
See similar textbooks
icon
Related questions
Question

4.a)

4. In a simplified version of a classic murder mystery board game, players move between locations to deduce details about a murder (the murderer, the weapon, and the location). We know the following about the locations and rules for movement: There are six locations: Kitchen, Ballroom, Dining Room, Cellar, Lounge, and Hall. • Dining Room is adjacent to Kitchen, Cellar, and Lounge . Cellar is adjacent to Ballroom and Hall (in addition to the Dining Room) • Kitchen and Ballroom are adjacent (in addition to the above) • Lounge and Hall are adjacent (in addition to the above) • All connections are bi-directional (players can move in both directions) • Players must move to an adjacent location on cach turn and cannot stay in the same location • Players move to adjacent locations with equal probabilities at each time step If you wish, you can simplify the location using their respective starting letters. I.c. K,B,D,C,L,H (a) Construct the Markov diagram for this the locations of this game and show that the associate transition matrix T can be written as the following. T= C1I21I2OO 0 0 0 0 -1300-3-30 011311330013 0 0 0 0011200112 00 012-IN Hint: Be sure to state your ordering of the states and justify the entries in T (b) Prove (without computing powers of T) that the matrix T is not a regular matrix. (c) A secret tunnel now added between the Kitchen and Lounge to connect the two areas. All existing connections remain and player move with the same rules. L.e. Players cannot stay in the same location and move to adjacent locations with equal probability. i. State (and justify) the new transition matrix R with the new transition probabilitics. ii. Show that this new transition matrix R is regular and determine the stable distribution of this new transition matrix. For this part, you may use a computer program/software to assist your calculations. Be sure to state which parts were done using a computer and provide details of the computations you performed. (d) The choice of connecting the Kitchen and Lounge to create a regular transition matrix is not a unique choice. Starting with the original transition matrix T, provide (and justify) a general criteria required to create a regular transition matrix via the introduction of a single secret tunnel.
Transcribed Image Text:4. In a simplified version of a classic murder mystery board game, players move between locations to deduce details about a murder (the murderer, the weapon, and the location). We know the following about the locations and rules for movement: There are six locations: Kitchen, Ballroom, Dining Room, Cellar, Lounge, and Hall. • Dining Room is adjacent to Kitchen, Cellar, and Lounge . Cellar is adjacent to Ballroom and Hall (in addition to the Dining Room) • Kitchen and Ballroom are adjacent (in addition to the above) • Lounge and Hall are adjacent (in addition to the above) • All connections are bi-directional (players can move in both directions) • Players must move to an adjacent location on cach turn and cannot stay in the same location • Players move to adjacent locations with equal probabilities at each time step If you wish, you can simplify the location using their respective starting letters. I.c. K,B,D,C,L,H (a) Construct the Markov diagram for this the locations of this game and show that the associate transition matrix T can be written as the following. T= C1I21I2OO 0 0 0 0 -1300-3-30 011311330013 0 0 0 0011200112 00 012-IN Hint: Be sure to state your ordering of the states and justify the entries in T (b) Prove (without computing powers of T) that the matrix T is not a regular matrix. (c) A secret tunnel now added between the Kitchen and Lounge to connect the two areas. All existing connections remain and player move with the same rules. L.e. Players cannot stay in the same location and move to adjacent locations with equal probability. i. State (and justify) the new transition matrix R with the new transition probabilitics. ii. Show that this new transition matrix R is regular and determine the stable distribution of this new transition matrix. For this part, you may use a computer program/software to assist your calculations. Be sure to state which parts were done using a computer and provide details of the computations you performed. (d) The choice of connecting the Kitchen and Lounge to create a regular transition matrix is not a unique choice. Starting with the original transition matrix T, provide (and justify) a general criteria required to create a regular transition matrix via the introduction of a single secret tunnel.
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer