Spatiotemporal Networks in Addressable Excitable Media International Workshop on Bio-Inspired Complex Networks in Science and Technology Max Planck Institute.

Slides:



Advertisements
Similar presentations
VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.
Advertisements

Information Networks Small World Networks Lecture 5.
Experiment with the Slinky
1 Evolution of Networks Notes from Lectures of J.Mendes CNR, Pisa, Italy, December 2007 Eva Jaho Advanced Networking Research Group National and Kapodistrian.
Complex Networks Third Lecture TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA TexPoint fonts used in EMF. Read the.
SASH Spatial Approximation Sample Hierarchy
Transport Equations and Flux Laws Basic concepts and ideas 1.A concept model of Diffusion 2.The transient Diffusion Equation 3.Examples of Diffusion Fluxes.
Advanced Topics in Data Mining Special focus: Social Networks.
Tracking Moving Objects in Anonymized Trajectories Nikolay Vyahhi 1, Spiridon Bakiras 2, Panos Kalnis 3, and Gabriel Ghinita 3 1 St. Petersburg State University.
1 Algorithms for Large Data Sets Ziv Bar-Yossef Lecture 7 May 14, 2006
The Erdös-Rényi models
Network of Networks and the Climate System Potsdam Institute for Climate Impact Research & Institut of Physics, Humboldt-Universität zu Berlin & King‘s.
DATA MINING LECTURE 13 Absorbing Random walks Coverage.
Using Graph Theory to Study Neural Networks (Watrous, Tandon, Conner, Pieters & Ekstrom, 2012)
John Wordsworth, Peter Ashwin, Gabor Orosz, Stuart Townley Mathematics Research Institute University of Exeter.
Ming-Feng Yeh1 CHAPTER 16 AdaptiveResonanceTheory.
3. SMALL WORLDS The Watts-Strogatz model. Watts-Strogatz, Nature 1998 Small world: the average shortest path length in a real network is small Six degrees.
Time-dependent Schrodinger Equation Numerical solution of the time-independent equation is straightforward constant energy solutions do not require us.
Micro-Simulation of Diffusion of Warnings Cindy Hui Mark Goldberg Malik Magdon-Ismail William A. Wallace Rensselaer Polytechnic Institute This material.
Synchronization in complex network topologies
Data Mining Using Eigenpattern Analysis in Simulations and Observed Data Woodblock Print, from “Thirty-Six Views of Mt. Fuji”, by K. Hokusai, ca
Performance of Adaptive Beam Nulling in Multihop Ad Hoc Networks Under Jamming Suman Bhunia, Vahid Behzadan, Paulo Alexandre Regis, Shamik Sengupta.
Complex brain networks: graph theoretical analysis of structural and functional systems.
Sara A. Solla Northwestern University
1 Finding Spread Blockers in Dynamic Networks (SNAKDD08)Habiba, Yintao Yu, Tanya Y., Berger-Wolf, Jared Saia Speaker: Hsu, Yu-wen Advisor: Dr. Koh, Jia-Ling.
Speaker : Yu-Hui Chen Authors : Dinuka A. Soysa, Denis Guangyin Chen, Oscar C. Au, and Amine Bermak From : 2013 IEEE Symposium on Computational Intelligence.
Transport in weighted networks: optimal path and superhighways Collaborators: Z. Wu, Y. Chen, E. Lopez, S. Carmi, L.A. Braunstein, S. Buldyrev, H. E. Stanley.
Ch 9. Rhythms and Synchrony 9.7 Adaptive Cooperative Systems, Martin Beckerman, Summarized by M.-O. Heo Biointelligence Laboratory, Seoul National.
Example Apply hierarchical clustering with d min to below data where c=3. Nearest neighbor clustering d min d max will form elongated clusters!
1 Properties of the Duration of Transient Oscillations in a Ring Neural Network Yo Horikawa and Hiroyuki Kitajima Kagawa University Japan.
Distance Vector Routing
Dynamic of Networks at the Edge of Chaos
What is ClassiFire ® ? ClassiFire is a patented Artificial Intelligence system used in the Stratos-HSSD ® range of Aspirating Smoke Detectors. ClassiFire.
Cmpe 588- Modeling of Internet Emergence of Scale-Free Network with Chaotic Units Pulin Gong, Cees van Leeuwen by Oya Ünlü Instructor: Haluk Bingöl.
Machine Learning Supervised Learning Classification and Regression
Structures of Networks
The Watts-Strogatz model
Collins Assisi, Mark Stopfer, Maxim Bazhenov  Neuron 
Department of Computer Science University of York
The Brain as an Efficient and Robust Adaptive Learner
Spontaneous Synchronization of Coupled Circadian Oscillators
OCNC Statistical Approach to Neural Learning and Population Coding ---- Introduction to Mathematical.
Optimal Degrees of Synaptic Connectivity
Volume 66, Issue 6, Pages (June 2010)
Volume 53, Issue 3, Pages (February 2007)
Carlos D. Brody, J.J. Hopfield  Neuron 
Volume 30, Issue 2, Pages (May 2001)
Brendan K. Murphy, Kenneth D. Miller  Neuron 
Volume 40, Issue 6, Pages (December 2003)
Dynamic Processes Shape Spatiotemporal Properties of Retinal Waves
Inducing Gamma Oscillations and Precise Spike Synchrony by Operant Conditioning via Brain-Machine Interface  Ben Engelhard, Nofar Ozeri, Zvi Israel, Hagai.
Volume 96, Issue 4, Pages e5 (November 2017)
Instabilities in the Transient Response of Muscle
Linking Memories across Time via Neuronal and Dendritic Overlaps in Model Neurons with Active Dendrites  George Kastellakis, Alcino J. Silva, Panayiota.
Adaptation without Plasticity
Gamma and Beta Bursts Underlie Working Memory
Multiplexing Visual Signals in the Suprachiasmatic Nuclei
Experience-Dependent Asymmetric Shape of Hippocampal Receptive Fields
H.Sebastian Seung, Daniel D. Lee, Ben Y. Reis, David W. Tank  Neuron 
Collins Assisi, Mark Stopfer, Maxim Bazhenov  Neuron 
Volume 106, Issue 1, Pages (January 2014)
Scale-Change Symmetry in the Rules Governing Neural Systems
Timescales of Inference in Visual Adaptation
Adaptation without Plasticity
Volume 32, Issue 1, Pages (October 2001)
Volume 30, Issue 2, Pages (May 2001)
Volume 24, Issue 8, Pages e6 (August 2018)
The Brain as an Efficient and Robust Adaptive Learner
Jeffrey R. Groff, Gregory D. Smith  Biophysical Journal 
The Impact of Changes in Network Structure on Diffusion of Warnings
Presentation transcript:

