ps) Random Pub Crawl: Your town has 5 pubs close to your home, say A, B, C, D, E.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
E Random Pub Crawl: Your town has 5 pubs close to your home,
say A, B, C, D, E.
1/4
1/2
1/2
Home 1/2
1/4
1/4 1/4/
1/4
1/4
1/3
1/4
1/2
1/3
1/4
D
E
1/3
1/2
(a) Write a program to simulate the random pub crawl. (From the
"home" state allow probability 1/2 of going back to state B).
(b) Starting from the Home state, run your program 1000 times, each
time simulating a Markov chain of length 100. Each simulation
should output a random sequence of values ($1, 82, 83..., $100 )
where each si is a pub and with that sequence, compute the num-
ber of times each state is visited. Keep only these statistics. After
the 1000 repetitions compute the average number of visits to each
state.
3.
Transcribed Image Text:E Random Pub Crawl: Your town has 5 pubs close to your home, say A, B, C, D, E. 1/4 1/2 1/2 Home 1/2 1/4 1/4 1/4/ 1/4 1/4 1/3 1/4 1/2 1/3 1/4 D E 1/3 1/2 (a) Write a program to simulate the random pub crawl. (From the "home" state allow probability 1/2 of going back to state B). (b) Starting from the Home state, run your program 1000 times, each time simulating a Markov chain of length 100. Each simulation should output a random sequence of values ($1, 82, 83..., $100 ) where each si is a pub and with that sequence, compute the num- ber of times each state is visited. Keep only these statistics. After the 1000 repetitions compute the average number of visits to each state. 3.
hen finished, make sure
ptionally, click Save as Draft
d.albany.edu/webe
(e) How do the statistics change if you started at state D? Repeat the
simulation staterting at state D.
(d) Does the distribution over states visited at step t converge for large
t?
(e) Approximately how long does it take for the chain to " forget""
whether it started at Home or at D?
Transcribed Image Text:hen finished, make sure ptionally, click Save as Draft d.albany.edu/webe (e) How do the statistics change if you started at state D? Repeat the simulation staterting at state D. (d) Does the distribution over states visited at step t converge for large t? (e) Approximately how long does it take for the chain to " forget"" whether it started at Home or at D?
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY