Question

Show that a random walk on graph $G$ is an irreducible Markov chain and determine its invariant distribution.

score 1k · Answer 1 · 2026-03-25 20:36:23

1k

Views

Show that a random walk on graph $G$ is an irreducible Markov chain and determine its invariant distribution.

Published on 25 Mar 2026 - 20:36

score 409 · Answer 2 · 2019-06-07 08:10:24

409

Views

Equilibrium probabilities in simple 3-state Markov chain

Published on 07 Jun 2019 - 8:10

score 122 · Answer 3 · 2019-06-07 10:51:43

122

Views

Markov chains - expected hitting times

Published on 07 Jun 2019 - 10:51

score 739 · Answer 4 · 2019-06-08 16:10:35

739

Views

calculating infinite step transition probabilities

Published on 08 Jun 2019 - 16:10

score 796 · Answer 5 · 2026-03-26 19:04:04

796

Views

Random Walk on Circle

Published on 26 Mar 2026 - 19:04

score 72 · Answer 6 · 2026-03-27 08:39:36

72

Views

Action plan to solve the problem Markov decision-making models

Published on 27 Mar 2026 - 8:39

score 412 · Answer 7 · 2019-06-10 18:47:02

412

Views

Continuous markov chains, forward and backward equations naming.

Published on 10 Jun 2019 - 18:47

score 869 · Answer 8 · 2019-06-11 03:05:36

869

Views

Mean time to absorption

Published on 11 Jun 2019 - 3:05

score 294 · Answer 9 · 2019-06-11 14:11:01

An irreducible chain with finitely many states is aperiodic if and only if there exists an n such that $p_{i,j}^{(n)}>0$, $\forall i,j \in S$

score 43 · Answer 10 · 2026-03-27 08:44:22

43

Views

Markov chain $Y_n:=X_{2n}$ transition probability

Published on 27 Mar 2026 - 8:44

score 68 · Answer 11 · 2026-03-27 08:57:09

68

Views

Can I estimate a generator matrix Q of a Continuous Time Markov Chain using discrete time without an absorbing state?

Published on 27 Mar 2026 - 8:57

score 34 · Answer 12 · 2019-06-12 08:40:26

34

Views

Stochastic processes and infection propagation

Published on 12 Jun 2019 - 8:40

score 51 · Answer 13 · 2019-06-12 08:54:37

51

Views

Markov Chains and their invariants: exchanging limits

Published on 12 Jun 2019 - 8:54

score 118 · Answer 14 · 2019-06-12 12:37:33

118

Views

Example where optimal stopping does not exist

Published on 12 Jun 2019 - 12:37

score 67 · Answer 15 · 2026-03-27 07:14:43

67

Views

Central Limit Theorem and Law of Large Numbers for stable linear stochastic systems

Published on 27 Mar 2026 - 7:14

List Question

Show that a random walk on graph $G$ is an irreducible Markov chain and determine its invariant distribution.

Equilibrium probabilities in simple 3-state Markov chain

Markov chains - expected hitting times

calculating infinite step transition probabilities

Random Walk on Circle

Action plan to solve the problem Markov decision-making models

Continuous markov chains, forward and backward equations naming.

Mean time to absorption

An irreducible chain with finitely many states is aperiodic if and only if there exists an n such that $p_{i,j}^{(n)}>0$, $\forall i,j \in S$

Markov chain $Y_n:=X_{2n}$ transition probability

Can I estimate a generator matrix Q of a Continuous Time Markov Chain using discrete time without an absorbing state?

Stochastic processes and infection propagation

Markov Chains and their invariants: exchanging limits

Example where optimal stopping does not exist

Central Limit Theorem and Law of Large Numbers for stable linear stochastic systems

Trending Questions

Popular # Hahtags

Popular Questions