Skip to main content

SynchronizationAnalysis

Struct SynchronizationAnalysis 

Source
pub struct SynchronizationAnalysis;
Expand description

Synchronisation analysis for coupled oscillators / chaotic systems.

Implementations§

Source§

impl SynchronizationAnalysis

Source

pub fn pecora_carroll_sync( drive_orbit: &[Vec<f64>], response_orbit: &[Vec<f64>], sync_idx: usize, tol: f64, ) -> bool

Pecora–Carroll synchronisation check.

Drives a response system (with the same structure as the drive) by replacing one of its variables with the drive’s corresponding variable.

Returns true if the synchronisation error decays below tol.

drive_orbit and response_orbit are trajectories of the same length; sync_idx is the variable index that is replaced in the response.

Source

pub fn phase_synchronization_index(phi1: &[f64], phi2: &[f64]) -> f64

Phase synchronisation index (mean resultant length of phase differences).

Given two phase time-series phi1 and phi2 (in radians), computes

R = |⟨exp(i(φ₁ − φ₂))⟩|

R = 1 means perfect phase synchronisation; R ≈ 0 means asynchronous.

Source

pub fn generalised_sync_check( resp1: &[Vec<f64>], resp2: &[Vec<f64>], tol: f64, ) -> bool

Generalised synchronisation check via the auxiliary system method.

Two copies of the response system starting at different initial conditions should converge to the same trajectory if GS holds. Returns true if the distance between resp1 and resp2 at the end is below tol.

Source

pub fn mutual_information(x: &[f64], y: &[f64], n_bins: usize) -> f64

Mutual information estimate between two scalar signals using histogram binning with n_bins bins.

Source

pub fn instantaneous_phase(signal: &[f64]) -> Vec<f64>

Compute instantaneous phase of a signal via the Hilbert transform approximation (using the discrete analytic signal via FFT-like unwrapping).

This is a simple numerical approximation using finite differences. Returns the unwrapped phase array.

Source

pub fn cross_correlation_zero_lag(x: &[f64], y: &[f64]) -> f64

Cross-correlation between two signals at lag 0 (normalised).

Trait Implementations§

Source§

impl Clone for SynchronizationAnalysis

Source§

fn clone(&self) -> SynchronizationAnalysis

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Debug for SynchronizationAnalysis

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more

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> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. 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> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
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.