arXiv subjects

Nicolás Rubido

Publications and source records attributed to Nicolás Rubido.

14 recordsLinked to original sources

arXiv2025

Including the magnitude variability of a signal into the ordinal pattern analysis

One of the most popular and innovative methods to analyse signals is by using Ordinal Patterns (OPs). The OP encoding is based on transforming a (univariate) signal into a symbolic sequence of OPs, where each OP represents the number of permutations needed to order a small subset of the signal's magnitudes. This implies that OPs are conceptually clear, methodologically simple to implement, robust to noise, and can be applied to short signals. Moreover, they simplify the statistical analyses that can be carried out on a signal, such as entropy and complexity quantifications. However, because of the relative ordering, information about the magnitude of the signal at each timestamp is lost -- this being one of the major drawbacks in the method. Here, we propose a way to use the signal magnitudes discarded in the OP encoding as a complementary variable to its permutation entropy. To illustrate our approach, we analyse synthetic trajectories from logistic and H{é}non maps -- with and without added noise -- and intracranial electroencephalographic recordings from rats in different sleep-wake states. Our results show that, when complementing the permutation entropy with the variability in the signal magnitudes, the characterisation of the dynamical behaviours of the maps and the sleep-wake states is improved. This implies that our approach can be useful for feature engineering and improving AI classifiers, where typical machine learning algorithms need complementary signal features as inputs to improve classification accuracy.

nlin.CD↗

arXiv2022

Critical parameters of the synchronisation's stability for coupled maps in regular graphs

Coupled Map Lattice (CML) models are particularly suitable to study spatially extended behaviours, such as wave-like patterns, spatio-temporal chaos, and synchronisation. Complete synchronisation in CMLs emerges when all maps have their state variables with equal magnitude, forming a spatially-uniform pattern that evolves in time. Here, we derive critical values for the parameters -- coupling strength, maximum Lyapunov exponent, and link density -- that control the synchronisation-manifold's linear stability of diffusively-coupled, identical, chaotic maps in generic regular graphs (i.e., graphs with uniform node degrees) and class-specific cyclic graphs (i.e., periodic lattices with cyclical node permutation symmetries). Our derivations are based on the Laplacian matrix eigenvalues, where we give closed-form expressions for the smallest non-zero eigenvalue and largest eigenvalue of regular graphs and show that these graphs can be classified into two sets according to a topological condition (derived from the stability analysis). We also make derivations for two classes of cyclic graph: $k$-cycles (i.e., regular lattices of even degree $k$, which can be embedded in $T^k$ tori) and $k$-Möbius ladders, which we introduce here to generalise the Möbius ladder of degree $k = 3$. Our results highlight differences in the synchronisation manifold's stability of these graphs -- even for identical node degrees -- in the finite size and infinite size limit.

nlin.CD↗

arXiv2021

Community detection by resistance distance: automation and benchmark testing

Heterogeneity characterises real-world networks, where nodes show a broad range of different topological features. However, nodes also tend to organise into communities -- subsets of nodes that are sparsely inter-connected but are densely intra-connected (more than the network's average connectivity). This means that nodes belonging to the same community are close to each other by some distance measure, such as the resistance distance, which is the effective distance between any pair of nodes considering all possible paths. In this work, we present automation (i.e., unsupervised) and missing accuracy tests for a recently proposed semi-supervised community detection algorithm based on the resistance distance. The accuracy testing involves quantifying our algorithm's performance in terms of recovering known synthetic communities from benchmark networks, where we present results for Girvan-Newman and Lancichinetti-Fortunato-Radicchi networks. Our findings show that our algorithm falls into the class of accurate performers.

physics.soc-ph↗

arXiv2020

Observation of bifurcations and hysteresis in experimentally coupled logistic maps

Initially, the logistic map became popular as a simplified model for population growth. In spite of its apparent simplicity, as the population growth-rate is increased the map exhibits a broad range of dynamics, which include bifurcation cascades going from periodic to chaotic solutions. Studying coupled maps allows to identify other qualitative changes in the collective dynamics, such as pattern formations or hysteresis. Particularly, hysteresis is the appearance of different attracting sets, a set when the control parameter is increased and another set when it is decreased -- a multi-stable region. In this work, we present an experimental study on the bifurcations and hysteresis of nearly identical, coupled, logistic maps. Our logistic maps are an electronic system that has a discrete-time evolution with a high signal-to-noise ratio ($\sim10^6$), resulting in simple, precise, and reliable experimental manipulations, which include the design of a modifiable diffusive coupling configuration circuit. We find that the characterisations of the isolated and coupled logistic-maps' dynamics agrees excellently with the theoretical and numerical predictions (such as the critical bifurcation points and Feigenbaum's bifurcation velocity). Here, we report multi-stable regions appearing robustly across configurations, even though our configurations had parameter mismatch (which we measure directly from the components of the circuit and also infer from the resultant dynamics for each map) and were unavoidably affected by electronic noise.

