Complex Networks from Classical to Quantum

Recent progress in applying complex network theory to problems in quantum information has resulted in a beneficial crossover. Complex network methods have successfully been applied to transport and entanglement models while information physics is setting the stage for a theory of complex systems with quantum information-inspired methods. Novel quantum induced effects have been predicted in random graphs---where edges represent entangled links---and quantum computer algorithms have been proposed to offer enhancement for several network problems. Here we review the results at the cutting edge, pinpointing the similarities and the differences found at the intersection of these two fields.Comment: 12 pages, 4 figures, REVTeX 4-1, accepted versio

Interdisciplinary and physics challenges of Network Theory

Network theory has unveiled the underlying structure of complex systems such as the Internet or the biological networks in the cell. It has identified universal properties of complex networks, and the interplay between their structure and dynamics. After almost twenty years of the field, new challenges lie ahead. These challenges concern the multilayer structure of most of the networks, the formulation of a network geometry and topology, and the development of a quantum theory of networks. Making progress on these aspects of network theory can open new venues to address interdisciplinary and physics challenges including progress on brain dynamics, new insights into quantum technologies, and quantum gravity.Comment: (7 pages, 4 figures

Combining complex networks and data mining: why and how

The increasing power of computer technology does not dispense with the need to extract meaningful in- formation out of data sets of ever growing size, and indeed typically exacerbates the complexity of this task. To tackle this general problem, two methods have emerged, at chronologically different times, that are now commonly used in the scientific community: data mining and complex network theory. Not only do complex network analysis and data mining share the same general goal, that of extracting information from complex systems to ultimately create a new compact quantifiable representation, but they also often address similar problems too. In the face of that, a surprisingly low number of researchers turn out to resort to both methodologies. One may then be tempted to conclude that these two fields are either largely redundant or totally antithetic. The starting point of this review is that this state of affairs should be put down to contingent rather than conceptual differences, and that these two fields can in fact advantageously be used in a synergistic manner. An overview of both fields is first provided, some fundamental concepts of which are illustrated. A variety of contexts in which complex network theory and data mining have been used in a synergistic manner are then presented. Contexts in which the appropriate integration of complex network metrics can lead to improved classification rates with respect to classical data mining algorithms and, conversely, contexts in which data mining can be used to tackle important issues in complex network theory applications are illustrated. Finally, ways to achieve a tighter integration between complex networks and data mining, and open lines of research are discussed.Comment: 58 pages, 19 figure

Complex Network Approach for Recurrence Analysis of Time Series

We propose a novel approach for analysing time series using complex network theory. We identify the recurrence matrix calculated from time series with the adjacency matrix of a complex network, and apply measures for the characterisation of complex networks to this recurrence matrix. By using the logistic map, we illustrate the potentials of these complex network measures for detecting dynamical transitions. Finally we apply the proposed approach to a marine palaeo-climate record and identify subtle changes of the climate regime.Comment: 23 pages, 7 figure

Algorithmic Networks: central time to trigger expected emergent open-endedness

This article investigates emergence and complexity in complex systems that can share information on a network. To this end, we use a theoretical approach from information theory, computability theory, and complex networks. One key studied question is how much emergent complexity (or information) arises when a population of computable systems is networked compared with when this population is isolated. First, we define a general model for networked theoretical machines, which we call algorithmic networks. Then, we narrow our scope to investigate algorithmic networks that optimize the average fitnesses of nodes in a scenario in which each node imitates the fittest neighbor and the randomly generated population is networked by a time-varying graph. We show that there are graph-topological conditions that cause these algorithmic networks to have the property of expected emergent open-endedness for large enough populations. In other words, the expected emergent algorithmic complexity of a node tends to infinity as the population size tends to infinity. Given a dynamic network, we show that these conditions imply the existence of a central time to trigger expected emergent open-endedness. Moreover, we show that networks with small diameter compared to the network size meet these conditions. We also discuss future research based on how our results are related to some problems in network science, information theory, computability theory, distributed computing, game theory, evolutionary biology, and synergy in complex systems.Comment: This is a revised version of the research report no. 4/2018 at the National Laboratory for Scientific Computing (LNCC), Brazi

Nonextensive statistical mechanics and complex scale-free networks

One explanation for the impressive recent boom in network theory might be that it provides a promising tool for an understanding of complex systems. Network theory is mainly focusing on discrete large-scale topological structures rather than on microscopic details of interactions of its elements. This viewpoint allows to naturally treat collective phenomena which are often an integral part of complex systems, such as biological or socio-economical phenomena. Much of the attraction of network theory arises from the discovery that many networks, natural or man-made, seem to exhibit some sort of universality, meaning that most of them belong to one of three classes: {\it random}, {\it scale-free} and {\it small-world} networks. Maybe most important however for the physics community is, that due to its conceptually intuitive nature, network theory seems to be within reach of a full and coherent understanding from first principles ..

A General Framework for Complex Network Applications

Complex network theory has been applied to solving practical problems from different domains. In this paper, we present a general framework for complex network applications. The keys of a successful application are a thorough understanding of the real system and a correct mapping of complex network theory to practical problems in the system. Despite of certain limitations discussed in this paper, complex network theory provides a foundation on which to develop powerful tools in analyzing and optimizing large interconnected systems.Comment: 8 page

Exploring continuous organisational transformation as a form of network interdependence

In this paper we examine the problematic area of continuous transformation. We conduct our analysis from three theoretical perspectives: the resource based view, social network theory, and stakeholder theory. We found that the continuous transformation can be explained through the concept of Network Interdependence. This paper describes Network Interdependence and develops theoretical propositions from a synthesis of the three theories. Our contribution of Network Interdependence offers fresh insights into managing complex change and offers new ways of looking at organisational transformation