Preprint Article Version 2 Preserved in Portico This version is not peer-reviewed

Adaptive Network Automata Modelling of Complex Networks

Version 1 : Received: 31 December 2020 / Approved: 31 December 2020 / Online: 31 December 2020 (13:15:22 CET)
Version 2 : Received: 24 February 2021 / Approved: 24 February 2021 / Online: 24 February 2021 (10:53:48 CET)

How to cite: Muscoloni, A.; Michieli, U.; Cannistraci, C.V. Adaptive Network Automata Modelling of Complex Networks. Preprints 2020, 2020120808 (doi: 10.20944/preprints202012.0808.v2). Muscoloni, A.; Michieli, U.; Cannistraci, C.V. Adaptive Network Automata Modelling of Complex Networks. Preprints 2020, 2020120808 (doi: 10.20944/preprints202012.0808.v2).


Many complex networks have a connectivity that might be only partially detected or that tends to grow over time, hence the prediction of non-observed links is a fundamental problem in network science. The aim of topological link prediction is to forecast these non-observed links by only exploiting features intrinsic to the network topology. It has a wide range of real applications, like suggesting friendships in social networks or predicting interactions in biological networks.The Cannistraci-Hebb theory is a recent achievement in network science that includes a theoretical framework to understand local-based link prediction on paths of length n. In this study we introduce two innovations: theory of modelling (science) and theory of realization (engineering). For the theory of modelling we first recall a definition of network automata as a general framework for modelling the growth of connectivity in complex networks. We then show that several deterministic models previously developed fall within this framework and we introduce novel network automata following the Cannistraci-Hebb rule. For the theory of realization, we present how to build adaptive network automata for link prediction, which incorporate multiple deterministic models of self-organization and automatically choose the rule that better explains the patterns of connectivity in the network under investigation. We compare Cannistraci-Hebb adaptive (CHA) network automaton against state-of-the-art link prediction methods such as structural perturbation method (SPM), stochastic block models (SBM) and artificial intelligence algorithms for graph embedding. CHA displays an overall higher link prediction performance across different evaluation frameworks on 1386 networks. Finally, we highlight that CHA offers the key advantage to explicitly explain the mechanistic rule of self-organization which leads to the link prediction performance, whereas SPM and graph embedding not. In comparison to CHA, SBM unfortunately shows irrelevant and unsatisfactory performance demonstrating that SBM modelling is not adequate for link prediction in real networks.

Subject Areas

complex networks; network models; link prediction; automata theory; network automata; Cannistraci-Hebb theory

Comments (1)

Comment 1
Received: 24 February 2021
Commenter: Carlo Vittorio Cannistraci
Commenter's Conflict of Interests: Author
Comment: We clarify that the CH model is endowed of a sub-ranking strategy (detailed in Methods section 4.1.8) in order to internally sub-rank all the node pairs characterized by the same CH score.
+ Respond to this comment

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 1
Metrics 0

Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.