Search

The optomechanical systems produce chaotic behaviour due to nonlinear interaction between photons and phonons, and the same systems are used to understand the synthetic fields as well. Here, we report on the study of chaotic behaviour in the presence of a phononic synthetic magnetic field in a closed loop configuration consisting of a single optical mode and two mechanical modes. The modulation phase of the mechanical coupling between the two mechanical modes plays a critical role in determining the mechanical and optical intensity dynamics in the nonlinear regime. Our study shows the dark mode breaking effect in the presence of a synthetic magnetic field, which brings about a complex way of mechanical energy exchange that causes the cavity field to alternate between chaotic and regular behaviour periodically in temporal domain. However in the stronger nonlinear regime the temporal dynamics demonstrate predominantly chaotic behaviour. Besides, with the advent of advanced fabrication technologies, this study holds promises in developing phase tunable integrated low-power chaotic light sources to support efficient optical secure communication systems.

Gradual semantics within abstract argumentation associate a numeric score with every argument in a system, which represents the level of acceptability of this argument, and from which a preference ordering over arguments can be derived. While some semantics operate over standard argumentation frameworks, many utilise a weighted framework, where a numeric initial weight is associated with each argument. Recent work has examined the inverse problem within gradual semantics. Rather than determining a preference ordering given an argumentation framework and a semantics, the inverse problem takes an argumentation framework, a gradual semantics, and a preference ordering as inputs, and identifies what weights are needed to over arguments in the framework to obtain the desired preference ordering. Existing work has attacked the inverse problem numerically, using a root finding algorithm (the bisection method) to identify appropriate initial weights. In this paper we demonstrate that for a class of gradual semantics, an analytical approach can be used to solve the inverse problem. Unlike the current state-of-the-art, such an analytic approach can rapidly find a solution, and is guaranteed to do so. In obtaining this result, we are able to prove several important properties which previous work had posed as conjectures.

This work shows that chaotic signals with different power spectrum are robust to linear superposition, meaning that the superposition preserves Ergodic quantities (Lyapunov exponents) and the information content of the source signals, even after being transmitted over non-ideal physical medium. This wonderful property that chaotic signals have allows me to propose a novel communication system based on chaos, where information composed from and to multiple users each operating with different base frequencies and that is carried by chaotic wavesignals can be fully preserved after transmission in the open air wireless physical medium, and it can be trivially decoded with low probability of errors. This work tackles with great detail how chaotic signals and their information content are affected when travelling through medium that presents the non-ideal properties of multipath propagation, noise and chaotic interference (linear superposition), and how this impacts on the proposed communication system. Physical media with other non-ideal properties (dispersion and interference with periodic signals) are also discussed.

In previous work, the $k$-logistic map [Machicao and Bruno, Chaos, vol. 27, 053116 (2017)] was introduced as a transformation operating in the $k$ less significant digits of the Logistic map. It exploited the map's pseudo-randomness character that is present in its less significant digits. In this work, we comprehensively analyze the dynamical and ergodic aspects of this transformation, show its applicability to generic chaotic maps or sets, and its potential impact on enabling the creation of a cryptosystem that is fast, light and reliable.

This paper explores the deep-zoom properties of the chaotic k-logistic map, in order to propose an improved chaos-based cryptosystem. This map was shown to enhance the random features of the Logistic map, while at the same time reducing the predictability about its orbits. We incorporate its strengths to security into a previously published cryptosystem to provide an optimal pseudo-random number generator (PRNG) as its core operation. The result is a reliable method that does not have the weaknesses previously reported about the original cryptosystem., Comment: 11 pages, 6 figures

Delegation allows an agent to request that another agent completes a task. In many situations the task may be delegated onwards, and this process can repeat until it is eventually, successfully or unsuccessfully, performed. We consider policies to guide an agent in choosing who to delegate to when such recursive interactions are possible. These policies, based on quitting games and multi-armed bandits, were empirically tested for effectiveness. Our results indicate that the quitting game based policies outperform those which do not explicitly account for the recursive nature of delegation.

