Skip to main content

Kuramoto model on graphs

Project description

Downloads

Like the package? Don't forget to give it a GitHub ⭐ to help others find and trust it!

kuramoto

Python implementation of the Kuramoto model.

Install

pip install kuramoto

Usage

import numpy as np
import matplotlib.pyplot as plt
import networkx as nx
import seaborn as sns

from kuramoto import Kuramoto, plot_phase_coherence, plot_activity

sns.set_style("whitegrid")
sns.set_context("notebook", font_scale=1.6)

# Interactions are represented as an adjacency matrix _A_, a 2D numpy ndarray.
# Instantiate a random graph and transform into an adjacency matrix
graph_nx = nx.erdos_renyi_graph(n=100, p=1) # p=1 -> all-to-all connectivity
adj_mat = nx.to_numpy_array(graph_nx)

# Instantiate model with parameters
model = Kuramoto(coupling=3, dt=0.01, T=10, n_nodes=len(adj_mat))

# Run simulation - output is time series for all nodes (node vs time)
activity = model.run(adj_mat=adj_mat)

# Plot all the time series
plot_activity(activity)

png

# Plot evolution of global order parameter R_t
plot_phase_coherence(act_mat)

png

# Plot oscillators in complex plane at times t = 0, 250, 500
fig, axes = plt.subplots(ncols=3, nrows=1, figsize=(15, 5),
                         subplot_kw={
                             "ylim": (-1.1, 1.1),
                             "xlim": (-1.1, 1.1),
                             "xlabel": r'$\cos(\theta)$',
                             "ylabel": r'$\sin(\theta)$',
                         })

times = [0, 200, 500]
for ax, time in zip(axes, times):
    ax.plot(np.cos(act_mat[:, time]),
            np.sin(act_mat[:, time]),
            'o',
            markersize=10)
    ax.set_title(f'Time = {time}')

png

As a sanity check, let's look at the phase transition of the global order parameter (Rt) as a function of coupling (K) (find critical coupling Kc) and compare with numerical results already published by English, 2008 (see Ref.) – we will match those model parameters.

# Instantiate a random graph and transform into an adjacency matrix
n_nodes = 500
graph_nx = nx.erdos_renyi_graph(n=n_nodes, p=1) # p=1 -> all-to-all connectivity
graph = nx.to_numpy_array(graph_nx)

# Run model with different coupling (K) parameters
coupling_vals = np.linspace(0, 0.6, 100)
runs = []
for coupling in coupling_vals:
    model = Kuramoto(coupling=coupling, dt=0.1, T=500, n_nodes=n_nodes)
    model.natfreqs = np.random.normal(1, 0.1, size=n_nodes)  # reset natural frequencies
    act_mat = model.run(adj_mat=graph)
    runs.append(act_mat)

# Check that natural frequencies are correct (we need them for prediction of Kc)
plt.figure()
plt.hist(model.natfreqs)
plt.xlabel('natural frequency')
plt.ylabel('count')

png

# Plot all time series for all coupling values (color coded)
runs_array = np.array(runs)

plt.figure()
for i, coupling in enumerate(coupling_vals):
    plt.plot(
        [model.phase_coherence(vec)
         for vec in runs_array[i, ::].T],
        c=str(1-coupling),  # higher -> darker   
    )
plt.ylabel(r'order parameter ($R_t$)')
plt.xlabel('time')

png

# Plot final Rt for each coupling value
plt.figure()
for i, coupling in enumerate(coupling_vals):
    r_mean = np.mean([model.phase_coherence(vec)
                      for vec in runs_array[i, :, -1000:].T]) # mean over last 1000 steps
    plt.scatter(coupling, r_mean, c='steelblue', s=20, alpha=0.7)

# Predicted Kc – analytical result (from paper)
Kc = np.sqrt(8 / np.pi) * np.std(model.natfreqs) # analytical result (from paper)
plt.vlines(Kc, 0, 1, linestyles='--', color='orange', label='analytical prediction')

plt.legend()
plt.grid(linestyle='--', alpha=0.8)
plt.ylabel('order parameter (R)')
plt.xlabel('coupling (K)')
sns.despine()

png

