Complexity reading group Presentation by: Thomas de Haan Paper by: J. Lorenz, S. Battison and F. Schweitzer.

Slides:



Advertisements
Similar presentations
Jacob Goldenberg, Barak Libai, and Eitan Muller
Advertisements

Probability in Propagation
Mobility Increase the Capacity of Ad-hoc Wireless Network Matthias Gossglauser / David Tse Infocom 2001.
Marzieh Parandehgheibi
Cadence Design Systems, Inc. Why Interconnect Prediction Doesn’t Work.
DYNAMICS OF RANDOM BOOLEAN NETWORKS James F. Lynch Clarkson University.
Applied systemic approach in the banking sector: financial contagion in the “cheques-as-collateral” network Michalis Vafopoulos joint work with D. Soumpekas.
School of Information University of Michigan Network resilience Lecture 20.
Systemic risk in micro level: the case of “cheques-as-collateral” network Michalis Vafopoulos, vafopoulos.org joint work with D. Soumpekas and V. Angelis.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
Critical Transitions in Nature and Society Marten Scheffer.
The energy of the electrostatic field of conductors EDII Sec2.
Spontaneous recovery in dynamic networks Advisor: H. E. Stanley Collaborators: B. Podobnik S. Havlin S. V. Buldyrev D. Kenett Antonio Majdandzic Boston.
How to Profit from Leveraging Customer Life Cycle Segmentation Frameworks for Employee Life Cycle Management.
Hierarchy in networks Peter Náther, Mária Markošová, Boris Rudolf Vyjde : Physica A, dec
Directional triadic closure and edge deletion mechanism induce asymmetry in directed edge properties.
Spatial Statistics II RESM 575 Spring 2010 Lecture 8.
Linear dynamic systems
1 Epidemic Spreading in Real Networks: an Eigenvalue Viewpoint Yang Wang Deepayan Chakrabarti Chenxi Wang Christos Faloutsos.
Simulation.
Before start… Earlier work single-path routing in sensor networks
Fitting models to data. Step 5) Express the relationships mathematically in equations Step 6)Get values of parameters Determine what type of model you.
1 A Generic Mean Field Convergence Result for Systems of Interacting Objects From Micro to Macro Jean-Yves Le Boudec, EPFL Joint work with David McDonald,
1 Ivan Lanese Computer Science Department University of Bologna Italy Concurrent and located synchronizations in π-calculus.
Modeling Urban Land-use with Cellular Automata Geog 232: Geo-Simulation Sunhui(Sunny) Sim February 7 th, 2005.
Statistical Methods for long-range forecast By Syunji Takahashi Climate Prediction Division JMA.
MATHEMATICS 3 Operational Analysis Štefan Berežný Applied informatics Košice
SDN: Systemic Risks due to Dynamic Load Balancing Vladimir Marbukh IRTF SDN.
The Effects of Systemic Packets Loss on Aggregate TCP Flows Thomas J. Hacker May 8, 2002 Internet 2 Member Meeting.
01/16/2002 Reliable Query Reporting Project Participants: Rajgopal Kannan S. S. Iyengar Sudipta Sarangi Y. Rachakonda (Graduate Student) Sensor Networking.
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
Presented by: Chaitanya K. Sambhara Paper by: Maarten Ditzel, Caspar Lageweg, Johan Janssen, Arne Theil TNO Defence, Security and Safety, The Hague, The.
1 Applications of Relative Importance  Why is relative importance interesting? Web Social Networks Citation Graphs Biological Data  Graphs become too.
Fluid Limits for Gossip Processes Vahideh Manshadi and Ramesh Johari DARPA ITMANET Meeting March 5-6, 2009 TexPoint fonts used in EMF. Read the TexPoint.
Natural Gradient Works Efficiently in Learning S Amari (Fri) Computational Modeling of Intelligence Summarized by Joon Shik Kim.
CSS-TW1 Cooperation in Selfish Systems incorporating TagWorld I Welcome! David Hales, University of Bologna.
1 Local search and optimization Local search= use single current state and move to neighboring states. Advantages: –Use very little memory –Find often.
+ Mayukha Bairy Disk Intersection graphs and CDS as a backbone in wireless ad hoc networks.
A Markov Random Field Model for Term Dependencies Donald Metzler W. Bruce Croft Present by Chia-Hao Lee.
Network Survivability Against Region Failure Signal Processing, Communications and Computing (ICSPCC), 2011 IEEE International Conference on Ran Li, Xiaoliang.
CprE 458/558: Real-Time Systems (G. Manimaran)1 CprE 458/558: Real-Time Systems Distributed Real-Time Systems (contd.)
Coordination with Local Information Munther Dahleh Alireza Tahbaz-Salehi, John Tsitsiklis Spyros Zoumpouli.
Robustness of complex networks with the local protection strategy against cascading failures Jianwei Wang Adviser: Frank,Yeong-Sung Lin Present by Wayne.
Analyzing the Vulnerability of Superpeer Networks Against Attack Niloy Ganguly Department of Computer Science & Engineering Indian Institute of Technology,
Mitigation strategies on scale-free networks against cascading failures Jianwei Wang Adviser: Frank,Yeong-Sung Lin Present by Chris Chang.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Competitive Scheduling in Wireless Networks with Correlated Channel State Ozan.
Optimal Placement of Energy Storage in Power Networks Christos Thrampoulidis Subhonmesh Bose and Babak Hassibi Joint work with 52 nd IEEE CDC December.
 Probability in Propagation. Transmission Rates  Models discussed so far assume a 100% transmission rate to susceptible individuals (e.g. Firefighter.
Tractable Inference for Complex Stochastic Processes X. Boyen & D. Koller Presented by Shiau Hong Lim Partially based on slides by Boyen & Koller at UAI.
DASC_Network_Theory.ppt1 Network Theory Implications In Air Transportation Systems Dr. Bruce J. Holmes, NASA Digital Avionics Systems.
Improved Competitive Ratios for Submodular Secretary Problems ? Moran Feldman Roy SchwartzJoseph (Seffi) Naor Technion – Israel Institute of Technology.
Brief Announcement : Measuring Robustness of Superpeer Topologies Niloy Ganguly Department of Computer Science & Engineering Indian Institute of Technology,
A Unified Continuous Greedy Algorithm for Submodular Maximization Moran Feldman Roy SchwartzJoseph (Seffi) Naor Technion – Israel Institute of Technology.
Global Clock Synchronization in Sensor Networks Qun Li, Member, IEEE, and Daniela Rus, Member, IEEE IEEE Transactions on Computers 2006 Chien-Ku Lai.
Joint Base Station and Relay Station Placement for IEEE j Networks Hsiao-Chen Lu and Wanjiun Liao Department of Electrical Engineering, National.
Asymptotic Behavior of Stochastic Complexity of Complete Bipartite Graph-Type Boltzmann Machines Yu Nishiyama and Sumio Watanabe Tokyo Institute of Technology,
Asymptotic Analysis for Large Scale Dynamic Stochastic Games Sachin Adlakha, Ramesh Johari, Gabriel Weintraub and Andrea Goldsmith DARPA ITMANET Meeting.
1 Dr. Michael D. Featherstone Introduction to e-Commerce Network Theory 101.
Network Dynamics and Simulation Science Laboratory Structural Analysis of Electrical Networks Jiangzhuo Chen Joint work with Karla Atkins, V. S. Anil Kumar,
Institute of Statistics and Decision Sciences In Defense of a Dissertation Submitted for the Degree of Doctor of Philosophy 26 July 2005 Regression Model.
1 Numerical Methods for Power Networks Kees Vuik, Scientific Computing TU Delft The mathematics of future energy systems CWI, June 6, 2016.
The simultaneous evolution of author and paper networks
COmbining Probable TRAjectories — COPTRA
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Recommendation Based Trust Model with an Effective Defense Scheme for ManetS Adeela Huma 02/02/2017.
Eduardo Ismael Hernández UPAEP University, MEXICO
Analytics and OR DP- summary.
Routing in Wireless Ad Hoc Networks by Analogy to Electrostatic Theory
Internet of Things A Process Calculus Approach
CASE − Cognitive Agents for Social Environments
Presentation transcript:

Complexity reading group Presentation by: Thomas de Haan Paper by: J. Lorenz, S. Battison and F. Schweitzer

Short recap Focus on dynamical systems with potential critical transitions, hysteresis, etc. Examples, discussion on how to find statistical evidence and presence of ‘early warning signals’ for coming transitions. But what about…

Emergence How to go from local interactions to global phenomenon. ‘Aggregation’, or what comes before the dynamical system is written down. Simulations: Network model, game of life Proof of emergent properties: Cucker and Smale What other tools do we have to analyze these systems?

Article of today Systemic risk in a unifying framework for cascading processes on networks. Using network analysis to model systemic risk. Risk level depends on presence of ‘cascades’ Different kind of interactions between nodes. (which induce difference in global dynamics) Aggregation tools in this paper:  From individual node characteristics to distributions  Mean field approach

The Network

The Network (2)

Micro-dynamics 3 model classes  Constant load  Load distribution  Overload distribution

Constant load Failure of node i causes a predetermined increase of fragility to it’s neighbors 2 variants Inward variant: fragility of node i depends on the number of failed neighbors Outward variant: increase in fragility of i if neighbor j fails depends on number of neighbors of j.

Load distribution When node i fails, all of it’s load (fragility) is redistributed among “neighbors”. 2 variants LLSC variant: load is redistributed via failed nodes to the nearest surviving nodes. (which could just be the neighbors) LLSS variant: load is redistributed only to the surviving neighbors. In case of no surviving neighbors, load is ‘shed’.

Overload distribution When node i fails, only difference between the load and the capacity, the net fragility, is distributed among neighbors. (Think of bankruptcy). Also here 2 variants LLSC LLSS

Aggregation, step 1.

Aggregation, step 2

Aggregation (finish)

Results Let failing thresholds be normally distributed such that initial net fragility distribution is equal over all cases.

Results Constand load. Load redistribution Overload redistribution

Extensions Taking into account network topology (for example by assuming each node has k neighbors). Writing system in terms of net fragility distribution, instead of X(t). Stochastic cascading: probability of failed state at time t dependent on net fragility (and perhaps also directly dependent on previous state). Extension to Voter/herding model and contagion/epidemic model.

Discussion How good of an approximation is the mean field approach? (are there any known theorems on the accuracy of a mean field prediction?) What approximation methods are there for aggregation apart from mean field? What elements should be added to the network model to make it a serious model candidate for the financial/banking network?

Thank you!