Special Issue "Complex Networks from Information Measures"

A special issue of Entropy (ISSN 1099-4300). This special issue belongs to the section "Complexity".

Deadline for manuscript submissions: closed (31 July 2019).

Special Issue Editor

Guest Editor
Prof. Dr. Dimitris Kugiumtzis Website E-Mail
Department of Electrical and Computer Engineering, Aristotle University of Thessaloniki, Thessaloniki 54124, Greece
Interests: linear and nonlinear analysis of time series; connectivity analysis of multivariate time series; complex systems from multivariate time series; complex networks; computational statistics; dynamical systems, chaos and complexity; classification, clustering and feature selection; software development; stochastic simulation; computational neuroscience; analysis of geophysical data; analysis of financial data and econophysics; analysis of biological data; analysis of data in engineering; biosurveillance

Special Issue Information

Dear Colleagues,

In the study of complex systems, such as brain dynamics and financial market dynamics, a main objective is the estimation of the connectivity structure of the observed variables (or subsystems). Having selected a connectivity measure to estimate the inter-dependence among the observed variables, the complex network is then formed, where the nodes are the observed variables and the connections are the estimated inter-dependences. A main stream of methods for connectivity estimation are based on information theory, focusing on the primary property of connectivity, the information processing and transfer. Information measures have been used to estimate both symmetrical (correlation) and directed (causality) inter-dependences in the observed variables. For independent observations, information measures are attractive alternatives to classical correlation measures, whereas in time series, information measures are found to generalize the Granger causality beyond linear models.

The aim of this Special Issue is to highlight the research topic of complex networks from information measures and collect original contributions on this topic. Researchers are encouraged to present recent developments on the methodology and applications of information-based complex networks, as well as comparative studies of information and other connectivity measures.

Prof. Dr. Dimitris Kugiumtzis
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All papers will be peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Entropy is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • information theory
  • complex systems
  • complex networks
  • time series
  • connectivity
  • correlation networks
  • information transfer
  • nonlinear dynamics.

