Juan Carlos Nuño
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Juan Carlos Nuño has a total of 63 co-authors. Here are the top co-authors by number of shared publications:
- Francisco J. Munoz
Universidad Rey Juan Carlos, Spain
14 shared publications - Francisco Montero
Universidad Complutense de Madrid
11 shared publications Mario Primicerio
Dipartimento di Matematica e Informatica “Ulisse Dini”, Università degli Studi di Firenze, Firenze, Italy
6 shared publicationsEnrique Meléndez-Hevia
3 shared publications- Federico Morán
Universidad Complutense de Madrid
3 shared publications - Héctor Tejero
Spanish National Cancer Research Center (CNIO), Madrid, Spain
3 shared publications
Latest Publications
- Open Access
- 19 May 2026
- Published by Elsevier in SSRN Electronic Journal
Probabilistic Cellular Automata: between deterministic Wolfram's rules 23, 77, 178 and 232
We study one‑dimensional binary Probabilistic Cellular Automaton (PCA) that interpolate between Wolfram’s classical rules 23, 77, 178 and 232. These rules are the only ones that satisfy two criteria: (i) in the case of a majority in the neighborhood states, the central site takes either the majority state or the opposite and (ii) if the neighborhood states are tied, the central site either changes its current state or keeps it. The PCA is defined by two Bernoulli random variables with parameters $p,r\in [0,1]$, and we analytically solve small-size cases by using a Markov process formulation. We derive analytical expressions for the probability of asymptotically reaching each possible global configuration as a function of $p$ and $r$, for all initial states. We show that for $0 < p,r < 1$, the asymptotic probability distributions of achieving any of the states for the PCA are independent of the initial conditions. This contrasts with the behavior of the deterministic Wolfram's rules 23 ($p=0,r=0$), 77 ($p=1,r=0$), 178 ($p=0,r=1$) and 232 ($p=1,r=1$), for which additional asymptotic states can occur, in particular periodic configurations. Finally, we discuss applying this kind of PCA to describe opinion dynamics involving hesitant agents.- 19 May 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessProbabilistic Cellular Automata: between deterministic Wolfram's rules 23, 77, 178 and 232
We study one‑dimensional binary Probabilistic Cellular Automaton (PCA) that interpolate between Wolfram’s classical rules 23, 77, 178 and 232. These rules are the only ones that satisfy two criteria: (i) in the case of a majority in the neighborhood states, the central site takes either the majority state or the opposite and (ii) if the neighborhood states are tied, the central site either changes its current state or keeps it. The PCA is defined by two Bernoulli random variables with parameters $p,r\in [0,1]$, and we analytically solve small-size cases by using a Markov process formulation. We derive analytical expressions for the probability of asymptotically reaching each possible global configuration as a function of $p$ and $r$, for all initial states. We show that for $0 < p,r < 1$, the asymptotic probability distributions of achieving any of the states for the PCA are independent of the initial conditions. This contrasts with the behavior of the deterministic Wolfram's rules 23 ($p=0,r=0$), 77 ($p=1,r=0$), 178 ($p=0,r=1$) and 232 ($p=1,r=1$), for which additional asymptotic states can occur, in particular periodic configurations. Finally, we discuss applying this kind of PCA to describe opinion dynamics involving hesitant agents. - Open Access
Winning Opinion in the Voter Model: Following Your Friends’ Advice or That of Their Friends?
We investigate a variation of the classical voter model where the set of influencing agents depends on an individual’s current opinion. The initial population is made up of a random sample of equally sized sub-populations for each state, and two types of interactions are considered: (i) direct neighbors and (ii) second neighbors (friends of direct neighbors, excluding the direct neighbors themselves). The neighborhood size, reflecting regular network connectivity, remains constant across all agents. Our findings show that varying the interaction range introduces asymmetries that affect the probability of consensus and convergence time. At low connectivity, direct neighbor interactions dominate, leading to consensus. As connectivity increases, the probability of either state reaching consensus becomes equal, reflecting symmetric dynamics. This asymmetric effect on the probability of consensus is shown to be independent of network topology in small-world and scale-free networks. Asymmetry also influences convergence time: while symmetric cases display decreasing times with increased connectivity, asymmetric cases show an almost linear increase. Unlike the probability of reaching consensus, the impact of asymmetry on convergence time depends on the network topology. The introduction of stubborn agents further magnifies these effects, especially when they favor the less dominant state, significantly lengthening the time to consensus. We conclude by discussing the implications of these findings for decision-making processes and political campaigns in human populations.
Open AccessWinning Opinion in the Voter Model: Following Your Friends’ Advice or That of Their Friends?
We investigate a variation of the classical voter model where the set of influencing agents depends on an individual’s current opinion. The initial population is made up of a random sample of equally sized sub-populations for each state, and two types of interactions are considered: (i) direct neighbors and (ii) second neighbors (friends of direct neighbors, excluding the direct neighbors themselves). The neighborhood size, reflecting regular network connectivity, remains constant across all agents. Our findings show that varying the interaction range introduces asymmetries that affect the probability of consensus and convergence time. At low connectivity, direct neighbor interactions dominate, leading to consensus. As connectivity increases, the probability of either state reaching consensus becomes equal, reflecting symmetric dynamics. This asymmetric effect on the probability of consensus is shown to be independent of network topology in small-world and scale-free networks. Asymmetry also influences convergence time: while symmetric cases display decreasing times with increased connectivity, asymmetric cases show an almost linear increase. Unlike the probability of reaching consensus, the impact of asymmetry on convergence time depends on the network topology. The introduction of stubborn agents further magnifies these effects, especially when they favor the less dominant state, significantly lengthening the time to consensus. We conclude by discussing the implications of these findings for decision-making processes and political campaigns in human populations.
- Open Access
- 6 October 2025
- Published by MDPI AG in Preprints.org
Winning Opinion in the Voter Model: Following Your Friends’ Advice or That of Their Friends?
We investigate a variation of the classical voter model in which the set of influencing agents depends on an individual’s current opinion. The initial population consists 2 of a random sample of equally sized sub-populations for each state, and two types of interactions are considered: (i) direct neighbors, and (ii) second neighbors (friends of direct neighbors, excluding the direct neighbors themselves). The neighborhood size, reflecting regular network connectivity, is kept constant across all agents. Our findings reveal that varying the interaction range introduces asymmetries that influence the probability of consensus and convergence time. At low connectivity, direct neighbor interactions dominate, driving consensus. As connectivity increases, the probability of consensus for either state becomes equal, mirroring symmetric dynamics. It is shown that this asymmetric effect on the probability of consensus is independent of the network topology in small-world and scale-free networks. Asymmetry is also reflected in convergence time: while symmetric cases show decreasing times with increased connectivity, asymmetric cases exhibit an almost linear increase. Contrary to the probability of achieving consensus, the effect of asymmetry on the consensus time does depend on the network topology. The introduction of stubborn agents further accentuates these effects, particularly when they favor the less dominant state, significantly increasing consensus time. We conclude by discussing the implications of these findings for decision-making processes and political campaigns in human populations.
- 6 October 2025
- Published by MDPI AG in Preprints.org
Open AccessWinning Opinion in the Voter Model: Following Your Friends’ Advice or That of Their Friends?
We investigate a variation of the classical voter model in which the set of influencing agents depends on an individual’s current opinion. The initial population consists 2 of a random sample of equally sized sub-populations for each state, and two types of interactions are considered: (i) direct neighbors, and (ii) second neighbors (friends of direct neighbors, excluding the direct neighbors themselves). The neighborhood size, reflecting regular network connectivity, is kept constant across all agents. Our findings reveal that varying the interaction range introduces asymmetries that influence the probability of consensus and convergence time. At low connectivity, direct neighbor interactions dominate, driving consensus. As connectivity increases, the probability of consensus for either state becomes equal, mirroring symmetric dynamics. It is shown that this asymmetric effect on the probability of consensus is independent of the network topology in small-world and scale-free networks. Asymmetry is also reflected in convergence time: while symmetric cases show decreasing times with increased connectivity, asymmetric cases exhibit an almost linear increase. Contrary to the probability of achieving consensus, the effect of asymmetry on the consensus time does depend on the network topology. The introduction of stubborn agents further accentuates these effects, particularly when they favor the less dominant state, significantly increasing consensus time. We conclude by discussing the implications of these findings for decision-making processes and political campaigns in human populations.
- Open Access
- 14 August 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (16) , 2598
Rule-Based Generation of de Bruijn Sequences: Memory and Learning
We investigate binary sequences generated by non-Markovian rules with memory length , similar to those adopted in elementary cellular automata. This generation procedure is equivalent to a shift register, and certain rules produce sequences with maximal periods, known as de Bruijn sequences. We introduce a novel methodology for generating de Bruijn sequences that combines (i) a set of derived properties that significantly reduce the space of feasible generating rules and (ii) a neural-network-based classifier that identifies which rules produce de Bruijn sequences. The experiments for some values of demonstrate the approach’s effectiveness and computational efficiency.- 14 August 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (16) , 2598
Open AccessRule-Based Generation of de Bruijn Sequences: Memory and Learning
We investigate binary sequences generated by non-Markovian rules with memory length , similar to those adopted in elementary cellular automata. This generation procedure is equivalent to a shift register, and certain rules produce sequences with maximal periods, known as de Bruijn sequences. We introduce a novel methodology for generating de Bruijn sequences that combines (i) a set of derived properties that significantly reduce the space of feasible generating rules and (ii) a neural-network-based classifier that identifies which rules produce de Bruijn sequences. The experiments for some values of demonstrate the approach’s effectiveness and computational efficiency. - Open Access
- 15 July 2025
- Published by MDPI AG in Preprints.org
Rule-Based Generation of De Bruijn Sequences: Memory and Learning
We investigate binary sequences generated by non-Markovian rules with memory length $\mu$, similar to those adopted in Elementary Cellular Automata. This generation procedure is equivalente to a shift register and certain rules produce sequences with maximal periods, known as de Bruijn sequences. We introduce a novel methodology for generating de Bruijn sequences that combines: (i) a set of derived properties that significantly reduce the space of feasible generating rules, and (ii) a neural network-based classifier that identifies which rules produce de Bruijn sequences. Experiments for large values of $\mu$ demonstrate the approach’s effectiveness and computational efficiency.- 15 July 2025
- Published by MDPI AG in Preprints.org
Open AccessRule-Based Generation of De Bruijn Sequences: Memory and Learning
We investigate binary sequences generated by non-Markovian rules with memory length $\mu$, similar to those adopted in Elementary Cellular Automata. This generation procedure is equivalente to a shift register and certain rules produce sequences with maximal periods, known as de Bruijn sequences. We introduce a novel methodology for generating de Bruijn sequences that combines: (i) a set of derived properties that significantly reduce the space of feasible generating rules, and (ii) a neural network-based classifier that identifies which rules produce de Bruijn sequences. Experiments for large values of $\mu$ demonstrate the approach’s effectiveness and computational efficiency. - 12 August 2024
- Published by Springer Nature in Ricerche di Matematica
- p. 1-19
Spatial effects of two-stage contagion: a Cellular Automata model
- 12 August 2024
- Published by Springer Nature in Ricerche di Matematica
- p. 1-19
Spatial effects of two-stage contagion: a Cellular Automata model
- Open Access
- 6 July 2024
- Published by Wiley in Molecular Ecology Resources
- Vol. 25 (3) , e13992
Missing genotype imputation in non‐model species using self‐organizing maps
Current methodologies of genome‐wide single‐nucleotide polymorphism (SNP) genotyping produce large amounts of missing data that may affect statistical inference and bias the outcome of experiments. Genotype imputation is routinely used in well‐studied species to buffer the impact in downstream analysis, and several algorithms are available to fill in missing genotypes. The lack of reference haplotype panels precludes the use of these methods in genomic studies on non‐model organisms. As an alternative, machine learning algorithms are employed to explore the genotype data and to estimate the missing genotypes. Here, we propose an imputation method based on self‐organizing maps (SOM), a widely used neural networks formed by spatially distributed neurons that cluster similar inputs into close neurons. The method explores genotype datasets to select SNP loci to build binary vectors from the genotypes, and initializes and trains neural networks for each query missing SNP genotype. The SOM‐derived clustering is then used to impute the best genotype. To automate the imputation process, we have implemented gtImputation, an open‐source application programmed in Python3 and with a user‐friendly GUI to facilitate the whole process. The method performance was validated by comparing its accuracy, precision and sensitivity on several benchmark genotype datasets with other available imputation algorithms. Our approach produced highly accurate and precise genotype imputations even for SNPs with alleles at low frequency and outperformed other algorithms, especially for datasets from mixed populations with unrelated individuals.
- 6 July 2024
- Published by Wiley in Molecular Ecology Resources
- Vol. 25 (3) , e13992
Open AccessMissing genotype imputation in non‐model species using self‐organizing maps
Current methodologies of genome‐wide single‐nucleotide polymorphism (SNP) genotyping produce large amounts of missing data that may affect statistical inference and bias the outcome of experiments. Genotype imputation is routinely used in well‐studied species to buffer the impact in downstream analysis, and several algorithms are available to fill in missing genotypes. The lack of reference haplotype panels precludes the use of these methods in genomic studies on non‐model organisms. As an alternative, machine learning algorithms are employed to explore the genotype data and to estimate the missing genotypes. Here, we propose an imputation method based on self‐organizing maps (SOM), a widely used neural networks formed by spatially distributed neurons that cluster similar inputs into close neurons. The method explores genotype datasets to select SNP loci to build binary vectors from the genotypes, and initializes and trains neural networks for each query missing SNP genotype. The SOM‐derived clustering is then used to impute the best genotype. To automate the imputation process, we have implemented gtImputation, an open‐source application programmed in Python3 and with a user‐friendly GUI to facilitate the whole process. The method performance was validated by comparing its accuracy, precision and sensitivity on several benchmark genotype datasets with other available imputation algorithms. Our approach produced highly accurate and precise genotype imputations even for SNPs with alleles at low frequency and outperformed other algorithms, especially for datasets from mixed populations with unrelated individuals.
- Open Access
- 1 July 2024
- Published by Oxford University Press (OUP) in in silico Plants
- Vol. 6 (2)
ModelBark: a toy model to study bark formation in woody species
The study of growth of woody species is a challenging issue, primarily due to the complexity of the involved processes, which span broad spatial and temporal scales. Very often, this latter aspect almost precludes complete experimentation, thereby hindering the comparison between theoretical predictions and real-world observations. Computer simulations offer an alternative approach, allowing for data collection based on theoretical assumptions, and has been applied to the analysis of different features in plant development, as the production of secondary vascular tissues, xylem and phloem, in woody plants. However, the simulation of bark development faces added difficulties, due to the scarcity of experimental observations to base the model on. In this article, we introduce a computer model designed to simulate bark formation based on mechanical stimuli acting on the various types of cells comprising this tissue. Our model can be conceptualized as a cellular automaton of variable size with non-local updating rules. By adjusting the parameters defining the model, we investigate the most influential factors in bark development, obtaining the most common bark types observed in trees. Furthermore, we provide an intuitive interface, making it suitable for educational purposes as well.
- 1 July 2024
- Published by Oxford University Press (OUP) in in silico Plants
- Vol. 6 (2)
Open AccessModelBark: a toy model to study bark formation in woody species
The study of growth of woody species is a challenging issue, primarily due to the complexity of the involved processes, which span broad spatial and temporal scales. Very often, this latter aspect almost precludes complete experimentation, thereby hindering the comparison between theoretical predictions and real-world observations. Computer simulations offer an alternative approach, allowing for data collection based on theoretical assumptions, and has been applied to the analysis of different features in plant development, as the production of secondary vascular tissues, xylem and phloem, in woody plants. However, the simulation of bark development faces added difficulties, due to the scarcity of experimental observations to base the model on. In this article, we introduce a computer model designed to simulate bark formation based on mechanical stimuli acting on the various types of cells comprising this tissue. Our model can be conceptualized as a cellular automaton of variable size with non-local updating rules. By adjusting the parameters defining the model, we investigate the most influential factors in bark development, obtaining the most common bark types observed in trees. Furthermore, we provide an intuitive interface, making it suitable for educational purposes as well.
- Open Access
Exploring the limits of the law of mass action in the mean field description of epidemics on Erdös-Rényi networks
The manner epidemics occurs in a social network depends on various elements, with two of the most influential being the relationships among individuals in the population and the mechanism of transmission. In this paper, we assume that the social network has a homogeneous random topology of Erdös-Rényi type. Regarding the contagion process, we assume that the probability of infection is proportional to the proportion of infected neighbours. We consider a constant population, whose individuals are the nodes of the social network, formed by two variable subpopulations: Susceptible and Infected (SI model). We simulate the epidemics on this random network and study whether the average dynamics can be described using a mean field approach in terms of Differential Equations, employing the law of mass action. We show that a macroscopic description could be applied for low average connectivity, adjusting the value of the contagion rate in a precise function. This dependence is illustrated by calculating the transient times for each connectivity. This study contributes valuable insights into the interplay between network connectivity, contagion dynamics, and the applicability of mean-field approximations. The delineation of critical thresholds and the distinctive behaviour at lower connectivity enable a deeper understanding of epidemic dynamics.
Open AccessExploring the limits of the law of mass action in the mean field description of epidemics on Erdös-Rényi networks
The manner epidemics occurs in a social network depends on various elements, with two of the most influential being the relationships among individuals in the population and the mechanism of transmission. In this paper, we assume that the social network has a homogeneous random topology of Erdös-Rényi type. Regarding the contagion process, we assume that the probability of infection is proportional to the proportion of infected neighbours. We consider a constant population, whose individuals are the nodes of the social network, formed by two variable subpopulations: Susceptible and Infected (SI model). We simulate the epidemics on this random network and study whether the average dynamics can be described using a mean field approach in terms of Differential Equations, employing the law of mass action. We show that a macroscopic description could be applied for low average connectivity, adjusting the value of the contagion rate in a precise function. This dependence is illustrated by calculating the transient times for each connectivity. This study contributes valuable insights into the interplay between network connectivity, contagion dynamics, and the applicability of mean-field approximations. The delineation of critical thresholds and the distinctive behaviour at lower connectivity enable a deeper understanding of epidemic dynamics.
- Open Access
- 1 March 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (5) , 742
The Ruler Sequence Revisited: A Dynamic Perspective
The Ruler function or the Gros sequence is a classical infinite integer sequence that underlies some interesting mathematical problems. In this paper, we provide four new problems containing this type of sequence: (i) demographic discrete dynamical automaton, (ii) the middle interval Cantor set, (iii) construction by duplication of polygons and (iv) the horizontal visibility sequence at the accumulation point of the Feigenbaum cascade. In all of them, the infinite sequence is obtained through a recursive procedure of duplication. The properties of the ruler sequence, in particular, those relating to recursiveness and self-containing, are used to achieve a deeper understanding of these four problems. These new representations of the ruler sequence could inspire new studies in the field of discrete mathematics.
- 1 March 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (5) , 742
Open AccessThe Ruler Sequence Revisited: A Dynamic Perspective
The Ruler function or the Gros sequence is a classical infinite integer sequence that underlies some interesting mathematical problems. In this paper, we provide four new problems containing this type of sequence: (i) demographic discrete dynamical automaton, (ii) the middle interval Cantor set, (iii) construction by duplication of polygons and (iv) the horizontal visibility sequence at the accumulation point of the Feigenbaum cascade. In all of them, the infinite sequence is obtained through a recursive procedure of duplication. The properties of the ruler sequence, in particular, those relating to recursiveness and self-containing, are used to achieve a deeper understanding of these four problems. These new representations of the ruler sequence could inspire new studies in the field of discrete mathematics.