RIEB Seminar (Jointly supported by:Grant-in-Aid for Scientific Research (S))
| Date&Time | Thrusday, August 18, 2016, 4:30pm-6:00pm |
|---|---|
| Place | Seminar Room at RIEB (Kanematsu Memorial Hall, 1st Floor) |
| Intended Audience | Faculties, Graduate Students and People with Equivalent Knowledge |
| Language | English |
| Note | Copies of the paper will be available at Office of Promoting Research Collaboration. There will be a reception held after the seminar. If you would like to attend the reception, please email us at Office of Promoting Research Collaboration your name, affiliation, email address by Friday, August 5th. Details will be notified later. |
4:30pm-6:00pm
| Speaker | Michael M. DANZIGER |
|---|---|
| Affiliation | Department of Physics, Bar Ilan University |
| Topic | Understanding heterogeneous complex systems with percolation |
| Abstract | We will begin this talk by explaining how percolation theory forms a bridge between statistical physics and the new problems posed by complex systems. We will then show two new examples of how percolation theory can be generalized to systems where it cannot be simply applied due to heterogeneity: either because they have multiple interdependent layers or different classes of nodes which share a common vulnerability. For interdependent multiplex networks, we consider a system composed of two sets of links, where the links are of variable but constrained geographic length. This network topology has two striking features: random-like and lattice-like behavior depending on the length-scale measured (in each layer) and a nucleation-driven first-order transition (when both layers are combined interdependently). We will discuss why this is an important topological model for real-world systems like infrastructure networks, and some of the surprising implications of our findings. [1] For nodes with a common vulnerability, we present a newly developed percolation approach called "color-avoiding percolation". This theory was developed to describe networks in which classes of nodes share a vulnerability to a common adversary or failure. For instance, nodes in a supply chain network that are owned by the same conglomerate or communications routers controlled by the same country. In such a case, it may be desirable or even necessary to have connectivity on enough paths that no single vulnerability can disconnect the network, or no single adversary can intercept the communication (in the security case). The solution of this problem requires a new type of percolation which has a number of interesting theoretical properties, including different critical exponents, nodes required for connectivity but not connected themselves and the ability to provide unique structural insight into the autonomous-systems level internet.[2] [1] M.M. Danziger, L.M. Shekhtman, Y. Berezin, S. Havlin, "The effect of spatiality on multiplex networks" Europhysics Letters (in press, 2016) arXiv:1505.01688 [2] S.M. Krause, M.M. Danziger, V. Zlatic "Hidden connectivity in networks with vulnerable classes of nodes" arXiv:1503.04058 |