Spatiotemporal Networks in Addressable Excitable Media International Workshop on Bio-Inspired Complex Networks in Science and Technology Max Planck Institute for the Physics of Complex Systems Dresden, Germany, May 2008 Co-Workers: Mark Tinsley Aaron Steel Funding: NSF ONR W.M. Keck Foundation

Ru(bipy) BrMA + hν → Br -

Photosensitive BZ Network Dark system is oscillatory. Excitability of medium maintained by reference light intensity. Medium is divided into an array of cells. Non-diffusive jumps from one cell to another (random) cell. Nearest-neighbor interactions described by reaction-diffusion wave. Long range interactions described by non-diffusive jumps. Phys. Rev. Lett. 95, (2005) Chaos 16, (2006)

Static Link Network Local links occur via reaction-diffusion wave. Non-local links occur via reduction of light intensity at destination cell once a source cell reaches threshold. Threshold: 50% excited. 50

Network Architecture Mean path length: the average minimum separation of two nodes within the network. Clustering coefficient: the average number of links between neighbors of an individual node divided by the total possible number of links between these neighbors. Small and large number of links: values reflect the lattice and random graph. Intermediate number links: values typical of small-world networks.

Static Network with 10 Links Oregonator Model Simulations Successive snapshots from left to right Grid: 1000 × 1000 Cells: 20 × 20 grid pts 50 × 50 = 2500 cells Threshold: 50% excited

Static Network with 100 Links

Static Network with 500 Links

