pub struct NetworkRobustness;Expand description
Network robustness analysis via percolation theory.
Implementations§
Source§impl NetworkRobustness
impl NetworkRobustness
Sourcepub fn giant_component_fraction(graph: &NetworkGraph) -> f64
pub fn giant_component_fraction(graph: &NetworkGraph) -> f64
Computes size of the giant component (largest connected component) as fraction of N.
Sourcepub fn connected_components(graph: &NetworkGraph) -> Vec<usize>
pub fn connected_components(graph: &NetworkGraph) -> Vec<usize>
Connected components via BFS, returns component id for each node.
Sourcepub fn percolation_curve(graph: &NetworkGraph, seed: u64) -> Vec<(f64, f64)>
pub fn percolation_curve(graph: &NetworkGraph, seed: u64) -> Vec<(f64, f64)>
Simulates random node removal: returns giant component fraction vs fraction removed.
Sourcepub fn bond_percolation_threshold(mean_degree: f64) -> f64
pub fn bond_percolation_threshold(mean_degree: f64) -> f64
Estimated bond percolation threshold p_c ≈ 1 / (k ) for Erdős-Rényi graphs.
Auto Trait Implementations§
impl Freeze for NetworkRobustness
impl RefUnwindSafe for NetworkRobustness
impl Send for NetworkRobustness
impl Sync for NetworkRobustness
impl Unpin for NetworkRobustness
impl UnsafeUnpin for NetworkRobustness
impl UnwindSafe for NetworkRobustness
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
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
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
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.