Kuramoto model 101

  • The Kuramoto model is used to study a wide range of systems with synchronization behaviour.
  • It is a system of N coupled periodic oscillators.
  • Each oscillator has its own natural frequency omegai, i.e., constant angular velocity.
  • Usually, the distribution of natural frequencies is choosen to be a gaussian-like symmetric function.
  • A random initial (angular) position thetai is assigned to each oscillator.
  • The oscillator's state (position) thetai is governed by the following differential equation:

jpg

where K is the coupling parameter and Mi is the number of oscillators interacting with oscillator i. A is the adjacency matrix enconding the interactions - typically binary and undirected (symmetric), such that if node i interacts with node j, Aij = 1, otherwise 0. The basic idea is that, given two oscillators, the one running ahead is encouraged to slow down while the one running behind to accelerate.

In particular, the classical set up has M = N, since the interactions are all-to-all (i.e., a complete graph). Otherwise, Mi is the degree of node i.

Kuramoto model 201

A couple of facts in order to gain intuition about the model's behaviour:

  • If synchronization occurs, it happens abruptly.
  • That is, synchronization might not occur.
  • Partial synchronization is a possible outcome.
  • The order parameter Rt measures global synchronization at time t. It is basically the normalized length of the sum of all vectors (oscillators in the complex plane).
  • About the global order parameter Rt:
    • constant, in the double limit N -> inf, t -> inf
    • independent of the initial conditions
    • depends on coupling strength
    • it shows a sharp phase transition (as function of coupling)
  • Steady solutions can be computed assuming Rt constant. The result is basically that each oscillator responds to the mean field produced by the rest.
  • In the all-to-all connected scenaria, the critical coupling Kc can be analytically computed and it depends on the spread of the natural frequencies distribution (see English, 2008)
  • The higher the dimension of the lattice on which the oscillators are embedded, the easier it is to synchronize. For example, there isn't any good synchronization in one dimension, even with strong coupling. In two dimensions it is not clear yet. From 3 dimensions on, the model starts behaving more like the mean field prediction.

For more and better details, this talk by the great Steven Strogatz is a nice primer.

Tests

Run tests with

make test

Citing

If you find this package useful for a publication, then please use the following BibTeX to cite it:

@misc{kuramoto,
  author = {Damicelli, Fabrizio},
  title = {Python implementation of the Kuramoto model},
  year = {2019},
  publisher = {GitHub},
  journal = {GitHub repository},
  howpublished = {\url{https://github.com/fabridamicelli/kuramoto}},
}

References & links

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

kuramoto-0.4.0.tar.gz (8.2 kB view details)

Uploaded Source

Built Distribution

If you're not sure about the file name format, learn more about wheel file names.

kuramoto-0.4.0-py3-none-any.whl (8.2 kB view details)

Uploaded Python 3

File details

Details for the file kuramoto-0.4.0.tar.gz.

File metadata

  • Download URL: kuramoto-0.4.0.tar.gz
  • Upload date:
  • Size: 8.2 kB
  • Tags: Source
  • Uploaded using Trusted Publishing? No
  • Uploaded via: uv/0.8.22

File hashes

Hashes for kuramoto-0.4.0.tar.gz
Algorithm Hash digest
SHA256 5dbb82e5d9ed7dfacdc9c9efe9dbf2cc6c501b6812ea43331fbcf0a9f4c27c15
MD5 5102b6b53342de2c47c0ab95fc82f9db
BLAKE2b-256 8bf032d44176be0b2ae57fcfa4060b6814550e993187f571f5501755e96a4a01

See more details on using hashes here.

File details

Details for the file kuramoto-0.4.0-py3-none-any.whl.

File metadata

  • Download URL: kuramoto-0.4.0-py3-none-any.whl
  • Upload date:
  • Size: 8.2 kB
  • Tags: Python 3
  • Uploaded using Trusted Publishing? No
  • Uploaded via: uv/0.8.22

File hashes

Hashes for kuramoto-0.4.0-py3-none-any.whl
Algorithm Hash digest
SHA256 fb86287df24e07b91f427e4188581df885ee701d9ac3b858d860af2587315a56
MD5 337d9e6dbae3e77346f9d9bf1b2981d8
BLAKE2b-256 c26383705729e6f30680cedd4f4eff185fbe9dfa647f40319e2468a08b42f5b4

See more details on using hashes here.

Supported by

AWS Cloud computing and Security Sponsor Datadog Monitoring Depot Continuous Integration Fastly CDN Google Download Analytics Pingdom Monitoring Sentry Error logging StatusPage Status page