Static Networks: Links 10 links 100 Links500 Links

Experimental Static Network with 300 Links Photo BZ experiment Successive snapshots at 15 s intervals Grid: 260 × 260 Cells: 10 × 10 grid pts 26 × 26 = 676 cells Threshold: 50% excited

Time Series of Fractional Coverage (a) Experiments: 26 × 26 node network with 300 nonlocal links (red) and 20 nonlocal links (blue). (b) Simulations: 50 × 50 node network with 200 nonlocal links (red) and 10 nonlocal links (blue).

Time of Travel Shading indicates time of travel from central node to a given node.

Weighted Shortest Distance Between Nodes Local links Nonlocal links Each local link is weighted as 1. Each nonlocal link is weighted as w. We use a shortest path algorithm to calculate the distance between nodes in the network (Dijkstra’s Algorithm). The weight w is chosen as the time necessary to initiate a nonlocal excitation in the BZ system. (w = nonlocal initiation time/local initiation time.) Typically w = 0.4. C The distance between A and B is either 4 (nonlocal links) or 2+ w.

short long Shading of each node indicates the shortest distance between that node and the central node. Shading of each node indicates time of travel of BZ wave to that node from the central node. fast slow Comparison of Network Distance and Time of Travel Model System: 50 x 50 nodes – 100 links DistanceTime of travel

short long Shading of each node indicates the shortest distance between that node and the central node. Shading of each node indicates time of travel of BZ wave to that node from the central node. fast slow Comparison of Network Distance and Time of Travel BZ Experiment: 26 x 26 nodes – 10 links DistanceTime of travel

short long Time of travel vs shortest distance indicates that the excitation propagates through the network via the shortest path between nodes. (Related to determination of optimal paths in a maze, since a maze is equivalent to a network of connected nodes.) fast slow Comparison of Network Distance and Time of Travel Model System: 50 x 50 nodes – 100 links DistanceTime of travel

Frequency Synchronization 50 x 50 node network – 25 nodes shown

Distributed Network Pacemakers For few links: period of excitation loop is highly dependent on the network structure. For > 50 links: period is governed by the period of the excitation cycle. Error bars: standard deviation for 10 network configurations. Excitation loops: links with destination nodes behind waves that excite the source nodes. Period defined by the time required for a wave to travel from the destination node to the source node plus the time for the nonlocal link to re-excite the destination node. Loop structure may have multiple local and nonlocal links.

Phase Synchronization of Nodes R = normalized vector sum of the phases N = number of nodes θ j = phase of the jth node. An R value close to zero indicates that the phases of the individual oscillators are evenly distributed, while an R value close to unity indicates the oscillators are in phase.

Active Links Increasingly large spread in the values arises from increase in possible network configurations. Pruning: a subset of links becomes inactive, while remaining active links account for dynamical behavior. Active link: nonlocal link that results in successful wave initiation at destination cell.

Stability of Active Link Sequence Link sequence unstable to perturbation (b) while stable to perturbation (c). Sequence of active links: destination nodes are labeled according to the order of their excitations. Sequence of initiations is repeated once per coverage oscillation. Perturbation: (b) link 6 removed (c) link 4 removed from t = 24.4 to 40.0

Destination Node Locations of Active Links before and after Destabilizing Perturbation Original perturbation:destination node of link 6 ● Lost: destination node of links 4 ● and 6 ● Gained:destination nodes of links ●

BZ Experiment: Pruning of Links Spontaneous shifting of active links during transient period as system relaxes to asymptotic sequence.

Network Architecture of Active Links Mean path length: the average minimum separation of two nodes within the network. Clustering coefficient: the average number of links between neighbors of an individual node divided by the total possible number of links between these neighbors. Active links have same scaling as random links. However, only 1/3 to 1/4 of the random links are active. Dynamics with 50 active links is approx. same as with 150 random links. Pruning results in network optimization.

Dynamic Network Successive snapshots from left to right. Grid: 1000 × 1000; Cells: 20 × 20 grid pts; Medium: 50 × 50 cells Jump threshold: 50% cell coverage; Jump probability: p = 0.02

