Category: Papers

Paradigms of Computational Agency

Srinath Srinivasa, Jayati Deshmukh
Agent-based models have emerged as a promising paradigm for addressing ever increasing complexity of information systems. In its initial days in the 1990s when object-oriented modeling was at its peak, an agent was treated as a special kind of “object” that had a persistent state and its own independent thread of execution. Since then, agent-based models have diversified enormously to even open new conceptual insights about the nature of systems in general. This paper presents a perspective on the disparate ways in which our understanding of agency, as well as computational models of agency have evolved. Advances in hardware like GPUs, that brought neural networks back to life, may also similarly infuse new life into agent-based models, as well as pave the way for advancements in research on Artificial General Intelligence (AGI).

Read the full article at: arxiv.org

Infodemics: A new challenge for public health

Infodemics: A new challenge for public health
Cell Volume 184, Issue 25, 9 December 2021, Pages 6010-6014

The COVID-19 information epidemic, or “infodemic,” demonstrates how unlimited access to information may confuse and influence behaviors during a health emergency. However, the study of infodemics is relatively new, and little is known about their relationship with epidemics management. Here, we discuss unresolved issues and propose research directions to enhance preparedness for future health crises.

Read the full article at: www.sciencedirect.com

Systemic liquidity contagion in the European interbank market

Valentina Macchiati, Giuseppe Brandi, Tiziana Di Matteo, Daniela Paolotti, Guido Caldarelli & Giulio Cimini 

Journal of Economic Interaction and Coordination (2021)

Systemic liquidity risk, defined by the International Monetary Fund as “the risk of simultaneous liquidity difficulties at multiple financial institutions,” is a key topic in financial stability studies and macroprudential policy-making. In this context, the complex web of interconnections of the interbank market plays the crucial role of allowing funding liquidity shortages to propagate between financial institutions. Here, we introduce a simple yet effective model of the interbank market in which liquidity shortages propagate through an epidemic-like contagion mechanism on the network of interbank loans. The model is defined by using aggregate balance sheet information of European banks, and it exploits country and bank-specific risk features to account for the heterogeneity of financial institutions. Moreover, in order to obtain the European-wide topology of the interbank network, we define a block reconstruction method based on the exchange flows between the various countries. We show that the proposed contagion model is able to estimate systemic liquidity risk across different years and countries. Results suggest that our effective contagion approach can be successfully used as a viable alternative to more realistic but complicated models, which not only require more specific balance sheet variables with high time resolution but also need assumptions on how banks respond to liquidity shocks.

Read the full article at: link.springer.com

Quantifying the Robustness of Complex Networks with Heterogeneous Nodes

Prasan Ratnayake, Sugandima Weragoda, Janaka Wansapura, Dharshana Kasthurirathna and Mahendra Piraveenan

Mathematics 2021, 9(21), 2769;

The robustness of a complex network measures its ability to withstand random or targeted attacks. Most network robustness measures operate under the assumption that the nodes in a network are homogeneous and abstract. However, most real-world networks consist of nodes that are heterogeneous in nature. In this work, we propose a robustness measure called fitness-incorporated average network efficiency, that attempts to capture the heterogeneity of nodes using the ‘fitness’ of nodes in measuring the robustness of a network. Further, we adopt the same measure to compare the robustness of networks with heterogeneous nodes under varying topologies, such as the scale-free topology or the Erdős–Rényi random topology. We apply the proposed robustness measure using a wireless sensor network simulator to show that it can be effectively used to measure the robustness of a network using a topological approach. We also apply the proposed robustness measure to two real-world networks; namely the CO2 exchange network and an air traffic network. We conclude that with the proposed measure, not only the topological structure, but also the fitness function and the fitness distribution among nodes, should be considered in evaluating the robustness of a complex network.

Read the full article at: www.mdpi.com