Skip to main content

RandomWalkGraph

oxiphysics_core::network_dynamics

Struct RandomWalkGraph 

Source 
pub struct RandomWalkGraph { /* private fields */ }
Expand description

Random walk on a graph with analysis of hitting and cover times.

Implementations§

Source§

impl RandomWalkGraph

Source

pub fn new(graph: NetworkGraph) -> Self

Creates a random walk handler for the given graph.

Source

pub fn walk(&self, start: usize, max_steps: usize, seed: u64) -> Vec<usize>

Simulates a random walk starting at start for max_steps.

Returns the sequence of visited nodes.

Source

pub fn hitting_time_estimate( &self, start: usize, target: usize, trials: usize, seed: u64, ) -> f64

Estimates hitting time from start to target by Monte Carlo.

Source

pub fn cover_time_estimate(&self, start: usize, trials: usize, seed: u64) -> f64

Estimates cover time (expected steps to visit all nodes) by Monte Carlo.

Source

pub fn stationary_distribution(&self, tol: f64, max_iter: usize) -> Vec<f64>

Stationary distribution via power iteration on the transition matrix.

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.