output
20162026
most citedThe physics of higher-order interactions in complex systems

938 citations

Showing 2021Show all

24 papers · 1 filter

cs.AI202155 cited

Filling gaps in trustworthy development of AI

Shahar Avin, Haydn Belfield, Miles Brundage +9

The range of application of artificial intelligence (AI) is vast, as is the potential for harm. Growing awareness of potential risks from AI systems has spurred action to address t…

astro-ph.IM2021

Radio Galaxy Zoo: Giant Radio Galaxy Classification using Multi-Domain Deep Learning

H. Tang, A. M. M. Scaife, O. I. Wong +1

In this work, we explore the potential of multi-domain multi-branch convolutional neural networks (CNNs) for identifying comparatively rare giant radio galaxies from large volumes…

cs.CY2021197 cited

Ethics-Based Auditing of Automated Decision-Making Systems: Nature, Scope, and Limitations

Jakob Mokander, Jessica Morley, Mariarosaria Taddeo +1

Important decisions that impact human lives, livelihoods, and the natural environment are increasingly being automated. Delegating tasks to so-called automated decision-making syst…

physics.soc-ph2021938 cited

The physics of higher-order interactions in complex systems

Federico Battiston, Enrico Amico, Alain Barrat +11

Complex networks have become the main paradigm for modelling the dynamics of interacting systems. However, networks are intrinsically limited to describing pairwise interactions, w…

physics.soc-ph2021

A microsimulation of spatial inequality in energy access: A Bayesian multi-level modelling approach for urban India

A. P. Neto-Bradley, R. Choudhary, P. Challenor

Access to sustained clean cooking in India is essential to addressing the health burden of indoor air pollution from biomass fuels, but spatial inequality in cities can adversely a…

cs.GT2021

New Algorithms for Combinations of Objectives using Separating Automata

Ashwani Anand, Nathanaël Fijalkow, Aliénor Goubault-Larrecq +2

The notion of separating automata was introduced by Bojanczyk and Czerwinski for understanding the first quasipolynomial time algorithm for parity games. In this paper we show that…