Time Series and Power Spectrum Jump probability p = 0.05 Fraction of excited elements

Time Series and Power Spectrum Jump probability p = 0.4 Fraction of excited elements

Experimental Dynamic Link Network Photo BZ experiment Link probability p = 0.5 Successive snapshots at 15 s intervals Grid: 260 × 260 Cells: 10 × 10 grid pts 26 × 26 = 676 cells Threshold: 50% excited

Time Series and Power Spectra Dynamic link network with p = 0.01 (dotted line) and p = 0.50 (solid line). Coverage is the fraction of grid points in excited state. PSD is the power spectral density.

Domain Model Zipf Law for domain distribution. Links to any domain (other than domain of origin) with a fixed probability to random location in any other domain. Links from a domain proportional to departure domain size. Links to a domain ca. proportional to destination domain size (for large populations). Nearest neighbor interactions within a domain determine local spreading. Grid: 1000 × 1000 Cells: 10 × 10 grid pts Largest domain: 260 cells (population 2600)

Domains with Dynamic Links Jump probability p = 0.1

Domains with Dynamic Links Jump probability p = 0.3

Domains with Dynamic Links Jump probability p = 0.5

Time Series for Excitation Coverage p = 0.5 p = 0.3 p = 0.1 ←Collapse!

Domains with Dynamic Links Jump probability p = 0.5

Domains with Dynamic Links: Experiments Jump probability p = 0.05

Domains with Dynamic Links: Experiments Jump probability p = 0.7

Time Series for Excitation Coverage: Experimental

H. Berry, and O. Temam, Lecture Notes in Computer Science, 3512: , (2005) Towards More Realistic Networks: Setting up the Links Neurons do not connect with other neurons randomly over a spatial domain. Neurons have a tendency to connect to nearby neurons and we approximate this tendency by an exponential falloff: P(d) = 1/ξ exp(-d/ξ) where P(d) is the connection probability at distance d, and ξ is the average connection distance parameter.

Nature of Links: Integrate and Fire Neurons are activated according to an integrate and fire mechanism. In the context of the photo-BZ system, we have inputs to a node from all the connected nodes. The inputs are summed up and when they reach a threshold light intensity, the node fires (becomes excited). The destination node then becomes a source node with the excitation passed on according to the integrate and fire mechanism. We have assigned 20% of the links to be inhibitory.

Network Evolution without Diffusive Coupling Evolution of network activity without diffusive coupling: 1600 nodes and 125,000 links with 80% excitatory links (with weight of 0.03) and 20% inhibitory links (with weight of -0.08). Red represents excited state and blue represents steady state.

Network Evolution with Diffusive Coupling Evolution of network activity with diffusive coupling: 1600 nodes and 42,000 links with 80% excitatory links (with weight of 0.03) and 20% inhibitory links (with weight of -0.08). Red represents excited state and blue represents steady state.

Spike Timing-Dependent Plasticity (STDP) w represents the weight of a link, where w → w + wp for potentiation. w → w + wd for depression. = M. Rossum, G. Bi & G. Turrigiano, “Stable Hebbian Learning from Spike Time-Dependent plasticity,” J. Neurosci. 20, 8812 (2000).

Application of STDP Active links affect a target cell, where w j is weight adjusted by changes w p or w d of link j based upon Δt.

Link Weight Distribution Distribution of link weights: 1600 nodes and 125,000 links with 80% excitatory links (initial weight of 0.03) and 20% inhibitory links (not shown, constant weight of -0.08). Excitatory link weight increases from 0.03 to and average of ~0.06 by STDP mechanism.

Weighted Degree Distribution Distribution of the sum of weighted links per node: Histogram shows number of nodes for each sum of weighted links nodes and 125,000 links with 80% excitatory links (with initial weight of 0.03) and 20% inhibitory links (constant weight of -0.08).

Spatiotemporal Networks in Addressable Excitable Media Nearest neighbor spreading: Rxn-Diff wave Non-diffusive spreading: fixed random links Network distance and time of travel Frequency and phase synchronization Dynamic non-diffusive jumps and domain model Integrate and fire with inhibitory links Spike-timing dependent plasticity