Munther Dahleh, director at the MIT Institute for Data, Systems, and Society (IDSS), discussed his group's research on network systems at the KAUST 2018 Winter Enrichment Program. The research focuses on the fragility of large networked systems, like highway systems, in response to disruptions that may lead to catastrophic failures. Dahleh's team studies transportation networks, electrical grids, and financial markets to understand system interconnection in causing systemic risk. Why it matters: Understanding networked systems is crucial for building resilient infrastructure and mitigating risks in critical sectors across the GCC region.
KAUST researchers analyzed 17 years of GPS data from 168 stations across the Arabian plate. They found the plate to be remarkably stable despite pressure from continental collision and plate breakup. The plate moves as a single block, and its motion relative to neighboring plates has likely remained unchanged for 13 million years. Why it matters: The study provides crucial insights into earthquake hazards and tectonic activity in the Arabian Peninsula, improving risk assessment and infrastructure planning.
This article discusses a talk by Gábor Lugosi on "network archaeology," specifically the problems of root finding and broadcasting in large networks. The talk addresses discovering the past of dynamically growing networks when only a present-day snapshot is observed. Lugosi's research interests include machine learning theory, nonparametric statistics, and random structures. Why it matters: Understanding the evolution and origins of networks is crucial for various applications, including analyzing social networks, biological systems, and the spread of information.
KAUST faculty member Marco Canini is researching networked systems, focusing on improving their design, implementation, and operation. His work centers on Software-Defined Advanced Networked and Distributed Systems (SANDS). Canini aims to address challenges related to reliability, performance, security, and energy efficiency in large-scale networked computer systems. Why it matters: This research contributes to the development of more dependable and efficient digital infrastructure in Saudi Arabia, aligning with KAUST's mission to advance science and technology.
Marcus Engsig at DERC has developed DomiRank, a new centrality metric to quantify the dominance of nodes within networks. DomiRank integrates local and global topological information to determine the importance of each node for network stability. The research demonstrates that nodes with high DomiRank values indicate vulnerable areas heavily dependent on dominant nodes. Why it matters: This metric can help identify critical infrastructure components and vulnerabilities in complex systems, enhancing resilience against targeted attacks.
KAUST hosted the "Human-Machine Networks and Intelligent Infrastructures" conference, co-organized by Prof. Jeff Shamma and Asst. Prof. Meriem Laleg. The conference explored the blend of engineered devices and human elements in large-scale systems like smart grids. Keynote speaker Dr. Pramod Khargonekar discussed cyber-physical-social systems and emerging trends. Why it matters: The conference highlights the growing importance of understanding the interplay between AI, infrastructure, and human behavior in the development of smart cities and intelligent systems in the region.
Emilio Porcu from Khalifa University presented on temporally evolving generalized networks, where graphs evolve over time with changing topologies. The presentation addressed challenges in building semi-metrics and isometric embeddings for these networks. The research uses kernel specification and network-based metrics and is illustrated using a traffic accident dataset. Why it matters: This work advances the application of kernel methods to dynamic graph structures, relevant for modeling evolving relationships in various domains.
A new mini-batch strategy using aggregated relational data is proposed to fit the mixed membership stochastic blockmodel (MMSB) to large networks. The method uses nodal information and stochastic gradients of bipartite graphs for scalable inference. The approach was applied to a citation network with over two million nodes and 25 million edges, capturing explainable structure. Why it matters: This research enables more efficient community detection in massive networks, which is crucial for analyzing complex relationships in various domains, but this article has no clear connection to the Middle East.