Finding the correct encoding for a generic dynamical system's trajectory is a complicated task: the symbolic sequence needs to preserve the invariant properties from the system's trajectory. In theory, the solution to this problem is found when a Generating Markov Partition (GMP) is obtained, which is only defined once the unstable and stable manifolds are known with infinite precision and for all times. However, these manifolds usually form highly convoluted Euclidean sets, are \emph{a priori} unknown, and, as it happens in any real-world experiment, measurements are made with finite resolution and over a finite time-span. The task gets even more complicated if the system is a network composed of interacting dynamical units, namely, a high-dimensional complex system. Here, we tackle this task and solve it by defining a method to approximately construct GMPs for any complex system's finite-resolution and finite-time trajectory. We critically test our method on networks of coupled maps, encoding their trajectories into symbolic sequences. We show that these sequences are optimal because they minimise the information loss and also any spurious information added. Consequently, our method allows us to approximately calculate the invariant probability measures of complex systems from observed data. Thus, we can efficiently define complexity measures that are applicable to a wide range of complex phenomena, such as the characterisation of brain activity from EEG signals measured at different brain regions or the characterisation of climate variability from temperature anomalies measured at different Earth regions., Comment: 10 pages, 10 figures

Information needs to be appropriately encoded to be reliably transmitted over physical media. Similarly, neurons have their own codes to convey information in the brain. Even though it is well-known that neurons exchange information using a pool of several protocols of spatio-temporal encodings, the suitability of each code and their performance as a function of network parameters and external stimuli is still one of the great mysteries in neuroscience. This paper sheds light on this by modeling small-size networks of chemically and electrically coupled Hindmarsh-Rose spiking neurons. We focus on a class of temporal and firing-rate codes that result from neurons' membrane-potentials and phases, and quantify numerically their performance estimating the Mutual Information Rate, aka the rate of information exchange. Our results suggest that the firing-rate and interspike-intervals codes are more robust to additive Gaussian white noise. In a network of four interconnected neurons and in the absence of such noise, pairs of neurons that have the largest rate of information exchange using the interspike-intervals and firing-rate codes are not adjacent in the network, whereas spike-timings and phase codes (temporal) promote large rate of information exchange for adjacent neurons. If that result would have been possible to extend to larger neural networks, it would suggest that small microcircuits would preferably exchange information using temporal codes (spike-timings and phase codes), whereas on the macroscopic scale, where there would be typically pairs of neurons not directly connected due to the brain's sparsity, firing-rate and interspike-intervals codes would be the most efficient codes., Comment: 20 pages, 5 figures

Brain plasticity, also known as neuroplasticity, is a fundamental mechanism of neuronal adaptation in response to changes in the environment or due to brain injury. In this review, we show our results about the effects of synaptic plasticity on neuronal networks composed by Hodgkin-Huxley neurons. We show that the final topology of the evolved network depends crucially on the ratio between the strengths of the inhibitory and excitatory synapses. Excitation of the same order of inhibition revels an evolved network that presents the rich-club phenomenon, well known to exist in the brain. For initial networks with considerably larger inhibitory strengths, we observe the emergence of a complex evolved topology, where neurons sparsely connected to other neurons, also a typical topology of the brain. The presence of noise enhances the strength of both types of synapses, but if the initial network has synapses of both natures with similar strengths. Finally, we show how the synchronous behaviour of the evolved network will reflect its evolved topology.

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 presence of undesirable dominating signals in geophysical experimental data is a challenge in many subfields. One remarkable example is surface gravimetry, where frequencies from Earth tides correspond to time-series fluctuations up to a thousand times larger than the phenomena of major interest, such as hydrological gravity effects or co-seismic gravity changes. This work discusses general methods for removal of unwanted dominating signals by applying them to 8 long-period gravity time-series of the International Geodynamics and Earth Tides Service, equivalent to the acquisition from 8 instruments in 5 locations representative of the network. We compare three different conceptual approaches for tide removal: frequency filtering, physical modelling and data-based modelling. Each approach reveals a different limitation to be considered depending on the intended application. Vestiges of tides remain in the residues for the modelling procedures, whereas the signal was distorted in different ways by the filtering and data-based procedures. The linear techniques employed were power spectral density, spectrogram, cross-correlation and classical harmonics decomposition, while the system dynamics was analysed by state-space reconstruction and estimation of the largest Lyapunov exponent. Although the tides could not be completely eliminated, they were sufficiently reduced to allow observation of geophysical events of interest above the $10 \text{ nm s}^{-2}$ level, exemplified by a hydrology-related event of $60 \text{ nm s}^{-2}$. The implementations adopted for each conceptual approach are general, so that their principles could be applied to other kinds of data affected by undesired signals composed mainly by periodic or quasi-periodic components., Comment: This preprint includes the Supplementary Materials

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

