Unifying Dynamical Systems and Complex Networks Theories ~ A Proposal of “Generative Network Automata (GNA)” ~ Unifying Dynamical Systems and Complex Networks.

Slides:



Advertisements
Similar presentations
Complexity Settlement Simulation using CA model and GIS (proposal) Kampanart Piyathamrongchai University College London Centre for Advanced Spatial Analysis.
Advertisements

Self-Organised information PrOcessing, CriticaLity and Emergence in multilevel Systems Alfons Hoekstra
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks Xiaorui Wang, Guoliang Xing, Yuanfang Zhang*, Chenyang Lu, Robert Pless,
Beyond Trilateration: On the Localizability of Wireless Ad Hoc Networks Reported by: 莫斌.
COORDINATION and NETWORKING of GROUPS OF MOBILE AUTONOMOUS AGENTS.
Lectures on Cellular Automata Continued Modified and upgraded slides of Martijn Schut Vrij Universiteit Amsterdam Lubomir Ivanov Department.
Anna Philippou Department of Computer Science University of Cyprus Joint work with Mauricio Toro Department of Comp. Sc. EAFIT University Christina Kassara.
Cellular Automata, Part 2. What is the relationship between the dynamics of cellular automata and their ability to compute?
Chapter 4 DECISION SUPPORT AND ARTIFICIAL INTELLIGENCE
April “ Despite the increasing importance of mathematics to the progress of our economy and society, enrollment in mathematics programs has been.
Network Morphospace Andrea Avena-Koenigsberger, Joaquin Goni Ricard Sole, Olaf Sporns Tung Hoang Spring 2015.
Research of Network Science Prof. Cheng-Shang Chang ( 張正尚教授 ) Institute of Communications Engineering National Tsing Hua University Hsinchu Taiwan
Chapter 5 Normalization of Database Tables
Application of Graph Theory to OO Software Engineering Alexander Chatzigeorgiou, Nikolaos Tsantalis, George Stephanides Department of Applied Informatics.
Lectures on Cellular Automata Continued Modified and upgraded slides of Martijn Schut Vrij Universiteit Amsterdam Lubomir Ivanov Department.
Saturday 1 SN4CI. November 2005SNAC2 Words (used across 3 or more groups) Defined: community, scope Identifying: developers, early adopters, mechanism.
Two Dimensions and Beyond From: “ A New Kind of Science” by Stephen Wolfram Presented By: Hridesh Rajan.
Nawaf M Albadia Introduction. Components. Behavior & Characteristics. Classes & Rules. Grid Dimensions. Evolving Cellular Automata using Genetic.
Chapter 3 Data Models.
MASS: From Social Science to Environmental Modelling Hazel Parry
Large-scale organization of metabolic networks Jeong et al. CS 466 Saurabh Sinha.
COGNITIVE RADIO FOR NEXT-GENERATION WIRELESS NETWORKS: AN APPROACH TO OPPORTUNISTIC CHANNEL SELECTION IN IEEE BASED WIRELESS MESH Dusit Niyato,
An Automated Component-Based Performance Experiment and Modeling Environment Van Bui, Boyana Norris, Lois Curfman McInnes, and Li Li Argonne National Laboratory,
The Role of Artificial Life, Cellular Automata and Emergence in the study of Artificial Intelligence Ognen Spiroski CITY Liberal Studies 2005.
Complex network geometry and navigation Dmitri Krioukov CAIDA/UCSD F. Papadopoulos, M. Kitsak, kc claffy, A. Vahdat M. Á. Serrano, M. Boguñá UCSD, December.
Neural and Evolutionary Computing - Lecture 10 1 Parallel and Distributed Models in Evolutionary Computing  Motivation  Parallelization models  Distributed.
1 Adaptive QoS Framework for Wireless Sensor Networks Lucy He Honeywell Technology & Solutions Lab No. 430 Guo Li Bin Road, Pudong New Area, Shanghai,
Artificial Neural Networks (ANN). Output Y is 1 if at least two of the three inputs are equal to 1.
Formalizing the Asynchronous Evolution of Architecture Patterns Workshop on Self-Organizing Software Architectures (SOAR’09) September 14 th 2009 – Cambrige.
1 IE 607 Heuristic Optimization Particle Swarm Optimization.
Simulating Human Agropastoral Activities Using Hybrid Agent- Landscape Modeling M. Barton School of Human Evolution and Social Change College of Liberal.
Locating Mobile Agents in Distributed Computing Environment.
Trust Propagation using Cellular Automata for UbiComp 28 th May 2004 —————— Dr. David Llewellyn-Jones, Prof. Madjid Merabti, Dr. Qi Shi, Dr. Bob Askwith.
Model Iteration Iteration means to repeat a process and is sometimes referred to as looping. In ModelBuilder, you can use iteration to cause the entire.
Uncovering Overlap Community Structure in Complex Networks using Particle Competition Fabricio A. Liang
Social Network Analysis Prof. Dr. Daning Hu Department of Informatics University of Zurich Mar 5th, 2013.
The Science of Complexity J. C. Sprott Department of Physics University of Wisconsin - Madison Presented to the First National Conference on Complexity.
Slide 12.1 Chapter 12 Implementation. Slide 12.2 Learning outcomes Produce a plan to minimize the risks involved with the launch phase of an e-business.
Lesson Overview 3.1 Components of the DBMS 3.1 Components of the DBMS 3.2 Components of The Database Application 3.2 Components of The Database Application.
A Single-Pass Cache Simulation Methodology for Two-level Unified Caches + Also affiliated with NSF Center for High-Performance Reconfigurable Computing.
Project funded by the Future and Emerging Technologies arm of the IST Programme FET-Open scheme Project funded by the Future and Emerging Technologies.
Cellular Automata Machine For Pattern Recognition Pradipta Maji 1 Niloy Ganguly 2 Sourav Saha 1 Anup K Roy 1 P Pal Chaudhuri 1 1 Department of Computer.
Complexity Bruce Kogut October We are entering the epoch of the digitalization of knowledge: past, present, and future Sciences bring to this new.
Taguchi. Abstraction Optimisation of manufacturing processes is typically performed utilising mathematical process models or designed experiments. However,
Yongqin Gao, Greg Madey Computer Science & Engineering Department University of Notre Dame © Copyright 2002~2003 by Serendip Gao, all rights reserved.
Neural Networks and Machine Learning Applications CSC 563 Prof. Mohamed Batouche Computer Science Department CCIS – King Saud University Riyadh, Saudi.
A Software Framework for Distributed Services Michael M. McKerns and Michael A.G. Aivazis California Institute of Technology, Pasadena, CA Introduction.
Comparing Snapshots of Networks Shah Jamal Alam and Ruth Meyer Centre for Policy Modelling 28 th March, 2007 – CAVES Bi-annual Meeting, IIASA,
Causality, symmetry, brain, evolution, DNA, and a new theory of Physics Sergio Pissanetzky 1.
Plethora: Infrastructure and System Design. Introduction Peer-to-Peer (P2P) networks: –Self-organizing distributed systems –Nodes receive and provide.
Cellular Automata BIOL/CMSC 361: Emergence 2/12/08.
Chia Y. Han ECECS Department University of Cincinnati Kai Liao College of DAAP University of Cincinnati Collective Pavilions A Generative Architectural.
Internet of Things. IoT Novel paradigm – Rapidly gaining ground in the wireless scenario Basic idea – Pervasive presence around us a variety of things.
Computer Simulation of Networks ECE/CSC 777: Telecommunications Network Design Fall, 2013, Rudra Dutta.
An Effective Method to Improve the Resistance to Frangibility in Scale-free Networks Kaihua Xu HuaZhong Normal University.
Object storage and object interoperability
Complexity Settlement Simulation using CA model and GIS (proposal) Kampanart Piyathamrongchai University College London Centre for Advanced Spatial Analysis.
Adaptive Integrated Framework (AIF): a new methodology for managing impacts of multiple stressors in coastal ecosystems A bit more on AIF, project components.
Discrete, Amorphous Physical Models Erik Rauch Digital Perspectives on Physics Workshop.
Smart Sleeping Policies for Wireless Sensor Networks Venu Veeravalli ECE Department & Coordinated Science Lab University of Illinois at Urbana-Champaign.
Using Qualitative Methods to Identify System Dynamics and Inform System Evaluation Design Margaret Hargreaves Mathematica Policy Research American Evaluation.
Pattern Recognition. What is Pattern Recognition? Pattern recognition is a sub-topic of machine learning. PR is the science that concerns the description.
The Problem of Pattern and Scale in Ecology - Summary What did this paper do that made it a citation classic? 1.It summarized a large body of work on spatial.
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Hiroki Sayama NECSI Summer School 2008 Week 3: Methods for the Study of Complex Systems Cellular Automata Hiroki Sayama
L – Modeling and Simulating Social Systems with MATLAB
Self transforming to power law topology for overlay networks.
Computer Simulation of Networks
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Cellular Automata Hiroki Sayama
Presentation transcript:

