pub struct BrunelNetwork {}Expand description
Brunel 2000 — balanced excitatory/inhibitory network mean-field.
Two coupled rate equations for excitatory (r_e) and inhibitory (r_i) populations. The balance of E and I determines the dynamical regime:
- Asynchronous Irregular (AI): low rates, Poisson-like
- Synchronous Regular (SR): oscillatory, gamma-band
- Synchronous Irregular (SI): fast oscillations, irregular single units
tau_e * dr_e/dt = -r_e + phi(J_eer_e - J_eir_i + I_ext) tau_i * dr_i/dt = -r_i + phi(J_ier_e - J_iir_i)
phi() is a threshold-linear transfer function.
Brunel, J Comput Neurosci 8:183, 2000.
Fields§
§r_e: f64§r_i: f64§tau_e: f64§tau_i: f64§j_ee: f64§j_ei: f64§j_ie: f64§j_ii: f64§threshold: f64§gain_phi: f64§dt: f64§r_threshold: f64§gain: f64Implementations§
Trait Implementations§
Source§impl Clone for BrunelNetwork
impl Clone for BrunelNetwork
Source§fn clone(&self) -> BrunelNetwork
fn clone(&self) -> BrunelNetwork
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for BrunelNetwork
impl Debug for BrunelNetwork
Auto Trait Implementations§
impl Freeze for BrunelNetwork
impl RefUnwindSafe for BrunelNetwork
impl Send for BrunelNetwork
impl Sync for BrunelNetwork
impl Unpin for BrunelNetwork
impl UnsafeUnpin for BrunelNetwork
impl UnwindSafe for BrunelNetwork
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<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.