scholarly journals A Review of Graph and Network Complexity from an Algorithmic Information Perspective

Entropy ◽  
2018 ◽  
Vol 20 (8) ◽  
pp. 551 ◽  
Author(s):  
Hector Zenil ◽  
Narsis Kiani ◽  
Jesper Tegnér

Information-theoretic-based measures have been useful in quantifying network complexity. Here we briefly survey and contrast (algorithmic) information-theoretic methods which have been used to characterize graphs and networks. We illustrate the strengths and limitations of Shannon’s entropy, lossless compressibility and algorithmic complexity when used to identify aspects and properties of complex networks. We review the fragility of computable measures on the one hand and the invariant properties of algorithmic measures on the other demonstrating how current approaches to algorithmic complexity are misguided and suffer of similar limitations than traditional statistical approaches such as Shannon entropy. Finally, we review some current definitions of algorithmic complexity which are used in analyzing labelled and unlabelled graphs. This analysis opens up several new opportunities to advance beyond traditional measures.

Entropy ◽  
2018 ◽  
Vol 20 (7) ◽  
pp. 534 ◽  
Author(s):  
Hector Zenil ◽  
Narsis Kiani ◽  
Jesper Tegnér

We introduce a definition of algorithmic symmetry in the context of geometric and spatial complexity able to capture mathematical aspects of different objects using as a case study polyominoes and polyhedral graphs. We review, study and apply a method for approximating the algorithmic complexity (also known as Kolmogorov–Chaitin complexity) of graphs and networks based on the concept of Algorithmic Probability (AP). AP is a concept (and method) capable of recursively enumerate all properties of computable (causal) nature beyond statistical regularities. We explore the connections of algorithmic complexity—both theoretical and numerical—with geometric properties mainly symmetry and topology from an (algorithmic) information-theoretic perspective. We show that approximations to algorithmic complexity by lossless compression and an Algorithmic Probability-based method can characterize spatial, geometric, symmetric and topological properties of mathematical objects and graphs.


Author(s):  
Ryotaro Kamimura ◽  

In this paper, we propose new information-theoretic methods to stabilize feature detection. We have introduced information-theoretic methods to realize competitive learning. It turned out that mutual information maximization corresponds to a process of competition among neurons. This means that mutual information can be effective in describing competitive processes. Thus, by using this mutual information, we have introduced information loss to interpret internal representations. By relaxing competitive units by some components such as units and connection weights, a neural network’s information is decreased. If the information loss is sufficiently large, the components play important roles. However, with the information loss, there have been some problems, such as the instability of final representations. This means that final outputs are significantly dependent upon chosen parameters. To stabilize final representations, we introduce two computational methods, that is, <em>relative relaxation</em> and <em>weighted information loss</em>. The relative relaxation is introduced because mutual information is dependent upon the Gaussian width. Thus, we can relax competitive units or softly delete some components, relative only to a predetermined base state. In addition, we introduce weighted information loss to take into account information on related components. We applied the methods to the well-known Iris problem and a problem regarding the extinction of animals and plants. In the Iris problem, experimental results confirmed that final representations were significantly stable if we appropriately chose the parameter for the base state. On the other hand, in the extinction problem, weighted information losses showed better performance, where final outputs were significantly more stable than those by the other methods.


Symmetry ◽  
2019 ◽  
Vol 11 (2) ◽  
pp. 284 ◽  
Author(s):  
Taras Agryzkov ◽  
Manuel Curado ◽  
Francisco Pedroche ◽  
Leandro Tortosa ◽  
José Vicent

