Synchronization and Connectivity of Discrete Complex Systems Michael Holroyd.

Slides:

Advertisements

Similar presentations

1 Generating Network Topologies That Obey Power LawsPalmer/Steffan Carnegie Mellon Generating Network Topologies That Obey Power Laws Christopher R. Palmer.

Advertisements

Topologies of Complex Networks Functions vs. Structures Lun Li Advisor: John C. Doyle Co-advisor: Steven H. Low Collaborators: David Alderson (NPS) Walter.

Complex Networks: Complex Networks: Structures and Dynamics Changsong Zhou AGNLD, Institute für Physik Universität Potsdam.

Mobile Communication Networks Vahid Mirjalili Department of Mechanical Engineering Department of Biochemistry & Molecular Biology.

William Liu1, Harsha Sirisena2, Krzysztof Pawlikowski2

Emergence of Scaling in Random Networks Albert-Laszlo Barabsi & Reka Albert.

It’s a Small World by Jamie Luo. Introduction Small World Networks and their place in Network Theory An application of a 1D small world network to model.

Spike Train Statistics Sabri IPM. Review of spike train  Extracting information from spike trains  Noisy environment:  in vitro  in vivo  measurement.

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

Construction of Simple Graphs with a Target Joint Degree Matrix and Beyond Minas Gjoka, Balint Tillman, Athina Markopoulou University of California, Irvine.

CS 599: Social Media Analysis University of Southern California1 The Basics of Network Analysis Kristina Lerman University of Southern California.

Xiaowei Ying Xintao Wu Univ. of North Carolina at Charlotte 2009 SIAM Conference on Data Mining, May 1, Sparks, Nevada Graph Generation with Prescribed.

4. PREFERENTIAL ATTACHMENT The rich gets richer. Empirical evidences Many large networks are scale free The degree distribution has a power-law behavior.

CSE 522 – Algorithmic and Economic Aspects of the Internet Instructors: Nicole Immorlica Mohammad Mahdian.

Directional triadic closure and edge deletion mechanism induce asymmetry in directed edge properties.

Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.

Scale-free networks Péter Kómár Statistical physics seminar 07/10/2008.

Scale Free Networks Robin Coope April Abert-László Barabási, Linked (Perseus, Cambridge, 2002). Réka Albert and AL Barabási,Statistical Mechanics.

Alon Arad Alon Arad Hurst Exponent of Complex Networks.

Peer-to-Peer and Grid Computing Exercise Session 3 (TUD Student Use Only) ‏

ONR MURI: NexGeNetSci From Consensus to Social Learning in Complex Networks Ali Jadbabaie Skirkanich Associate Professor of innovation Electrical & Systems.

Geometric Spanners for Routing in Mobile Networks Jie Gao, Leonidas Guibas, John Hershberger, Li Zhang, An Zhu.

Global topological properties of biological networks.

Network Motifs Zach Saul CS 289 Network Motifs: Simple Building Blocks of Complex Networks R. Milo et al.

Transport Properties of Fractal and Non-Fractal Scale-Free Networks

On Distinguishing between Internet Power Law B Bu and Towsley Infocom 2002 Presented by.

CS8803-NS Network Science Fall 2013

Optimization Based Modeling of Social Network Yong-Yeol Ahn, Hawoong Jeong.

Network of Networks and the Climate System Potsdam Institute for Climate Impact Research & Institut of Physics, Humboldt-Universität zu Berlin & King‘s.

Clustering of protein networks: Graph theory and terminology Scale-free architecture Modularity Robustness Reading: Barabasi and Oltvai 2004, Milo et al.

1 presentation of article: Small-World File-Sharing Communities Article: Adriana Iamnitchi, Matei Ripeanu, Ian Foster Presentation: Periklis Akritidis.

1 Burning a graph as a model of social contagion Anthony Bonato Ryerson University Institute of Software Chinese Academy of Sciences.

Part 1: Biological Networks 1.Protein-protein interaction networks 2.Regulatory networks 3.Expression networks 4.Metabolic networks 5.… more biological.

Self-Similarity of Complex Networks Maksim Kitsak Advisor: H. Eugene Stanley Collaborators: Shlomo Havlin Gerald Paul Zhenhua Wu Yiping Chen Guanliang.

Emergence of Scaling and Assortative Mixing by Altruism Li Ping The Hong Kong PolyU

Graph Evolution: A Computational Approach Olaf Sporns, Department of Psychological and Brain Sciences Indiana University, Bloomington, IN 47405

Algorithms for Biological Networks Prof. Tijana Milenković Computer Science and Engineering University of Notre Dame Fall 2010.

