TOPDRIM: Update WP2 March 2013 Rick Quax, Peter M.A. Sloot.

Slides:



Advertisements
Similar presentations
Welcome to the NEW AP Biology The first exam was given in May National results were a bell curve.
Advertisements

Learning School of Computing, University of Leeds, UK AI23 – 2004/05 – demo 2.
Capacity of MIMO Channels: Asymptotic Evaluation Under Correlated Fading Presented by: Zhou Yuan University of Houston 10/22/2009.
DREAM4 Puzzle – inferring network structure from microarray data Qiong Cheng.
SEM PURPOSE Model phenomena from observed or theoretical stances
Rick Quax Postdoctoral researcher Computational Science University of Amsterdam EU FP7 projects: Nudge control through information processing.
Reinforcement Learning (II.) Exercise Solutions Ata Kaban School of Computer Science University of Birmingham 2003.
Self-Organised information PrOcessing, CriticaLity and Emergence in multilevel Systems Alfons Hoekstra
DYNAMICS OF RANDOM BOOLEAN NETWORKS James F. Lynch Clarkson University.
Some questions o What are the appropriate control philosophies for Complex Manufacturing systems? Why????Holonic Manufacturing system o Is Object -Oriented.
Modeling Malware Spreading Dynamics Michele Garetto (Politecnico di Torino – Italy) Weibo Gong (University of Massachusetts – Amherst – MA) Don Towsley.
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.
Data Mining Glen Shih CS157B Section 1 Dr. Sin-Min Lee April 4, 2006.
4. PREFERENTIAL ATTACHMENT The rich gets richer. Empirical evidences Many large networks are scale free The degree distribution has a power-law behavior.
Hierarchy in networks Peter Náther, Mária Markošová, Boris Rudolf Vyjde : Physica A, dec
HIV dynamics in sequence space Shiwu Zhang Based on [Kamp2002from, Kamp2002co-evolution]
Temporal Action-Graph Games: A New Representation for Dynamic Games Albert Xin Jiang University of British Columbia Kevin Leyton-Brown University of British.
April “ Despite the increasing importance of mathematics to the progress of our economy and society, enrollment in mathematics programs has been.
1 Epidemic Spreading in Real Networks: an Eigenvalue Viewpoint Yang Wang Deepayan Chakrabarti Chenxi Wang Christos Faloutsos.
Financial Networks with Static and dynamic thresholds Tian Qiu Nanchang Hangkong University.
802.11n MAC layer simulation Submitted by: Niv Tokman Aya Mire Oren Gur-Arie.
ONR MURI: NexGeNetSci From Consensus to Social Learning in Complex Networks Ali Jadbabaie Skirkanich Associate Professor of innovation Electrical & Systems.
1 IMPROVING RESPONSIVENESS BY LOCALITY IN DISTRIBUTED VIRTUAL ENVIRONMENTS Luca Genovali, Laura Ricci, Fabrizio Baiardi Lucca Institute for Advanced Studies.
1 A. Derivation of GL equations macroscopic magnetic field Several standard definitions: -Field of “external” currents -magnetization -free energy II.
Simulation Models as a Research Method Professor Alexander Settles.
How much investment can financial markets cope with?  A personal perspective  Financial correlations: Why are stocks correlated? [structure/exogenous]
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
Towards A Multi-Agent System for Network Decision Analysis Jan Dijkstra.
1 10. Joint Moments and Joint Characteristic Functions Following section 6, in this section we shall introduce various parameters to compactly represent.
LÊ QU Ố C HUY ID: QLU OUTLINE  What is data mining ?  Major issues in data mining 2.
Models of Influence in Online Social Networks
UML - Development Process 1 Software Development Process Using UML (2)
2 Introduction: phase transition phenomena Phase transition: qualitative change as a parameter crosses threshold Matter temperature magnetism demagnetism.
Tennessee Technological University1 The Scientific Importance of Big Data Xia Li Tennessee Technological University.
Lecture 11: Ising model Outline: equilibrium theory d = 1
L14. Fair networks and topology design D. Moltchanov, TUT, Spring 2008 D. Moltchanov, TUT, Spring 2015.
Data Analysis in YouTube. Introduction Social network + a video sharing media – Potential environment to propagate an influence. Friendship network and.
V5 Epidemics on networks
Associative Memory by Recurrent Neural Networks with Delay Elements Seiji MIYOSHI Hiro-Fumi YANAI Masato OKADA Kobe City College of Tech. Ibaraki Univ.
Pricing Combinatorial Markets for Tournaments Presented by Rory Kulz.
Introduction to Quantum Chaos
Robotica Lecture 3. 2 Robot Control Robot control is the mean by which the sensing and action of a robot are coordinated The infinitely many possible.
Interacting Viruses in Networks: Can Both Survive? Authors: Alex Beutel, B. Aditya Prakash, Roni Rosenfeld, and Christos Faloutsos Presented by: Zachary.
Emergence of Scaling and Assortative Mixing by Altruism Li Ping The Hong Kong PolyU
Chemical Reaction on the Born-Oppenheimer surface and beyond ISSP Osamu Sugino FADFT WORKSHOP 26 th July.
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.
Robustness of complex networks with the local protection strategy against cascading failures Jianwei Wang Adviser: Frank,Yeong-Sung Lin Present by Wayne.
Futures Lab: Biology Greenhouse gasses. Carbon-neutral fuels. Cleaning Waste Sites. All of these problems have possible solutions originating in the biology.
Analyzing the Vulnerability of Superpeer Networks Against Attack Niloy Ganguly Department of Computer Science & Engineering Indian Institute of Technology,
ECE 466/658: Performance Evaluation and Simulation Introduction Instructor: Christos Panayiotou.
Introduction to Models Lecture 8 February 22, 2005.
Brief Announcement : Measuring Robustness of Superpeer Topologies Niloy Ganguly Department of Computer Science & Engineering Indian Institute of Technology,
Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.
DEPARTMENT/SEMESTER ME VII Sem COURSE NAME Operation Research Manav Rachna College of Engg.
Network applications Sushmita Roy BMI/CS 576 Dec 9 th, 2014.
Runge Kutta schemes Taylor series method Numeric solutions of ordinary differential equations.
Algorithms and Computational Biology Lab, Department of Computer Science and & Information Engineering, National Taiwan University, Taiwan Network Biology.
Scale-free and Hierarchical Structures in Complex Networks L. Barabasi, Z. Dezso, E. Ravasz, S.H. Yook and Z. Oltvai Presented by Arzucan Özgür.
Chapter 01 Understanding Hospitality Information Systems and Information Technology 石岳峻 博士.
Dynamics of Learning & Distributed Adaptation
A Dual System Approach to Policy Process
Theo Gutman-Solo.
Generic and Automatic Address Configuration for Data Center Networks
Dynamics of Learning & Distributed Adaptation James P
Department of Computer Science University of York
EMIS 8374 Shortest Path Problems: Introduction Updated 9 February 2008
Market-based Dynamic Task Allocation in Mobile Surveillance Systems
Human-centered Machine Learning
Journal Club Physical Review E
Presentation transcript:

