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

Slides:

Advertisements

Similar presentations

Relatively HIGH Clustering Coefficient Relatively LOW Characteristic Path Length.

Advertisements

Peer-to-Peer and Social Networks Power law graphs Small world graphs.

Complex Networks Advanced Computer Networks: Part1.

‘Small World’ Networks (An Introduction) Presenter : Vishal Asthana

Small-world networks.

Collective Dynamics of ‘Small World’ Networks C+ Elegans: Ilhan Savut, Spencer Telford, Melody Lim 29/10/13.

Introduction to Neural Networks 2. Overview  The McCulloch-Pitts neuron  Pattern space  Limitations  Learning.

Network biology Wang Jie Shanghai Institutes of Biological Sciences.

CSE 5243 (AU 14) Graph Basics and a Gentle Introduction to PageRank 1.

Analysis and Modeling of Social Networks Foudalis Ilias.

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.

Analysis of Social Media MLD , LTI William Cohen

Advanced Topics in Data Mining Special focus: Social Networks.

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

1 Evolution of Networks Notes from Lectures of J.Mendes CNR, Pisa, Italy, December 2007 Eva Jaho Advanced Networking Research Group National and Kapodistrian.

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.

Lecture 9 Measures and Metrics. Structural Metrics Degree distribution Average path length Centrality Degree, Eigenvector, Katz, Pagerank, Closeness,

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

Global topological properties of biological networks.

Search in a Small World JIN Xiaolong Based on [1].

Small World Networks Somsubhra Sharangi Computing Science, Simon Fraser University.

Advanced Topics in Data Mining Special focus: Social Networks.

Graphs and Topology Yao Zhao. Background of Graph A graph is a pair G =(V,E) –Undirected graph and directed graph –Weighted graph and unweighted graph.

1 Algorithms for Large Data Sets Ziv Bar-Yossef Lecture 7 May 14, 2006

How is this going to make us 100K Applications of Graph Theory.

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

Network Measures Social Media Mining. 2 Measures and Metrics 2 Social Media Mining Network Measures Klout.

Author: M.E.J. Newman Presenter: Guoliang Liu Date:5/4/2012.

Section 8 – Ec1818 Jeremy Barofsky March 31 st and April 1 st, 2010.

LANGUAGE NETWORKS THE SMALL WORLD OF HUMAN LANGUAGE Akilan Velmurugan Computer Networks – CS 790G.

By Chris Zachor.  Introduction  Background  Changes  Methodology  Data Collection  Network Topologies  Measures  Tools  Conclusion  Questions.

Small-world networks. What is it? Everyone talks about the small world phenomenon, but truly what is it? There are three landmark papers: Stanley Milgram.

“Adversarial Deletion in Scale Free Random Graph Process” by A.D. Flaxman et al. Hammad Iqbal CS April 2006.

7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.

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

Science: Graph theory and networks Dr Andy Evans.

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

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.

Complex Networks Measures and deterministic models Philippe Giabbanelli.

A project from the Social Media Research Foundation: Finding direction in a sea of connection:

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

The Structure of the Web. Getting to knowing the Web How big is the web and how do you measure it? How many people use the web? How many use search engines?

Sara A. Solla Northwestern University

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.

Locating data in (small-world?) P2P scientific collaborations Gisik Kwon 6/11/02.

Informatics tools in network science

Network Partition –Finding modules of the network. Graph Clustering –Partition graphs according to the connectivity. –Nodes within a cluster is highly.

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.

Lecture 23: Structure of Networks

Structures of Networks

Figure 1. Competition for establishing neural connections

Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama

Lecture 23: Structure of Networks

Network Science: A Short Introduction i3 Workshop

The Watts-Strogatz model

Section 8.2: Shortest path and small world effect

Shortest path and small world effect

Small World Networks Scotty Smith February 7, 2007.

Department of Computer Science University of York

Network Science: A Short Introduction i3 Workshop

Clustering Coefficients

Lecture 23: Structure of Networks

Lecture 9: Network models CS 765: Complex Networks

Graphs G = (V, E) V are the vertices; E are the edges.

Warm Up – Tuesday Find the critical times for each vertex.

Network Science: A Short Introduction i3 Workshop

Advanced Topics in Data Mining Special focus: Social Networks

Presentation transcript:

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

Background on C. elegans It’s a transparent nematode (roundworm). The hermaphrodite version has a simple nervous system comprising about 302 neurons. It’s neural network is completely mapped. The pattern of connectivity portrays small- world network characteristics.

Recall The characteristic path length L is defined as the number of edges in the shortest path between two vertices, averaged over all pairs of vertices. The clustering coefficient C measures the degree to which nodes in a graph tend to cluster together - how close neighbors are to being a clique.

Procedure for Measuring C – from class

Random Rewiring Procedure p = 0 represents regularity (no edge) p = 1 represents disorder (clique) n = 20 and k = 4

Random Rewiring Procedure For C. elegans, an edge/link joins two neurons if they are connected by a synapse or gap junction. There are n = 282 nodes and k = 14 edges.

NetLogo Models

Cumulative Distribution of Outgoing and Incoming Neural Connections

Questions?