Networks Igor Segota Statistical physics presentation.

Evolving Our Understanding of The Neural Control of Breathing Jeff Mendenhall College of William and Mary Department of Applied Sciences, Room #314.

Neural Network of C. elegans is a Small-World Network Masroor Hossain Wednesday, February 29 th, 2012 Introduction to Complex Systems.

Modeling Neural Networks Christopher Krycho Advisor: Dr. Eric Abraham May 14, 2009.

Synchronization in complex network topologies

Evolving Our Understanding of the Neural Control of Breathing Jeff Mendenhall College of William and Mary Department of Applied Sciences, Room #314.

Social Networking: Large scale Networks

1 CIS 4930/6930 – Recent Advances in Bioinformatics Spring 2014 Network models Tamer Kahveci.

March 3, 2009 Network Analysis Valerie Cardenas Nicolson Assistant Adjunct Professor Department of Radiology and Biomedical Imaging.

geometric representations of graphs

Community structure in graphs Santo Fortunato. More links “inside” than “outside” Graphs are “sparse” “Communities”

Algorithms and Computational Biology Lab, Department of Computer Science and & Information Engineering, National Taiwan University, Taiwan Network Biology.

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.

Network (graph) Models

Random Walk for Similarity Testing in Complex Networks

Structures of Networks

Gyan Ranjan University of Minnesota, MN

Topics In Social Computing (67810)

Biological networks CS 5263 Bioinformatics.

Empirical analysis of Chinese airport network as a complex weighted network Methodology Section Presented by Di Li.

Generative Model To Construct Blog and Post Networks In Blogosphere

Using Recurrent Neural Networks and Hebbian Learning

The likelihood of linking to a popular website is higher

Enhancing Attack Robustness of Scale-free Networks by Camouflage

Department of Computer Science University of York

Clustering Coefficients

Peer-to-Peer and Social Networks

Graph Theory By Amy C. and John M..

From the Synthetic networks slide deck (didn’t have a chance to go over them at that time) By: Ralucca Gera, NPS.

Enumeration problems of networks

Properties and applications of spectra for networks

Lecture 9: Network models CS 765: Complex Networks

Networks of CR and NCR cells in reeler layer 1

Presentation transcript:

Synchronization and Connectivity of Discrete Complex Systems Michael Holroyd

The neural mechanisms of breathing in mammals Christopher A. Del Negro, Ph.D. John A. Hayes, M.S. Ryland W. Pace, B.S. Dept. of Applied Science The College of William and Mary Del Negro, Morgado-Valle, Mackay, Pace, Crowder, and Feldman. The Journal of Neuroscience 25, , Feldman and Del Negro. Nature Reviews Neuroscience, In press, 2006.

Neural basis for behavior Behavior Networks Cells Molecules Genes Networks Cells Molecules Networks

In vitro breathing Neonatal rodent Smith et al. J.Neurophysiol µm

In vitro breathing PreBötzinger Complex

Experimental Preparation

Questions What does the PreBötzinger Complex network look like? What type of networks are best at synchronizing?

Laplacian Matrix Laplacian = Degree – Adjacency matrix Positive semi-definite matrix –All eigenvalues are real numbers greater than or equal to 0.

Algebraic Connectivity λ 1 = 0 is always an eigenvalue of a Laplacian matrix λ 2 is called the algebraic connectivity, and is a good measure of synchronizability. Despite having the same degree sequence, the graph on the left seems weakly connected. On the left λ 2 = and on the right λ 2 = 0.925

Geometric graphs Construction: Place nodes at random locations inside the unit circle, and connect any nodes within a radius r of each other.

λ 2 of Poisson random graphs

λ 2 of preferential attachment graphs

λ 2 of geometric graphs

Degree preserving rewiring A BD CA BD C This allows us to sample from the set of graphs with the same degree sequence.

Scale-free metric -- s(G) First defined by Li et. al. in Towards a Theory of Scale-free Graphs Graphs with low s(G) are scale-free, while graphs with high s(G) are scale-rich.

λ 2 vs. s(G)

λ 2 vs. clustering coefficient

Back to the PreBötzinger Complex Using a simulation of the PreBötzinger Complex, we can simulate networks with different λ 2 values.

Synchronizability Neuron output from PreBötzinger complex simulation. Synchronization when λ 2 = (left) is relatively poor compared to λ 2 = (right).

Correlation analysis Closer values of λ 2 can be difficult to distinguish from a raster plot.

Autocorrelation analysis Autocorrelation analysis confirms that the higher λ 2 network displays better synchronization.

Further work Find a physical network characteristic associated with high algebraic connectivity. Maximal shortest path looks like a good candidate: