Search

Information Theory concepts and methodologies conform the background of how communication systems are studied and understood. They are mainly focused on the source-channel-receiver problem and on the asymptotic limits of accuracy and communication rates, which are the classical problems studied by Shannon. However, the impact of Information Theory on networks (acting as the channel) is just starting. Here, we present an approach to understand how information flows in any connected complex network. Our approach is based on defining linear conservative flows that travel through the network from source to receiver. This framework allows us to have an analytical description of the problem and also linking the topological invariants of the network, such as the node degree, with the information flow. In particular, our approach is able to deal with information transmission in modular networks (networks containing community structures) or multiplex networks (networks with multiple layers), which are nowadays of paramount importance., Comment: 5 pages, 3 figures, proceedings paper

The mathematical framework of multiplex networks has been increasingly realized as a more suitable framework for modelling real-world complex systems. In this work, we investigate the optimization of synchronizability in multiplex networks by evolving only one layer while keeping other layers fixed. Our main finding is to show the conditions under which the efficiency of convergence to the most optimal structure is almost as good as the case where both layers are rewired during an optimization process. In particular, inter-layer coupling strength responsible for the integration between the layers turns out to be crucial factor governing the efficiency of optimization even for the cases when the layer going through the evolution has nodes interacting much weakly than those in the fixed layer. Additionally, we investigate the dependency of synchronizability on the rewiring probability which governs the network structure from a regular lattice to the random networks. The efficiency of the optimization process preceding evolution driven by the optimization process is maximum when the fixed layer has regular architecture, whereas the optimized network is more synchronizable for the fixed layer having the rewiring probability lying between the small-world transition and the random structure., Comment: 5 pages, 3 figures

Abrupt changes of behaviour in complex networks can be triggered by a single node. This work describes the dynamical fundamentals of how the behaviour of one node affects the whole network formed by coupled phase-oscillators with heterogeneous coupling strengths. The synchronisation of phase-oscillators is independent of the distribution of the natural frequencies, weakly depends on the network size, but highly depends on only one key oscillator whose ratio between its natural frequency in a rotating frame and its coupling strength is maximum. This result is based on a novel method to calculate the critical coupling strength with which the phase-oscillators emerge into frequency synchronisation. In addition, we put forward an analytical method to approximately calculate the phase-angles for the synchronous oscillators.

Scientists have been considering the Kuramoto model to understand the mechanism behind the appearance of collective behaviour, such as frequency synchronisation (FS) as a paradigm, in real-world networks with a finite number of oscillators. A major current challenge is to obtain an analytical solution for the phase-angles. Here, we provide an approximate analytical solution for this problem by deriving a master solution for the finite-size Kuramoto model, without imposing any restriction on the distribution of the natural frequencies of the oscillators. The master solution embodies all particular solutions of the finite-size Kuramoto model for any frequency distribution and coupling strength larger than the critical one. Furthermore, we present a criterion to determine the stability of the FS solution. This allows one to analytically infer the relationship between the physical parameters and the stable behaviour of networks.

The phenomenon of oral tolerance refers to a local and systemic state of tolerance, induced in the gut associated lymphoid tissues, after its exposure to innocuous antigens, such as food proteins. While recent findings shed light in the cellular and molecular basis of oral tolerance, the network of interactions between the components mediating oral tolerance has not been investigated yet. Our work brings a complex systems theory approach, aiming to identify the contribution of each element in an oral tolerance network. We also propose a model that allows dynamical plus topological quantifying which must encompass functional responses as the local host involved on the oral tolerance. To keep track of reality of our model, we test knockout (KO) of immunological components (i. e. silencing a vertex) and see how it diverges when the system is topologically health. The results from these simulated KO's are then compared to real molecular knock-outs. To infer from these processing we apply a new implementation of a random walk algorithm for directed graphs, which ultimately generate statistical quantities provided by the dynamical behaviour of the simulated KO's. It was observed that the a specifics KO caused the greatest impact on network standard flux. In a brief analysis, the results obtained correspond to biological data. Our model addresses both topological proprieties and dynamical relations. The construction of a qualitative dynamic model for oral tolerance could reflect empirical observations, through the standard flux results and relative error based on individual knockout., Comment: 21 pages, 2 figures, 2 tables

The intriguing nature of classical Homeric narratives has always fascinated the occidental culture contributing to philosophy, history, mythology and straight forwardly to literature. However what would be so intriguing about Homer's narratives' At a first gaze we shall recognize the very literal appeal and aesthetic pleasure presented on every page across Homer's chants in Odyssey and rhapsodies in Iliad. Secondly we may perceive a biased aspect of its stories contents, varying from real-historical to fictional-mythological. To encompass this glance, there are some new archeological finding that supports historicity of some events described within Iliad, and consequently to Odyssey. Considering these observations and using complex network theory concepts, we managed to built and analyze a social network gathered across the classical epic, Odyssey of Homer. Longing for further understanding, topological quantities were collected in order to classify its social network qualitatively into real or fictional. It turns out that most of the found properties belong to real social networks besides assortativity and giant component's size. In order to test the network's possibilities to be real, we removed some mythological members that could imprint a fictional aspect on the network. Carrying on this maneuver the modified social network resulted on assortative mixing and reduction of the giant component, as expected for real social networks. Overall we observe that Odyssey might be an amalgam of fictional elements plus real based human relations, which corroborates other author's findings for Iliad and archeological evidences.

We show that the probability distribution function that best fits the distribution of return times between two consecutive visits of a chaotic trajectory to finite size regions in phase space deviates from the exponential statistics by a small power-law term, a term that represents the deterministic manifestation of the dynamics, which can be easily experimentally detected and theoretically estimated. We also provide simpler and faster ways to calculate the positive Lyapunov exponents and the short-term correlation function by either realizing observations of higher probable returns or by calculating the eigenvalues of only one very especial unstable periodic orbit of low-period. Finally, we discuss how our approaches can be used to treat data coming from complex systems., Comment: subm. for publication. Accepted fpr publication in Chaos