Skip to main content

DeGrootModel

Struct DeGrootModel 

Source
pub struct DeGrootModel {
    pub trust: Vec<Vec<f64>>,
}
Expand description

DeGroot consensus model: linear opinion pooling on a network.

Each agent i updates: o_i(t+1) = Σ_j T_{ij} o_j(t) where T is a row-stochastic trust matrix.

Fields§

§trust: Vec<Vec<f64>>

Row-stochastic trust matrix T (n×n stored row-major).

Implementations§

Source§

impl DeGrootModel

Source

pub fn new(trust: Vec<Vec<f64>>) -> Self

Creates a DeGroot model from a trust matrix.

Rows must sum to 1 (caller’s responsibility).

Source

pub fn from_graph(graph: &NetworkGraph) -> Self

Builds a uniform averaging DeGroot model from a graph.

Source

pub fn n(&self) -> usize

Returns the number of agents.

Source

pub fn step(&self, opinions: &[f64]) -> Vec<f64>

Applies one update step to opinions.

Source

pub fn run(&self, opinions: &[f64], steps: usize) -> Vec<f64>

Runs steps iterations, returns final opinions.

Source

pub fn has_consensus(&self, opinions: &[f64], tol: f64) -> bool

Checks if opinions have converged to consensus (max spread < tol).

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.