Unifying Dynamical Systems and Complex Networks Theories ~ A Proposal of “Generative Network Automata (GNA)” ~ Unifying Dynamical Systems and Complex Networks Theories ~ A Proposal of “Generative Network Automata (GNA)” ~ Hiroki Sayama Department of Bioengineering, Binghamton University, SUNY

2 What’s Been Used in Complex Systems Research (1) Nonlinear dynamical systems Nonlinear dynamical systems — Ordinary / partial differential equations — Iterative maps — Artificial neural networks — Random Boolean networks — Cellular automata Describe dynamics in a phase space with fixed dimensions; no topological changes Describe dynamics in a phase space with fixed dimensions; no topological changes

3 What’s Been Used in Complex Systems Research (2) Complex network growth models Complex network growth models — Recent advances of “network science” — Small-world / scale-free networks Describe statistical properties of complex networks resulting from exogenous topological transformations Describe statistical properties of complex networks resulting from exogenous topological transformations — Limited attention paid to dynamical state transitions; no autonomous topological transformations

4 What’s Missing in Them? Many real-world complex systems change their states and topologies simultaneously due to their own dynamical rules Many real-world complex systems change their states and topologies simultaneously due to their own dynamical rules SystemNodesEdges States of nodes Topological changes OrganismCells Intercellular communication channels Gene/protein activities Fission and death of cells during development Ecological community Species Interspecific relationships Population Speciation, invasion, extinction of species Human society Individual Conversations, social relation- ships Social, professional, economical, political, cultural statuses Changes in social relationships, entry and withdrawal of individuals Communica- tion network Terminals, hubs Cables, wireless connections Information stored and transacted Addition and removal of terminal or hub nodes