Usually, the nodes’ interactions in many complex networks need a more accurate mapping than simple links. For instance, in social networks, it may be possible to consider different relationships between people. This implies the use of different layers where the nodes are preserved and the relationships are diverse, that is, multiplex networks or biplex networks, for two layers. One major issue in complex networks is the centrality, which aims to classify the most relevant elements in a given system. One of these classic measures of centrality is based on the PageRank classification vector used initially in the Google search engine to order web pages. The PageRank model may be understood as a two-layer network where one layer represents the topology of the network and the other layer is related to teleportation between the nodes. This approach may be extended to define a centrality index for multiplex networks based on the PageRank vector concept. On the other hand, the adapted PageRank algorithm (APA) centrality constitutes a model to obtain the importance of the nodes in a spatial network with the presence of data (both real and virtual). Following the idea of the two-layer approach for PageRank centrality, we can consider the APA centrality under the perspective of a two-layer network where, on the one hand, we keep maintaining the layer of the topological connections of the nodes and, on the other hand, we consider a data layer associated with the network. Following a similar reasoning, we are able to extend the APA model to spatial networks with different layers. The aim of this paper is to propose a centrality measure for biplex networks that extends the adapted PageRank algorithm centrality for spatial networks with data to the PageRank two-layer approach. Finally, we show an example where the ability to analyze data referring to a group of people from different aspects and using different sets of independent data are revealed.


2018 ◽  
Vol 7 (12) ◽  
pp. 480 ◽  
Author(s):  
Taras Agryzkov ◽  
Francisco Pedroche ◽  
Leandro Tortosa ◽  
José Vicent

Identifying the influential nodes in complex networks is a fundamental and practical topic at the moment. In this paper, a new centrality measure for complex networks is proposed based on two contrasting models that have their common origin in the well-known PageRank centrality. On the one hand, the essence of the model proposed is taken from the Adapted PageRank Algorithm (APA) centrality, whose main characteristic is that constitutes a measure to establish a ranking of nodes considering the importance of some dataset associated to the network. On the other hand, a technique known as two-layers PageRank approach is applied to this model. This technique focuses on the idea that the PageRank centrality can be understood as a two-layer network, the topological and teleportation layers, respectively. The main point of the proposed centrality is that it combines the APA centrality with the idea of two-layers; however, the difference now is that the teleportation layer is replaced by a layer that collects the data present in the network. This combination gives rise to a new algorithm for ranking the nodes according to their importance. Subsequently, the coherence of the new measure is demonstrated by calculating the correlation and the quantitative differences of both centralities (APA and the new centrality). A detailed study of the differences of both centralities, taking different types of networks, is performed. A real urban network with data randomly generated is evaluated as well as the well-known Zachary’s karate club network. Some numerical results are carried out by varying the values of the α parameter—known as dumping factor in PageRank model—that varies the importance given to the two layers (topology and data) within the computation of the new centrality. The proposed algorithm takes the best characteristics of the models on which it is based: on the one hand, it is a measure of centrality, in complex networks with data, whose calculation is stable numerically and, on the other hand, it is able to separate the topological properties of the network and the influence of the data.


1975 ◽  
Vol 26 ◽  
pp. 395-407
Author(s):  
S. Henriksen

The first question to be answered, in seeking coordinate systems for geodynamics, is: what is geodynamics? The answer is, of course, that geodynamics is that part of geophysics which is concerned with movements of the Earth, as opposed to geostatics which is the physics of the stationary Earth. But as far as we know, there is no stationary Earth – epur sic monere. So geodynamics is actually coextensive with geophysics, and coordinate systems suitable for the one should be suitable for the other. At the present time, there are not many coordinate systems, if any, that can be identified with a static Earth. Certainly the only coordinate of aeronomic (atmospheric) interest is the height, and this is usually either as geodynamic height or as pressure. In oceanology, the most important coordinate is depth, and this, like heights in the atmosphere, is expressed as metric depth from mean sea level, as geodynamic depth, or as pressure. Only for the earth do we find “static” systems in use, ana even here there is real question as to whether the systems are dynamic or static. So it would seem that our answer to the question, of what kind, of coordinate systems are we seeking, must be that we are looking for the same systems as are used in geophysics, and these systems are dynamic in nature already – that is, their definition involvestime.


Author(s):  
Stefan Krause ◽  
Markus Appel