In a causal world the direction of the time arrow dictates how past causal events in a variable $X$ produce future effects in $Y$. $X$ is said to cause an effect in $Y$, if the predictability (uncertainty) about the future states of $Y$ increases (decreases) as its own past and the past of $X$ are taken into consideration. Causality is thus intrinsic dependent on the observation of the past events of both variables involved, to the prediction (or uncertainty reduction) of future event of the other variable. We will show that this {{temporal}} notion of causality leads to another natural spatio-temporal definition for it, and that can be exploited to detect the arrow of influence from $X$ to $Y$, either by considering shorter time-series of $X$ and longer time-series of $Y$ (an approach that explores the time nature of causality) or lower precision measured time-series in $X$ and higher precision measured time-series in $Y$ (an approach that explores the spatial nature of causality). Causality has thus space and time signatures, causing a break of symmetry in the topology of the probabilistic space, or causing a break of symmetry in the length of the measured time-series, a consequence of the fact that information flows from $X$ to $Y$.

Understanding the interactions among nodes in a complex network is of great importance, since they disclose how these nodes are cooperatively supporting the functioning of the network. Scientists have developed numerous methods to uncover the underlying adjacent physical connectivity based on measurements of functional quantities of the nodes states. Often, the physical connectivity, the adjacency matrix, is available. Yet, little is known about how this adjacent connectivity impacts on the "hidden" flows being exchanged between any two arbitrary nodes, after travelling longer non-adjacent paths. In this Letter, we show that hidden physical flows in conservative flow networks, a quantity that is usually inaccessible to measurements, can be determined by the interchange of physical flows between any pair of adjacent nodes. Our approach applies to steady or dynamic state of either linear or non-linear complex networks that can be modelled by conservative flow networks, such as gas supply networks, water supply networks and power grids.

Nonlinear dynamical systems may be exposed to tipping points, critical thresholds at which small changes in the external inputs or in the systems parameters abruptly shift the system to an alternative state with a contrasting dynamical behavior. While tipping in a fold bifurcation of an equilibrium is well understood, much less is known about tipping of oscillations (limit cycles) though this dynamics are the typical response of many natural systems to a periodic external forcing, like e.g. seasonal forcing in ecology and climate sciences. We provide a detailed analysis of tipping phenomena in periodically forced systems and show that, when limit cycles are considered, a transient structure, so-called channel, plays a fundamental role in the transition. Specifically, we demonstrate that trajectories crossing such channel conserve, for a characteristic time, the twisting behavior of the stable limit cycle destroyed in the fold bifurcation of cycles. As a consequence, this channel acts like a ghost of the limit cycle destroyed in the critical transition and instead of the expected abrupt transition we find a smooth one. This smoothness is also the reason that it is difficult to precisely determine the transition point employing the usual indicators of tipping points, like critical slowing down and flickering.

The electric power system is one of the cornerstones of modern society. One of its most serious malfunctions is the blackout, a catastrophic event that may disrupt a substantial portion of the system, playing havoc to human life and causing great economic losses. Thus, understanding the mechanisms leading to blackouts and creating a reliable and resilient power grid has been a major issue, attracting the attention of scientists, engineers and stakeholders. In this paper, we study the blackout problem in power grids by considering a practical phase-oscillator model. This model allows one to simultaneously consider different types of power sources (e.g., traditional AC power plants and renewable power sources connected by DC/AC inverters) and different types of loads (e.g., consumers connected to distribution networks and consumers directly connected to power plants). We propose two new control strategies based on our model, one for traditional power grids, and another one for smart grids. The control strategies show the efficient function of the fast-response energy storage systems in preventing and predicting blackouts in smart grids. This work provides innovative ideas which help us to build up a robuster and more economic smart power system.

We study the capacity of Hodgkin-Huxley neuron in a network to change temporarily or permanently their connections and behavior, the so called spike timing-dependent plasticity (STDP), as a function of their synchronous behavior. We consider STDP of excitatory and inhibitory synapses driven by Hebbian rules. We show that the final state of networks evolved by a STDP depend on the initial network configuration. Specifically, an initial all-to-all topology envolves to a complex topology. Moreover, external perturbations can induce co-existence of clusters, those whose neurons are synchronous and those whose neurons are desynchronous. This work reveals that STDP based on Hebbian rules leads to a change in the direction of the synapses between high and low frequency neurons, and therefore, Hebbian learning can be explained in terms of preferential attachment between these two diverse communities of neurons, those with low-frequency spiking neurons, and those with higher-frequency spiking neurons., Comment: 8 pages, 6 figures

