QuantEcon / lecture-python-intro

An Undergraduate Lecture Series for the Foundations of Computational Economics
https://intro.quantecon.org/
39 stars 20 forks source link

[markov_chains_II] adding the definition of accessibility #463

Closed longye-tian closed 3 months ago

longye-tian commented 3 months ago

Dear John @jstac ,

As we discussed in #460 , this issue is to discuss the definition of accessibility.

I propose using the definition in the QuantEcon Book Economic Networks: Theory and Computation on page 31.

I modified this definition slightly from 'vertex' in the book to 'state' in this lecture to match the context as follows:


State $x$ is called accessible (or reachable) from state $y$ if either $x=y$ or there exists a directed path from $x$ to $y$.

Two states, $x$ and $y$, are said to communicate if $x$ and $y$ are accessible from each other.


I have one question about the above definition:

Should we also include the definition of a directed path or provide a link to this definition?

Best ❤️

Longye

jstac commented 3 months ago

Many thanks @longye-tian .

Should we also include the definition of a directed path or provide a link to this definition?

Let's change the definition of accessible to $P^t(x,y) > 0$ for some $t \geq 0$.

I like the idea of discussing directed paths but this option is simpler.

longye-tian commented 3 months ago

Many thanks @longye-tian .

Should we also include the definition of a directed path or provide a link to this definition?

Let's change the definition of accessible to Pt(x,y)>0 for some t≥0.

I like the idea of discussing directed paths but this option is simpler.

Thank you for the reply!

I will add the definition to the lecture as follows:


State $x$ is called accessible (or reachable) from state $y$ if $P^t(x,y)>0$ for some $t\ge 0$.

Two states, $x$ and $y$, are said to communicate if $x$ and $y$ are accessible from each other.


Best ❤️ Longye