Abstract. Two experiments examined the influence of stories on recipients’ self-perceptions. Extending prior theory and research, our focus was on assimilation effects (i.e., changes in self-perception in line with a protagonist’s traits) as well as on contrast effects (i.e., changes in self-perception in contrast to a protagonist’s traits). In Experiment 1 ( N = 113), implicit and explicit conscientiousness were assessed after participants read a story about either a diligent or a negligent student. Moderation analyses showed that highly transported participants and participants with lower counterarguing scores assimilate the depicted traits of a story protagonist, as indicated by explicit, self-reported conscientiousness ratings. Participants, who were more critical toward a story (i.e., higher counterarguing) and with a lower degree of transportation, showed contrast effects. In Experiment 2 ( N = 103), we manipulated transportation and counterarguing, but we could not identify an effect on participants’ self-ascribed level of conscientiousness. A mini meta-analysis across both experiments revealed significant positive overall associations between transportation and counterarguing on the one hand and story-consistent self-reported conscientiousness on the other hand.


2005 ◽  
Vol 44 (03) ◽  
pp. 107-117
Author(s):  
R. G. Meyer ◽  
W. Herr ◽  
A. Helisch ◽  
P. Bartenstein ◽  
I. Buchmann

SummaryThe prognosis of patients with acute myeloid leukaemia (AML) has improved considerably by introduction of aggressive consolidation chemotherapy and haematopoietic stem cell transplantation (SCT). Nevertheless, only 20-30% of patients with AML achieve long-term diseasefree survival after SCT. The most common cause of treatment failure is relapse. Additionally, mortality rates are significantly increased by therapy-related causes such as toxicity of chemotherapy and complications of SCT. Including radioimmunotherapies in the treatment of AML and myelodyplastic syndrome (MDS) allows for the achievement of a pronounced antileukaemic effect for the reduction of relapse rates on the one hand. On the other hand, no increase of acute toxicity and later complications should be induced. These effects are important for the primary reduction of tumour cells as well as for the myeloablative conditioning before SCT.This paper provides a systematic and critical review of the currently used radionuclides and immunoconjugates for the treatment of AML and MDS and summarizes the literature on primary tumour cell reductive radioimmunotherapies on the one hand and conditioning radioimmunotherapies before SCT on the other hand.


2017 ◽  
Vol 47 (188) ◽  
pp. 487-494
Author(s):  
Daniel Mullis

In recent years, political and social conditions have changed dramatically. Many analyses help to capture these dynamics. However, they produce political pessimism: on the one hand there is the image of regression and on the other, a direct link is made between socio-economic decline and the rise of the far-right. To counter these aspects, this article argues that current political events are to be understood less as ‘regression’ but rather as a moment of movement and the return of deep political struggles. Referring to Jacques Ranciere’s political thought, the current conditions can be captured as the ‘end of post-democracy’. This approach changes the perspective on current social dynamics in a productive way. It allows for an emphasis on movement and the recognition of the windows of opportunity for emancipatory struggles.


1996 ◽  
pp. 13-23
Author(s):  
Mykhailo Babiy

Political ideological pluralism, religious diversity are characteristic features of modern Ukrainian society. On the one hand, multiculturalism, socio-political, religious differentiation of the latter appear as important characteristics of its democracy, as a practical expression of freedom, on the other - as a factor that led to the deconsocialization of society, gave rise to "nodal points" of tension, confrontational processes, in particular, in political and religious spheres.


2003 ◽  
pp. 15-26
Author(s):  
P. Wynarczyk
Keyword(s):  
The Core ◽  

Two aspects of Schumpeter' legacy are analyzed in the article. On the one hand, he can be viewed as the custodian of the neoclassical harvest supplementing to its stock of inherited knowledge. On the other hand, the innovative character of his works is emphasized that allows to consider him a proponent of hetherodoxy. It is stressed that Schumpeter's revolutionary challenge can lead to radical changes in modern economics.


Sign in / Sign up

Export Citation Format

Share Document