nlin.AO↗

arXiv2020

Finding the Resistance Distance and Eigenvector Centrality from the Network's Eigenvalues

There are different measures to classify a network's data set that, depending on the problem, have different success. For example, the resistance distance and eigenvector centrality measures have been successful in revealing ecological pathways and differentiating between biomedical images of patients with Alzheimer's disease, respectively. The resistance distance measures the effective distance between any two nodes of a network taking into account all possible shortest paths between them and the eigenvector centrality measures the relative importance of each node in the network. However, both measures require knowing the network's eigenvalues and eigenvectors -- eigenvectors being the more computationally demanding task. Here, we show that we can closely approximate these two measures using only the eigenvalue spectra, where we illustrate this by experimenting on elemental resistor circuits and paradigmatic network models -- random and small-world networks. Our results are supported by analytical derivations, showing that the eigenvector centrality can be perfectly matched in all cases whilst the resistance distance can be closely approximated. Our underlying approach is based on the work by Denton, Parke, Tao, and Zhang [arXiv:1908.03795 (2019)], which is unrestricted to these topological measures and can be applied to most problems requiring the calculation of eigenvectors.

physics.soc-ph↗

arXiv2019

Small-worldness favours network inference

A main goal in the analysis of a complex system is to infer its underlying network structure from time-series observations of its behaviour. The inference process is often done by using bi-variate similarity measures, such as the cross-correlation (CC), however, the main factors favouring or hindering its success are still puzzling. Here, we use synthetic neuron models in order to reveal the main topological properties that frustrate or facilitate inferring the underlying network from CC measurements. Specifically, we use pulse-coupled Izhikevich neurons connected as in the Caenorhabditis elegans neural networks as well as in networks with similar randomness and small-worldness. We analyse the effectiveness and robustness of the inference process under different observations and collective dynamics, contrasting the results obtained from using membrane potentials and inter-spike interval time-series. We find that overall, small-worldness favours network inference and degree heterogeneity hinders it. In particular, success rates in C. elegans networks -- that combine small-world properties with degree heterogeneity -- are closer to success rates in Erdös-Rényi network models rather than those in Watts-Strogatz network models. These results are relevant to understand better the relationship between topological properties and function in different neural networks.

cond-mat.dis-nn↗

arXiv2017

Entropy-based Generating Markov Partitions for Complex Systems

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.

nlin.CD↗

arXiv2017

Understanding Information Transmission in Complex Networks

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.

nlin.AO↗

arXiv2014

The role of intermediaries in the synchronization of pulse-coupled oscillators

The role of intermediaries in the synchronization of small groups of light controlled oscillators (LCO) is addressed. A single LCO is a two-time-scale phase oscillator. When pulse-coupling two LCOs, the synchronization time decreases monotonously as the coupling strength increases, independent of the initial conditions and frequency detuning. In this work we study numerically the effects that a third LCO induces to the collective behavior of the system. We analyze the new system by dealing with directed heterogeneous couplings among the units. We report a novel and robust phenomenon, absent when coupling two LCOs, which consists of a discontinuous relationship between the synchronization time and coupling strength or initial conditions. The mechanism responsible for the appearance of such discontinuities is discussed.

nlin.CD↗

arXiv2014

Exact detection of direct links in networks of interacting dynamical units

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.

physics.data-an↗

arXiv2014

Stochastic dynamics and the noisy Brusselator behaviour

In non-linear dynamics there are several model systems to study oscillations. One iconic example is the "Brusselator", which describes the dynamics of the concentration of two chemical species in the non-equilibrium phase. In this work we study the Brusselator dynamics as a stochastic chemical reaction without diffusion analysing the corresponding stochastic differential equations with thermal or multiplicative noise. In both stochastic scenarios we investigate numerically how the Hopf bifurcation of the non-stochastic system is modified. Furthermore, we derive analytical expressions for the noise average orbits and variance of general stochastic dynamics, a general diffusion relationship in the thermal noise framework, and an asymptotic expression for the noise average quadratic deviations. Hence, besides the impact of these results on the noisy Brusselator's dynamics, our findings are also relevant for general stochastic systems.

cond-mat.stat-mech↗

arXiv2014

General analytical solutions for DC/AC circuit network analysis

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.

physics.class-ph↗

arXiv2013

Resiliently evolving supply-demand networks

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.

physics.soc-ph↗

arXiv2013

Structure and function in flow networks

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.

physics.soc-ph↗