When? Tuesday June 20 2017, 08:45 am - 06:00 pm

Where? Room: White River 103, JW Marriot Indianapolis

We are proud to present a high-quality program with speakers covering different scientific discplines. Speakers can send their slides to Ingo Scholtes to make them available after the event.

Time Presenter
08:45 - 09:00 Organizers
Opening Statement
Session chair: TBD
09:00 - 09:30 Zack W. Almquist (School of Statistics, University of Minnesota, USA)
Invited Talk: Stable Multiple Time Step Prediction from Dynamic Network Regression Models Prediction and simulation from dynamic network models is a challenging problem for many of the popular frameworks employed for statistical inference on temporally evolving graphs. A major problem with many of the forward simulation procedures is the tendency for dynamic network models to become quickly degenerate -- i.e., the simulation/prediction procedure results in either null graphs or complete graphs. In this talk, we describe an algorithm for simulating a sequence of networks generated from a lagged dynamic network logistic regression (DNR), a subclass of Temporal Exponential Random Graph Models (TERGM). We introduce a smoothed estimator for forward prediction, based on a moving average of the change statistics obtained from a DNR model. Here, we focus on the implementation of the algorithm, providing a series of motivating examples with comparisons to dynamic network models from the literature. We find that our algorithm significantly improves multi-step prediction/simulation over standard forecasting from DNR. Furthermore, we show that our method performs comparably to existing dynamic network analysis frameworks (Stochastic Actor Oriented Models and Separable Temporal Exponential Random Graph Models) for small networks over short time periods, and significantly outperforms these approaches over long time time intervals and/or large networks.
09:30 - 10:00 Jean-Gabriel Young (Universitë Laval, Quëbec, (QC) Canada)
Invited Talk: Construction of and efficient sampling from the simplicial configuration model It has been shown recently that the structure of complex systems is not always correctly represented by networks, due to the presence of many-body interactions. An increasingly popular alternative is to instead encode these interactions explicitly, using simplicial complexes (a generalization of graphs). With this new solution comes the need for principled null models. Drawing inspiration from the network literature, we propose a natural candidate: the simplicial configuration model. The core of our contribution is an efficient and uniform Markov chain Monte Carlo sampler for this model. In a short case study, we demonstrate its usefulness by investigating the relationship between the actual and randomized Betti numbers of a few real systems. This allows us to conclude|based on sound statistical arguments|that the structure of some systems is essentially random, while large-scale organizational principle intervene in others.
10:00 - 10:30 Matthew Michalska-Smith (Department of Ecology and Evolution, University of Chicago, USA)
Invited Talk: Higher-order interactions stabilize dynamics in competitive network models The difficulty of reconciling the staggering biodiversity found in tropical rainforests with classical theories of resource partitioning has led ecologists to explore neutral theories of coexistence in which all species have the same physiological parameters, and variations in species abundance arise from stochastic fluctuations. While initially neutral theory was criticized principally on its assumption of ecological equivalence, its many successes at reproducing empirical patterns made it grow into one of the best studied models in ecology. With time, the critique of neutral theory shifted from its assumptions to its predictions, highlighting that the theory cannot account for the large fluctuations species abundances observed empirically, and that it produces a strong correlation between a species' abundance and its age---contrary to empirical evidence. Here we propose an alternative theory of coexistence in which all species have different physiological rates, and interact with each other through a network of competitive interactions. We show that our models produce robust coexistence of many species even when parameters are drawn at random. Importantly, the dynamical stability of our models is due to higher-order interactions, in which the presence of a species influences the interaction between other species. The existence of higher-order interactions has been debated in ecology for decades, but their role in shaping ecological communities is still understudied. Our results show that higher-order interactions can have dramatic effects on the dynamics of ecological systems. When set in a stochastic framework, we recover many results from neutral theory, but improve on the relationship between age and abundance.
10:30 - 11:00 Coffee Break
Session chair: TBD
11:00 - 11:30 Sang Hoon Lee (Korea Institute for Advanced Study (KIAS), Seoul, South Korea)
Invited Talk: Higher-order network structures in topologically associated domains of chromosome interactions In this post-genome sequence era, the investigation of the genomic interactions on top of the identified sequence is of great importance. There exist nontrivial structural properties in the interactions, despite the fact that the sequence itself is a topologically simple one-dimensional structure. In particular, topologically associated domains (TADs), representing the group or modular structures, are crucial substructures of chromosome interactions. As the weighted network structures effectively capture the genomic interactions, the identification of TADs naturally corresponds to finding the modular or community structures in the genomic interaction network. In this work, we suggest a systematic way to identify TADs using network community identification algorithms. As a concrete example, we take a representative genomic interaction data called the Hi-C map and apply algorithms for network community detection, in particular, with the tunable resolutions parameter that enables us to find TADs with various resolutions. For validity of our method, we compare several known biological markers for the TAD boundary, such as the enrichment of transcriptional repressor CTCF and histone protein modification, with our systematically identified TADs.
11:30 - 12:00 Giovanni Petri (ISI Foundation, Torino, IT)
Invited Talk: Structure and evolution of topological brain scaffolds Topology is one of the oldest and more relevant branches of mathematics, and it has provided an expressive and affordable language which is progressively pervading many areas of biology, computer science and physics. I will illustrate the type of novel insights that algebraic topological tools are providing for the study of the brain at the genetic, structural and functional levels. Using brain gene expression data, I first will construct a topological genetic skeleton, together with an appropriate simplicial configuration model, pointing to the differences in structure and function of different genetic pathways within the brain. Then, by comparing the homological features of structural and functional brain networks across a large age span, I will highlight the presence of dynamically coordinated compensation mechanisms, suggesting that functional topology is conserved over the depleting structural substrate, and test this conjecture on data coming from a set of different altered brain states (LSD, psylocybin, sleep).
12:00 - 12:30 Nataša Djurdjevac-Conrad (Department Numerical Analysis and Modelling, Zuse Institute Berlin (ZIB), DE)
Invited Talk: Finding dominant structures in biological networks Networks are often used as key determinants of structure, function and dynamics in systems that span biological, physical and social sciences. Dominant structures of such networks have been shown to correspond to main building blocks of complex systems. For example, in networks describing biological systems, dominant structures are often functional units like protein complexes and bio-chemical pathways. From a graph theoretic point of view, these structures can have a different form, i.e. they can be modules, cycles, long chains etc. In this talk, we will present our novel random-walk based method for finding various types of dominant structures on the example of networks coming from biological systems. We will address the problem of how these structures change when an undirected modular graph is transformed into a directed graph with dominant cycles. Finally, we will discuss new types of dominant structures that combine different available data from biological high throughput technologies.
12:30 - 14:00 Lunch Break
Session chair: TBD
14:00 - 14:30 Ingo Scholtes (ETH Zürich)
Contributed Talk: Multi-Order Graphical Models: A Unified Perspective on Pathways and Temporal Networks TBA
14:30 - 15:00 Jian Xu (University of Notre Dame, USA)
Invited Talk: Representing higher-order dependencies in networks: methods, applications, and visualizations Network-based representation has quickly emerged as the norm in representing rich interactions in complex systems. For example, given the trajectories of ships, a global shipping network can be constructed by assigning port-to-port traffic as edge weights. However, the conventional first-order (Markov property) networks thus built captures only pairwise shipping traffic between ports, disregarding the fact that ship movements can depend on multiple previous steps. The loss of information when representing raw data as networks can lead to inaccurate results in the downstream network analyses. In this talk I will introduce the Higher-order Network (HON), which remedies the gap between big data and the network representation by embedding higher-order dependencies in the network. I will show how existing network algorithms including clustering, ranking, and anomaly detection can be directly used on HON without modification, and influence observations in interdisciplinary applications such as modeling global shipping and web user browsing behavior. I will also demonstrate HoNVis, a software package for the visualization and interactive exploration of HON.
15:00 - 15:30 Alexey Medvedev (Université de Namur, Belgium)
Invited Talk: Influence of network cycles on the speed of spreading in non-Markovian spreading model Spreading is one of the most important dynamic processes on complex networks, as it is the basis of a broad range of phenomena from epidemic contagion to diffusion of innovations. Many recent studies of non-Markovian spreading on complex networks exploit the property of tree-like neighborhood of a vertex in random graphs, thus simplifying the structure of underlying networks. However, there is a growing evidence that social networks do not share such property and that higher-order local topological structure influences the dynamics. We present the analytical study of the role of cycles in speeding up the non-Markovian SI spreading model on static and random networks. We concentrate on the case of i.i.d. inter-event times  following power-law distribution P(>t)~t-, where (0,1), and derive the conditions on the cycle structure and the exponent , for the process to run in finite expected time. The evidence of speeding up is also supported with empirical study of the SI spreading on the large mobile phone call dataset.
15:30 - 16:00 Coffee Break
Session chair: TBD
16:00 - 16:30 Peter Pollner (Eötvös-Loránd University, Hungary)
Invited Talk: Describing clinical pathways with higher order methods We present a network of the flow of patients among clinical stations. Since several patients had more than a few number of visits in the same- or in a different hospital, the time ordered series of treatment locations can be modeled as a flow between the institutions. Beside the dates of the hospital visits the ICD-10 classification of the diagnosed diseases were also recorded, thus, the pathways can be labeled with the corresponding disease. Our study is based on electronic patient records from a countrywide anonymised database in Hungary. According to our results the patient flow network between health care institutions has memory both on the level of individual diseases and also when patients with different ICD-10 classification codes are aggregated. Separating clinical pathways into classes of different disease types reveals that the optimal memory length varies between treatment protocols. Therefore, the process shaping the patient pathways cannot be modelled by a traditional random walk on a network, and is more analogous to variable order Markov processes.
16:30 - 17:45 Live Demo Session:
Tools for Higher-Order Network Analysis
17:45 - 18:00 Organizers
Closing Statement