In this paper, we explore the role of network topology on maintaining the extensive property of entropy. We study analytically and numerically how the topology contributes to maintaining extensivity of entropy in multiplex networks, i.e. networks of subnetworks (layers), by means of the sum of the positive Lyapunov exponents, $H_{KS}$, a quantity related to entropy. We show that extensivity relies not only on the interplay between the coupling strengths of the dynamics associated to the intra (short-range) and inter (long-range) interactions, but also on the sum of the intra-degrees of the nodes of the layers. For the analytically treated networks of size $N$, among several other results, we show that if the sum of the intra-degrees (and the sum of inter-degrees) scales as $N^{\theta+1},\;\theta>0$, extensivity can be maintained if the intra-coupling (and the inter-coupling) strength scales as $N^{-\theta}$, when evolution is driven by the maximisation of $H_{KS}$. We then verify our analytical results by performing numerical simulations in multiplex networks formed by electrically and chemically coupled neurons., Comment: 17 pages, 2 figures

This work proposes a markovian memoryless model for the DNA that simplifies enormously the complexity of it. We encode nucleotide sequences into symbolic sequences, called words, from which we establish meaningful length of words and group of words that share symbolic similarities. Interpreting a node to represent a group of similar words and edges to represent their functional connectivity allows us to construct a network of the grammatical rules governing the appearance of group of words in the DNA. Our model allows to predict the transition between group of words in the DNA with unprecedented accuracy, and to easily calculate many informational quantities to better characterize the DNA. In addition, we reduce the DNA of known bacteria to a network of only tens of nodes, show how our model can be used to detect similar (or dissimilar) genes in different organisms, and which sequences of symbols are responsible for the most of the information content of the DNA. Therefore, the DNA can indeed be treated as a language, a markovian language, where a "word" is an element of a group, and its grammar represents the rules behind the probability of transitions between any two groups., Comment: 17 pages and 5 figures

We have obtained a high resolution parameter space of an experimental Chua's circuit and shown that the topology of the chaotic and periodic regions present not only expected features previously observed from high resolution numerical simulations of idealised Chua's circuit, but also novel unexpected features. Unmatched feedback resistances cause the formation of at least two competing spirals with consequent disrupted or malformed shrimps. We have also confirmed experimentally that the period-adding bifurcation route is formed by periodic regions whose size decrease exponentially with their period, and consequently, periodic behaviour with higher period is unlikely to be observed. The higher-resolution span of parameters was possible by the use of a newly designed potentiometer that could be potentially used in other electronic equipments to reveal hidden behaviours. To have such resistances we developed in series arrays of resistors short-circuited by relays as discrete potentiometers with 1024 steps, and resolutions of 0.100 $\Omega$ for $r_L$ in series with the inductor, and 0.200 $\Omega$ for R connecting the two capacitors.

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.

We propose a working hypothesis supported by numerical simulations that brain networks evolve based on the principle of the maximization of their internal information flow capacity. We find that synchronous behavior and capacity of information flow of the evolved networks reproduce well the same behaviors observed in the brain dynamical networks of Caenorhabditis elegans and humans, networks of Hindmarsh-Rose neurons with graphs given by these brain networks. We make a strong case to verify our hypothesis by showing that the neural networks with the closest graph distance to the brain networks of Caenorhabditis elegans and humans are the Hindmarsh-Rose neural networks evolved with coupling strengths that maximize information flow capacity. Surprisingly, we find that global neural synchronization levels decrease during brain evolution, reflecting on an underlying global no Hebbian-like evolution process, which is driven by no Hebbian-like learning behaviors for some of the clusters during evolution, and Hebbian-like learning rules for clusters where neurons increase their synchronization., Comment: 27 pages, 8 figures, 2 tables, supporting_information included, published in PLOS Computational Biology

The brain of mammals are divided into different cortical areas that are anatomically connected forming larger networks which perform cognitive tasks. The cat cerebral cortex is composed of 65 areas organised into the visual, auditory, somatosensory-motor and frontolimbic cognitive regions. We have built a network of networks, in which networks are connected among themselves according to the connections observed in the cat cortical areas aiming to study how inputs drive the synchronous behaviour in this cat brain-like network. We show that without external perturbations it is possible to observe high level of bursting synchronisation between neurons within almost all areas, except for the auditory area. Bursting synchronisation appears between neurons in the auditory region when an external perturbation is applied in another cognitive area. This is a clear evidence that pattern formation and collective behaviour in the brain might be a process mediated by other brain areas under stimulation.