TOPDRIM: Update WP2 March 2013 Rick Quax, Peter M.A. Sloot

Outline Our research so far (birds eye view) Information dissipation (ID) in networks ID in immune response to HIV ID in financial market Addressing WP2 tasks Ideas for collaboration

Our view of a complex system node dynamics + complex network = complex system += Each node has a state which it changes over time Nodes interact with each other i.e., their states influence each other The system behavior is complex compared to an individual node

Our view of a complex system node dynamics + complex network = complex system += Each node has a state which it changes over time Nodes interact with each other i.e., their states influence each other The system behavior is complex compared to an individual node problem

Information processing in complex systems Node ANode B state interaction Lets say the state of A influences the state of B…

Information processing in complex systems Node ANode B state interaction We would like to see influence spreading

Information processing in complex systems Different influences spread through the network simultaneously Node A state interaction Node B Node C state Node D state How to make make this quantitative?

Solution: information theory? Node A state Entropy: Mutual information Node A state Node B state How much information is stored in A? How much information in A is also in B? (pitfall: MI = causality + correlation)

Information dissipation Information dissipation time Information dissipation length measures of influence of a single node to the behavior of the entire network! How long is the information about a nodes state retained in the network? How far can the information about a nodes state reach before it is lost?

Our research #1

Information dissipation time Node dynamics: (local) Gibbs measure I.e., edges represent an interaction potential to which a node can quasi-equilibrate Network structure Large Randomized beyond degree distribution grows less than linear in

Results: analytical and numerical Number of interactions of a node Information dissipation time D(s) of a node s proof: D(s) will eventually be a decreasing function of k s

Our research #2

Susceptibility of HIV immune response to perturbation Cell types in immune response and their interactions Susceptibility of immune system Agent-based simulations IDT

Our research #3

Leading indicator in financial markets We are now working on an agent-based model of banks that create a dynamic network of IRS contracts, to study critical transitions

How this fit the Tasks in WP2

Task 2.1 (…) In particular, UvA will derive an analytical expression for the information dissipation. We have defined and analyzed both information dissipation time as well as information dissipation length IDT in review process at J. R. Soc. Interface IDL in review process at Scientific Reports

Task 2.2 Susceptibility of immune system Cell types in immune response and their interactions UvA will study the decay rate of information as function of noise to identify it as a universal measure of how susceptible the system is to noise (…) for a variety of network topologies We did not yet start this exact task –Possible collaboration: compare this measure with the barcode of the network –We are exploring an implementation in the Computational Exploratory (Sophocles) However, we are studying a more specific problem: How susceptible is the HIV immune response to perturbations (such as therapy) over time? Application: at which moment in time should HIV- treatment be started? Complex network in the sense that the node dynamics are complex, not the network topology

Task 2.3 UvA will develop a critical dissipation threshold which any system must exceed before it can transition as a whole. We do not (yet) have an analytical expression for a threshold We have studied the use of information dissipation length to detect a critical transition (Lehman Brothers) in the financial derivatives market (real data) In revision process at Scientific Reports

Task 2.4 Refine and integrate …