Skip to main content

MarkovChain

Struct MarkovChain 

Source
pub struct MarkovChain {
    pub transition: Vec<Vec<f64>>,
    pub n_states: usize,
    /* private fields */
}
Expand description

Discrete-time finite Markov chain.

Stores the transition matrix P where P[i][j] = P(X_{n+1} = j | X_n = i).

Fields§

§transition: Vec<Vec<f64>>

Transition matrix (n_states x n_states), row-major.

§n_states: usize

Number of states.

Implementations§

Source§

impl MarkovChain

Source

pub fn new(transition: Vec<Vec<f64>>, seed: u64) -> Self

Creates a new Markov chain from a transition matrix.

Rows must sum to 1 (stochastic matrix).

Source

pub fn simulate(&self, start_state: usize, n_steps: usize) -> Vec<usize>

Simulate a trajectory of length n_steps starting from start_state.

Source

pub fn stationary_distribution(&self) -> Vec<f64>

Compute stationary distribution by power iteration.

Returns pi such that pi * P = pi with sum(pi) = 1.

Source

pub fn hitting_time( &self, start_state: usize, target_state: usize, n_samples: usize, ) -> f64

Estimate expected hitting time to target_state from start_state by simulation.

Source

pub fn n_step_matrix(&self, n: usize) -> Vec<Vec<f64>>

Return the n-step transition matrix P^n.

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.