A fresh look at network science: Interdependent multigraphs models inspired from statistical physics

Author(s):  
John S. Baras
Author(s):  
Arsham Ghavasieh ◽  
Manlio De Domenico

Abstract In the last two decades, network science has proven to be an invaluable tool for the analysis of empirical systems across a wide spectrum of disciplines, with applications to data structures admitting a representation in terms of complex networks. On the one hand, especially in the last decade, an increasing number of applications based on geometric deep learning have been developed to exploit, at the same time, the rich information content of a complex network and the learning power of deep architectures, highlighting the potential of techniques at the edge between applied math and computer science. On the other hand, studies at the edge of network science and quantum physics are gaining increasing attention, e.g., because of the potential applications to quantum networks for communications, such as the quantum Internet. In this work, we briefly review a novel framework grounded on statistical physics and techniques inspired by quantum statistical mechanics which have been successfully used for the analysis of a variety of complex systems. The advantage of this framework is that it allows one to define a set of information-theoretic tools which find widely used counterparts in machine learning and quantum information science, while providing a grounded physical interpretation in terms of a statistical field theory of information dynamics. We discuss the most salient theoretical features of this framework and selected applications to protein-protein interaction networks, neuronal systems, social and transportation networks, as well as potential novel applications for quantum network science and machine learning.


2020 ◽  
Author(s):  
Dale Zhou ◽  
David M. Lydon-Staley ◽  
Perry Zurn ◽  
Danielle S Bassett

Throughout life, we might seek a calling, companions, skills, entertainment, truth, self-knowledge, beauty, and edification. The practice of curiosity can be viewed as an extended and open-ended search for valuable information with hidden identity and location in a complex space of interconnected information. Despite its importance, curiosity has been challenging to computationally model because the practice of curiosity often flourishes without specific goals, external reward, or immediate feedback. Here, we show how network science, statistical physics, and philosophy can be integrated into an approach that coheres with and expands the psychological taxonomies of specific-diversive and perceptual-epistemic curiosity. Using this interdisciplinary approach, we distill functional modes of curious information seeking as searching movements in information space. The kinesthetic model of curiosity offers a vibrant counterpart to the deliberative predictions of model-based reinforcement learning. In doing so, this model unearths new computational opportunities for identifying what makes curiosity curious.


2020 ◽  
Vol 17 (164) ◽  
pp. 20190686 ◽  
Author(s):  
Matjaž Perc

Beauty is subjective, and as such it, of course, cannot be defined in absolute terms. But we all know or feel when something is beautiful to us personally. And in such instances, methods of statistical physics and network science can be used to quantify and to better understand what it is that evokes that pleasant feeling, be it when reading a book or looking at a painting. Indeed, recent large-scale explorations of digital data have lifted the veil on many aspects of our artistic expressions that would remain forever hidden in smaller samples. From the determination of complexity and entropy of art paintings to the creation of the flavour network and the principles of food pairing, fascinating research at the interface of art, physics and network science abounds. We here review the existing literature, focusing in particular on culinary, visual, musical and literary arts. We also touch upon cultural history and culturomics, as well as on the connections between physics and the social sciences in general. The review shows that the synergies between these fields yield highly entertaining results that can often be enjoyed by layman and experts alike. In addition to its wider appeal, the reviewed research also has many applications, ranging from improved recommendation to the detection of plagiarism.


2017 ◽  
Author(s):  
Geoff Boeing

Complex systems have become a popular lens for analyzing cities and complexity theory has many implications for urban performance and resilience. This paper develops a typology of measures and indicators for assessing the physical complexity of the built environment at the scale of urban design. It extends quantitative measures from city planning, network science, ecosystems studies, fractal geometry, statistical physics, and information theory to the analysis of urban form and qualitative human experience. Metrics at multiple scales are scattered throughout diverse bodies of literature and have useful applications in analyzing the adaptive complexity that both evolves and results from local design processes. In turn, they enable urban designers to assess resilience, adaptability, connectedness, and livability with an advanced toolkit. The typology developed here applies to empirical research of various neighborhood types and design standards. It includes temporal, visual, spatial, scaling, and connectivity measures of the urban form. Today, prominent urban design movements openly embrace complexity but must move beyond inspiration and metaphor to formalize what "complexity" is and how we can use it to assess both the world as-is as well as proposals for how it could be instead.


2021 ◽  
Vol 12 ◽  
Author(s):  
Sergio Antonio Alcalá-Corona ◽  
Santiago Sandoval-Motta ◽  
Jesús Espinal-Enríquez ◽  
Enrique Hernández-Lemus

Network modeling, from the ecological to the molecular scale has become an essential tool for studying the structure, dynamics and complex behavior of living systems. Graph representations of the relationships between biological components open up a wide variety of methods for discovering the mechanistic and functional properties of biological systems. Many biological networks are organized into a modular structure, so methods to discover such modules are essential if we are to understand the biological system as a whole. However, most of the methods used in biology to this end, have a limited applicability, as they are very specific to the system they were developed for. Conversely, from the statistical physics and network science perspective, graph modularity has been theoretically studied and several methods of a very general nature have been developed. It is our perspective that in particular for the modularity detection problem, biology and theoretical physics/network science are less connected than they should. The central goal of this review is to provide the necessary background and present the most applicable and pertinent methods for community detection in a way that motivates their further usage in biological research.


Author(s):  
Cong Li ◽  
Xinsheng Ji ◽  
Shuxin Liu ◽  
Haitao Li

Link prediction in temporal networks has always been a hot topic in both statistical physics and network science. Most existing works fail to consider the inner relationship between nodes, leading to poor prediction accuracy. Even though a wide range of realistic networks are temporal ones, few existing works investigated the properties of realistic and temporal networks. In this paper, we address the problem of abstracting individual attributes and propose a adaptive link prediction method for temporal networks based on [Formula: see text]-index to predict future links. The matching degree of nodes is first defined considering both the native influence and the secondary influence of local structure. Then a similarity index is designed using a decaying parameter to punish the snapshots with their occurring time. Experimental results on five realistic temporal networks observing consistent gains of 2–9% AUC in comparison to the best baseline in four networks show that our proposed method outperforms several benchmarks under two standard evaluation metrics: AUC and Ranking score. We also investigate the influence of the free parameter and the definition of matching degree on the prediction performance.


2020 ◽  
Author(s):  
Malcolm P. Kennett
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document