5 Objective To develop a novel modeling framework “Generative Network Automata (GNA)” that can effectively describe the dynamics of a broader class of complex systems whose states and topologies both keep changing due to their own dynamical rules To develop a novel modeling framework “Generative Network Automata (GNA)” that can effectively describe the dynamics of a broader class of complex systems whose states and topologies both keep changing due to their own dynamical rules — This is uniquely achieved by integrating Nonlinear dynamical systems (automata) Nonlinear dynamical systems (automata) Complex network growth models Complex network growth models Generative graph grammars Generative graph grammars

6 Configuration Defined as a directed graph where each node has a state s i ∊ S Defined as a directed graph where each node has a state s i ∊ S Config. at time t is given by : Config. at time t is given by : — V t A set of nodes — C t : V t  S States of nodes — L t : V t  V t * Ordered lists of neighbors

7 Dynamics Evolution of GNA is described as a repetitive rewriting process Evolution of GNA is described as a repetitive rewriting process Defined by : Defined by : — E : Extraction mechanism Selects part of GNA (subGNA) for rewriting Selects part of GNA (subGNA) for rewriting — R : Replacement mechanism Produces a new subGNA as a replacement Produces a new subGNA as a replacement Specifies how to embed it into the rest of the GNA Specifies how to embed it into the rest of the GNA — I : Initial configuration

8 A Rewriting Event (a) (b) (c) (d) (a) E selects part of the GNA. (b) R produces a new subGNA as a replacement of the old subGNA and also specifies the correspondence of nodes between old and new subGNAs. The “bridge” edges that used to exist between the old subGNA and the rest of the GNA remain unconnected and open. (c) The new subGNA is embedded into the rest of the GNA according to the node correspondence. (d) The updated configuration after this rewriting event. E R

9 Handling Multiple Rewritings Rewriting is typically defined as asynchronous processes Rewriting is typically defined as asynchronous processes — Synchronous scheme may cause conflicts between multiple rewriting events GNA may be updated synchronously if GNA may be updated synchronously if — rewriting rules are all context-free (i.e., E always selects just one node), or — GNA is used to simulate conventional dynamical networks, etc.

10 Simulation Software Preliminary simulator implemented as an add-on package in Wolfram Research Mathematica Preliminary simulator implemented as an add-on package in Wolfram Research Mathematica — Still under development but available upon request Development of full-scale simulation software planned Development of full-scale simulation software planned

11 Generality of GNA GNA can uniformly represent in : GNA can uniformly represent in : — Conventional dynamical systems models If R always conserves local network topologies and modifies states of nodes only If R always conserves local network topologies and modifies states of nodes only E.g. CA, ANNs, RBNs E.g. CA, ANNs, RBNs — Complex network growth models If R causes no change in local states of nodes and modifies topologies of networks only If R causes no change in local states of nodes and modifies topologies of networks only E.g. small-world, scale-free networks E.g. small-world, scale-free networks

12 Summary Proposed GNA, a novel modeling framework of complex systems Proposed GNA, a novel modeling framework of complex systems — Describes both state transitions and topology transformations via repetitive rewritings — Provides a common “format” of modeling applicable to diverse fields Demonstrated its generality and explored possible dynamics in its simplest form Demonstrated its generality and explored possible dynamics in its simplest form Poster/preprints available Poster/preprints available

13 What’s Next Develop appropriate metrics for local rewriting rules, resulting global networks, and their quantitative relationships Evaluate the designability/controllability of GNA evolution Develop efficient simulation/analysis tools Apply GNA to real-world problems — — Modeling morphogenesis, social dynamics, self-organization of collective intelligence