Published Papers (5 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

Open AccessArticle
Quantifying the Variability in Resting-State Networks
Entropy 2019, 21(9), 882; https://doi.org/10.3390/e21090882 - 11 Sep 2019
Abstract
Recent precision functional mapping of individual human brains has shown that individual brain organization is qualitatively different from group average estimates and that individuals exhibit distinct brain network topologies. How this variability affects the connectivity within individual resting-state networks remains an open question. [...] Read more.
Recent precision functional mapping of individual human brains has shown that individual brain organization is qualitatively different from group average estimates and that individuals exhibit distinct brain network topologies. How this variability affects the connectivity within individual resting-state networks remains an open question. This is particularly important since certain resting-state networks such as the default mode network (DMN) and the fronto-parietal network (FPN) play an important role in the early detection of neurophysiological diseases like Alzheimer’s, Parkinson’s, and attention deficit hyperactivity disorder. Using different types of similarity measures including conditional mutual information, we show here that the backbone of the functional connectivity and the direct connectivity within both the DMN and the FPN does not vary significantly between healthy individuals for the AAL brain atlas. Weaker connections do vary however, having a particularly pronounced effect on the cross-connections between DMN and FPN. Our findings suggest that the link topology of single resting-state networks is quite robust if a fixed brain atlas is used and the recordings are sufficiently long—even if the whole brain network topology between different individuals is variable. Full article
(This article belongs to the Special Issue Complex Networks from Information Measures)
Show Figures

Figure 1

Open AccessArticle
A Potential Information Capacity Index for Link Prediction of Complex Networks Based on the Cannikin Law
Entropy 2019, 21(9), 863; https://doi.org/10.3390/e21090863 - 04 Sep 2019
Abstract
Recently, a number of similarity-based methods have been proposed for link prediction of complex networks. Among these indices, the resource-allocation-based prediction methods perform very well considering the amount of resources in the information transmission process between nodes. However, they ignore the information channels [...] Read more.
Recently, a number of similarity-based methods have been proposed for link prediction of complex networks. Among these indices, the resource-allocation-based prediction methods perform very well considering the amount of resources in the information transmission process between nodes. However, they ignore the information channels and their information capacity in information transmission process between two endpoints. Motivated by the Cannikin Law, the definition of information capacity is proposed to quantify the information transmission capability between any two nodes. Then, based on the information capacity, a potential information capacity (PIC) index is proposed for link prediction. Empirical study on 15 datasets has shown that the PIC index we proposed can achieve a good performance, compared with eight mainstream baselines. Full article
(This article belongs to the Special Issue Complex Networks from Information Measures)
Show Figures

Figure 1

Open AccessArticle
Anchor Link Prediction across Attributed Networks via Network Embedding
Entropy 2019, 21(3), 254; https://doi.org/10.3390/e21030254 - 06 Mar 2019
Abstract
Presently, many users are involved in multiple social networks. Identifying the same user in different networks, also known as anchor link prediction, becomes an important problem, which can serve numerous applications, e.g., cross-network recommendation, user profiling, etc. Previous studies mainly use hand-crafted structure [...] Read more.
Presently, many users are involved in multiple social networks. Identifying the same user in different networks, also known as anchor link prediction, becomes an important problem, which can serve numerous applications, e.g., cross-network recommendation, user profiling, etc. Previous studies mainly use hand-crafted structure features, which, if not carefully designed, may fail to reflect the intrinsic structure regularities. Moreover, most of the methods neglect the attribute information of social networks. In this paper, we propose a novel semi-supervised network-embedding model to address the problem. In the model, each node of the multiple networks is represented by a vector for anchor link prediction, which is learnt with awareness of observed anchor links as semi-supervised information, and topology structure and attributes as input. Experimental results on the real-world data sets demonstrate the superiority of the proposed model compared to state-of-the-art techniques. Full article
(This article belongs to the Special Issue Complex Networks from Information Measures)
Show Figures

Figure 1

Open AccessArticle
Information Entropy of Tight-Binding Random Networks with Losses and Gain: Scaling and Universality
Entropy 2019, 21(1), 86; https://doi.org/10.3390/e21010086 - 18 Jan 2019
Abstract
We study the localization properties of the eigenvectors, characterized by their information entropy, of tight-binding random networks with balanced losses and gain. The random network model, which is based on Erdős–Rényi (ER) graphs, is defined by three parameters: the network size N, [...] Read more.
We study the localization properties of the eigenvectors, characterized by their information entropy, of tight-binding random networks with balanced losses and gain. The random network model, which is based on Erdős–Rényi (ER) graphs, is defined by three parameters: the network size N, the network connectivity α , and the losses-and-gain strength γ . Here, N and α are the standard parameters of ER graphs, while we introduce losses and gain by including complex self-loops on all vertices with the imaginary amplitude i γ with random balanced signs, thus breaking the Hermiticity of the corresponding adjacency matrices and inducing complex spectra. By the use of extensive numerical simulations, we define a scaling parameter ξ ξ ( N , α , γ ) that fixes the localization properties of the eigenvectors of our random network model; such that, when ξ < 0.1 ( 10 < ξ ), the eigenvectors are localized (extended), while the localization-to-delocalization transition occurs for 0.1 < ξ < 10 . Moreover, to extend the applicability of our findings, we demonstrate that for fixed ξ , the spectral properties (characterized by the position of the eigenvalues on the complex plane) of our network model are also universal; i.e., they do not depend on the specific values of the network parameters. Full article
(This article belongs to the Special Issue Complex Networks from Information Measures)
Show Figures

Figure 1

Open AccessArticle
A New Recurrence-Network-Based Time Series Analysis Approach for Characterizing System Dynamics
Entropy 2019, 21(1), 45; https://doi.org/10.3390/e21010045 - 09 Jan 2019
Abstract
In this paper, a novel analysis method based on recurrence networks is proposed to characterize the evolution of dynamical systems. Through phase space reconstruction, a time series was transformed into a high-dimensional recurrence network and a corresponding low-dimensional recurrence network, respectively. Then, two [...] Read more.
In this paper, a novel analysis method based on recurrence networks is proposed to characterize the evolution of dynamical systems. Through phase space reconstruction, a time series was transformed into a high-dimensional recurrence network and a corresponding low-dimensional recurrence network, respectively. Then, two appropriate statistics, the correlation coefficient of node degrees (CCND) and the edge similarity, were proposed to unravel the evolution properties of the considered signal. Through the investigation of the time series with distinct dynamics, different patterns in the decline rate of the CCND at different network dimensions were observed. Interestingly, an exponential scaling emerged in the CCND analysis for the chaotic time series. Moreover, it was demonstrated that the edge similarity can further characterize dynamical systems and provide detailed information on the studied time series. A method based on the fluctuation of edge similarities for neighboring edge groups was proposed to determine the number of groups that the edges should be partitioned into. Through the analysis of chaotic series corrupted by noise, it was demonstrated that both the CCND and edge similarity derived from different time series are robust under additive noise. Finally, the application of the proposed method to ventricular time series showed its effectiveness in differentiating healthy subjects from ventricular tachycardia (VT) patients. Full article
(This article belongs to the Special Issue Complex Networks from Information Measures)
Show Figures

Figure 1

Back to TopTop