In this work, we present novel general analytical solutions for the currents that are developed in the edges of network-like circuits when some nodes of the network act as sources/sinks of DC or AC current. We assume that Ohm's law is valid at every edge and that charge at every node is conserved (with the exception of the source/sink nodes). The resistive, capacitive, and/or inductive properties of the lines in the circuit define a complex network structure with given impedances for each edge. Our solution for the currents at each edge is derived in terms of the eigenvalues and eigenvectors of the Laplacian matrix of the network defined from the impedances. This derivation also allows us to compute the equivalent impedance between any two nodes of the circuit and relate it to currents in a closed circuit which has a single voltage generator instead of many input/output source/sink nodes. Contrary to solving Kirchhoff's equations, our derivation allows to easily calculate the redistribution of currents that occurs when the location of sources and sinks changes within the network. Finally, we show that our solutions are identical to the ones found from Circuit Theory node analysis., Comment: 9 pages, 6 figures, 3 figure captions

The inference of an underlying network topology from local observations of a complex system composed of interacting units is usually attempted by using statistical similarity measures, such as Cross-Correlation (CC) and Mutual Information (MI). The possible existence of a direct link between different units is, however, hindered within the time-series measurements. Here we show that, for the class of systems studied, when an abrupt change in the ordered set of CC or MI values exists, it is possible to infer, without errors, the underlying network topology from the time-series measurements, even in the presence of observational noise, non-identical units, and coupling heterogeneity. We find that a necessary condition for the discontinuity to occur is that the dynamics of the coupled units is partially coherent, i.e., neither complete disorder nor globally synchronous patterns are present. We critically compare the inference methods based on CC and MI, in terms of how effective, robust, and reliable they are, and conclude that, in general, MI outperforms CC in robustness and reliability. Our findings could be relevant for the construction and interpretation of functional networks, such as those constructed from brain or climate data., Comment: 8 pages, 18 figures, 6 figure captions

This article reviews different kinds of models for the electric power grid that can be used to understand the modern power system, the smart grid. From the physical network to abstract energy markets, we identify in the literature different aspects that co-determine the spatio-temporal multilayer dynamics of power system. We start our review by showing how the generation, transmission and distribution characteristics of the traditional power grids are already subject to complex behaviour appearing as a result of the the interplay between dynamics of the nodes and topology, namely synchronisation and cascade effects. When dealing with smart grids, the system complexity increases even more: on top of the physical network of power lines and controllable sources of electricity, the modernisation brings information networks, renewable intermittent generation, market liberalisation, prosumers, among other aspects. In this case, we forecast a dynamical co-evolution of the smart grid and other kind of networked systems that cannot be understood isolated. This review compiles recent results that model electric power grids as complex systems, going beyond pure technological aspects. From this perspective, we then indicate possible ways to incorporate the diverse co-evolving systems into the smart grid model using, for example, network theory and multi-agent simulation., Comment: Submitted to EPJ-ST Power Grids, May 2015

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 ability to design a transport network such that commodities are brought from suppliers to consumers in a steady, optimal, and stable way is of great importance for nowadays distribution systems. In this Letter, by using the circuit laws of Kirchhoff and Ohm, we provide the exact capacities of the edges that an optimal supply-demand network should have to operate stably under perturbations. The perturbations we consider are the evolution of the connecting topology, the decentralisation of hub sources or sinks, and the intermittence of suppliers/consumers characteristics. We analyse these conditions and the impact of our results, both on the current UK power-grid structure and on numerically generated evolving archetypal network topologies., Comment: 5 pages, 5 figures, 3 captions

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.

This Letter presents a unified approach for the fundamental relationship between structure and function in flow networks by solving analytically the voltages in a resistor network, transforming the network structure to an effective all-to-all topology, and then measuring the resultant flows. Moreover, it defines a way to study the structural resilience of the graph and to detect possible communities., Comment: 5 pages, 4 figures

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

We study Poincare recurrence of chaotic attractors for regions of finite size. Contrary to the standard case, where the size of the recurrent regions tends to zero, the measure is not supported anymore solely by unstable periodic orbits inside it, but also by other special recurrent trajectories, located outside that region. The presence of the latter leads to a deviation of the distribution of the Poincare first return times from a Poissonian. Consequently, by taken into account the contribution of these recurrent trajectories, a corrected estimate of the measure can be provided. This has wide experimental implications, as in the laboratory all returns can exclusively be observed for regions of finite size only., Comment: 4 pages, submitted for publication