Marco Montalva-Medel
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
Marco Montalva-Medel has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Eric Goles
Facultad de Ciencias y Tecnología Universidad Adolfo Ibáñez Santiago Chile
6 shared publications - Alonso Espinoza
Univesidad Adolfo Ibañez
3 shared publications E. Fanchon
3 shared publications- Gonzalo A. Ruz
Facultad de Ingeniería y Ciencias, Universidad Adolfo Ibáñez, Santiago, Chile
3 shared publications Eric Goles
Facultad de Ingeniería y Ciencias, Univ. Adolfo Ibáñez, Av. Diagonal Las Torres 2700, Peñalolen, Santiago, Chile
2 shared publications- Eurico L. P. Ruivo
Universidade Presbiteriana Mackenzie
2 shared publications
Latest Publications
- Open Access
- 1 January 2027
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems - S
- Vol. 32, 373-398
Robustness of Boolean networks to update modes: An application to hereditary angioedema
Many familial diseases are caused by genetic accidents, which affect both the genome and its epigenetic environment, expressed as an interaction graph between the genes, such as that involved in the familial disease we shall study, the hereditary angioedema. The update of the gene states at the vertices of this graph (1 if a gene is activated, 0 if it is inhibited) can be done in multiple ways, and has been well studied over the last two decades: parallel, sequential, block-sequential, block-parallel, random, etc. We will study a particular graph related to the familial disease proposed as an example, which has subgraphs which activate in an intricate manner (i.e., in an alternating block-parallel mode, with one core constantly updated and two complementary subsets of genes alternating their updating), of which we will study the structural aspects, robust or unstable, in relation to some classical periodic update modes.
- 1 January 2027
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems - S
- Vol. 32, 373-398
Open AccessRobustness of Boolean networks to update modes: An application to hereditary angioedema
Many familial diseases are caused by genetic accidents, which affect both the genome and its epigenetic environment, expressed as an interaction graph between the genes, such as that involved in the familial disease we shall study, the hereditary angioedema. The update of the gene states at the vertices of this graph (1 if a gene is activated, 0 if it is inhibited) can be done in multiple ways, and has been well studied over the last two decades: parallel, sequential, block-sequential, block-parallel, random, etc. We will study a particular graph related to the familial disease proposed as an example, which has subgraphs which activate in an intricate manner (i.e., in an alternating block-parallel mode, with one core constantly updated and two complementary subsets of genes alternating their updating), of which we will study the structural aspects, robust or unstable, in relation to some classical periodic update modes.
- Open Access
- 15 September 2026
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 21 (9) , e0357764
Boolean-network simplification and rule fitting to unravel chemotherapy resistance in non-small cell lung cancer
Boolean networks are powerful frameworks for capturing the logic of gene-regulatory circuits, yet their combinatorial explosion hampers exhaustive analyses. Here, we present a systematic reduction of a published 31-node Boolean model that describes cisplatin- and pemetrexed-resistance in non-small-cell lung cancer to a compact 9-node core that exactly reproduces the original attractor landscape. Through a sequence of biologically guided reductions ( 31 → 29 → 14 → 9 nodes), the streamlined network shrinks the state space by four orders of magnitude, enabling rapid exploration of critical control points, rules fitting, and candidate therapeutic targets. Extensive synchronous and asynchronous simulations, combined with a Boolean rule-fitting algorithm that removes spurious limit cycles, confirm that the three clinically relevant steady states and their basins of attraction are conserved and reflect resistance frequencies close to those reported in clinical studies. The reduced model provides an accessible scaffold for future mechanistic and drug-discovery studies.
- 15 September 2026
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 21 (9) , e0357764
Open AccessBoolean-network simplification and rule fitting to unravel chemotherapy resistance in non-small cell lung cancer
Boolean networks are powerful frameworks for capturing the logic of gene-regulatory circuits, yet their combinatorial explosion hampers exhaustive analyses. Here, we present a systematic reduction of a published 31-node Boolean model that describes cisplatin- and pemetrexed-resistance in non-small-cell lung cancer to a compact 9-node core that exactly reproduces the original attractor landscape. Through a sequence of biologically guided reductions ( 31 → 29 → 14 → 9 nodes), the streamlined network shrinks the state space by four orders of magnitude, enabling rapid exploration of critical control points, rules fitting, and candidate therapeutic targets. Extensive synchronous and asynchronous simulations, combined with a Boolean rule-fitting algorithm that removes spurious limit cycles, confirm that the three clinically relevant steady states and their basins of attraction are conserved and reflect resistance frequencies close to those reported in clinical studies. The reduced model provides an accessible scaffold for future mechanistic and drug-discovery studies.
- 30 March 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Problèmes type "Feedback Set" et comportement dynamique des réseaux de régulation
Dans la nature existent de nombreux exemples de systèmes dynamiques complexes: systèmes neuronaux, communautés, écosystèmes, réseaux de régulation génétiques, etc. Ces derniers, en particulier, sont de notre intérêt et sont souvent modélisés par des réseaux booléens. Un réseau booléenne peut être considérée comme un digraphe, où les sommets correspondent à des gènes ou de produits de gènes, tandis que les arcs indiquent les interactions entre eux. Une niveau d'expression des gènes est modélisé par des valeurs binaires, 0 ou 1, indiquant deux états de la transcription, soit activité, soit inactivité, respectivement, et ce niveau change dans le temps selon certains fonction locaux d'activation qui dépend des états d'un ensemble de nœuds (les gènes). L'effet conjoint des fonctions d'activation locale définit une fonction de transition globale: ainsi, le autre élément nécessaire dans la description du modèle est fonction de mise à jour, qui détermine quand chaque nœud doit être mis à jour, et donc, comme les fonctions local se combinent dans une fonction globale (en d'autres termes, il doit décrire les temps relative de les activités régulatoires). Comme un réseau booléen avec n sommets a 2 ^ n états globaux, à partir d'un état de départ, et dans un nombre fini de mises à jour, le réseau atteindra un fixe point ou un cycle limite, appelée attracteurs qui sont souvent associées à des phénotypes distincts (états-cellulaire) définis par les patrons d'activité des gènes. Un réseau de régulation Booléenne (REBN) est un réseau Booléen où chaque interaction entre les éléments de la réseau correspond soit à une interaction positif ou d'une interaction négative. Ainsi, le digraphe interaction associée à une REBN est un digraphe signé où un circuit est appelé positif (négatif) si le nombre de ses arcs négative est pair (impair). Dans ce contexte, il y a diverses études sur l'importance du les circuits positif et négatifs dans le comportement dynamique de différents systèmes en Biologie. En effet le point de départ de cette thèse est basée sur un résultat en disant que le nombre maximal de points fixes d'une REBN dépend d'un ensemble de cardinalité minimale qu'intersecte tous les cycles positifs (également dénommés positive feedback vertex set) du digraphe signé associé. D'autre part, un autre aspect important de circuits est leur rôle dans la robustesse des réseaux booléens par rapport différents types de mise à jour déterministe. Dans ce contexte, un élément clé mathématique est le update digraphe qui est un digraphe étiqueté associé à la réseau dont les étiquettes sur les arcs sont définies comme suit: un arc (u,v) est dit être positif si l'état de sommet u est mis à jour en même temps ou après que celle de v, et négative sinon. Ainsi, un cycle dans le digraphe étiqueté est dite positive (négative) si tous ses arcs sont positifs (négatifs). Cela laisse en évidence que parler de "positif" et "négatif" a des significations différentes selon le contex: digraphes signé ou digraphes étiquetés. Ainsi, nous allons voir dans cette thèse, les relations entre les feedback sets et la dynamique des réseaux Booléens à travers l'étude analytique de ces deux fondamentaux objets mathématiques: le digraphe (de connexion) signé et l'update digraphe.
- 30 March 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Problèmes type "Feedback Set" et comportement dynamique des réseaux de régulation
Dans la nature existent de nombreux exemples de systèmes dynamiques complexes: systèmes neuronaux, communautés, écosystèmes, réseaux de régulation génétiques, etc. Ces derniers, en particulier, sont de notre intérêt et sont souvent modélisés par des réseaux booléens. Un réseau booléenne peut être considérée comme un digraphe, où les sommets correspondent à des gènes ou de produits de gènes, tandis que les arcs indiquent les interactions entre eux. Une niveau d'expression des gènes est modélisé par des valeurs binaires, 0 ou 1, indiquant deux états de la transcription, soit activité, soit inactivité, respectivement, et ce niveau change dans le temps selon certains fonction locaux d'activation qui dépend des états d'un ensemble de nœuds (les gènes). L'effet conjoint des fonctions d'activation locale définit une fonction de transition globale: ainsi, le autre élément nécessaire dans la description du modèle est fonction de mise à jour, qui détermine quand chaque nœud doit être mis à jour, et donc, comme les fonctions local se combinent dans une fonction globale (en d'autres termes, il doit décrire les temps relative de les activités régulatoires). Comme un réseau booléen avec n sommets a 2 ^ n états globaux, à partir d'un état de départ, et dans un nombre fini de mises à jour, le réseau atteindra un fixe point ou un cycle limite, appelée attracteurs qui sont souvent associées à des phénotypes distincts (états-cellulaire) définis par les patrons d'activité des gènes. Un réseau de régulation Booléenne (REBN) est un réseau Booléen où chaque interaction entre les éléments de la réseau correspond soit à une interaction positif ou d'une interaction négative. Ainsi, le digraphe interaction associée à une REBN est un digraphe signé où un circuit est appelé positif (négatif) si le nombre de ses arcs négative est pair (impair). Dans ce contexte, il y a diverses études sur l'importance du les circuits positif et négatifs dans le comportement dynamique de différents systèmes en Biologie. En effet le point de départ de cette thèse est basée sur un résultat en disant que le nombre maximal de points fixes d'une REBN dépend d'un ensemble de cardinalité minimale qu'intersecte tous les cycles positifs (également dénommés positive feedback vertex set) du digraphe signé associé. D'autre part, un autre aspect important de circuits est leur rôle dans la robustesse des réseaux booléens par rapport différents types de mise à jour déterministe. Dans ce contexte, un élément clé mathématique est le update digraphe qui est un digraphe étiqueté associé à la réseau dont les étiquettes sur les arcs sont définies comme suit: un arc (u,v) est dit être positif si l'état de sommet u est mis à jour en même temps ou après que celle de v, et négative sinon. Ainsi, un cycle dans le digraphe étiqueté est dite positive (négative) si tous ses arcs sont positifs (négatifs). Cela laisse en évidence que parler de "positif" et "négatif" a des significations différentes selon le contex: digraphes signé ou digraphes étiquetés. Ainsi, nous allons voir dans cette thèse, les relations entre les feedback sets et la dynamique des réseaux Booléens à travers l'étude analytique de ces deux fondamentaux objets mathématiques: le digraphe (de connexion) signé et l'update digraphe.
- 11 February 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 113 (2) , 024118
Growth of clusters and scale-free distribution at the phase transition point of the two-dimensional Q2R-Potts model
In this article, we present a study of the macroscopic and microscopic dynamics of the two-dimensional cellular automaton Q2R-Potts, which is an extension of the Q2R model. This extension takes into account interactions between more than two states. Specifically, we simulated its dynamics for three states (q=3). We observed that the system undergoes a second-order phase transition starting from a critical energy value E_{c}/N, which is equivalent to the critical value of the Potts model. Motivated by the observation of microscopic dynamics, we provide an exact characterization and quantification of cluster formation through subgraph connections. This allowed us to determine the critical cluster size that occurs during the phase transition, the development of a scale-free distribution, and the domain of states that form a chessboardlike structure.
- 11 February 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 113 (2) , 024118
Growth of clusters and scale-free distribution at the phase transition point of the two-dimensional Q2R-Potts model
In this article, we present a study of the macroscopic and microscopic dynamics of the two-dimensional cellular automaton Q2R-Potts, which is an extension of the Q2R model. This extension takes into account interactions between more than two states. Specifically, we simulated its dynamics for three states (q=3). We observed that the system undergoes a second-order phase transition starting from a critical energy value E_{c}/N, which is equivalent to the critical value of the Potts model. Motivated by the observation of microscopic dynamics, we provide an exact characterization and quantification of cluster formation through subgraph connections. This allowed us to determine the critical cluster size that occurs during the phase transition, the development of a scale-free distribution, and the domain of states that form a chessboardlike structure.
- Open Access
- 12 December 2025
- Published by MDPI AG in International Journal of Molecular Sciences
- Vol. 26 (24) , 11976
Boolean Networks with Classic and New Updating Modes Applied to Genetic Regulation in Some Familial Diseases
Many familial diseases are caused by genetic accidents, which affect the genome and its epigenetic environment, summarized as an interaction network between genes. We wish to study the existence or absence of robustness for such genetic interaction networks centered on the gene SP1 and involved in three familial diseases: familial angioedema, osteogenesis imperfecta, and biliary atresia. The updating of gene states at the vertices of the interaction graph of the genetic network (1 if a gene is activated, 0 if it is inhibited) can be performed in multiple ways that have been well-studied over the last 20 years: parallel, block-parallel, sequential, block-sequential, random, etc. We add to these classic updating modes two new ones, the intricate and the state-dependent. We have studied the robustness of three particular interaction graphs related to the familial diseases chosen as examples. The comparison of the interaction graphs and dynamics of the chosen familial diseases of different etiology shows common points in their interaction graphs and similarities in their dynamics according to their expression clock.
- 12 December 2025
- Published by MDPI AG in International Journal of Molecular Sciences
- Vol. 26 (24) , 11976
Open AccessBoolean Networks with Classic and New Updating Modes Applied to Genetic Regulation in Some Familial Diseases
Many familial diseases are caused by genetic accidents, which affect the genome and its epigenetic environment, summarized as an interaction network between genes. We wish to study the existence or absence of robustness for such genetic interaction networks centered on the gene SP1 and involved in three familial diseases: familial angioedema, osteogenesis imperfecta, and biliary atresia. The updating of gene states at the vertices of the interaction graph of the genetic network (1 if a gene is activated, 0 if it is inhibited) can be performed in multiple ways that have been well-studied over the last 20 years: parallel, block-parallel, sequential, block-sequential, random, etc. We add to these classic updating modes two new ones, the intricate and the state-dependent. We have studied the robustness of three particular interaction graphs related to the familial diseases chosen as examples. The comparison of the interaction graphs and dynamics of the chosen familial diseases of different etiology shows common points in their interaction graphs and similarities in their dynamics according to their expression clock.
- Open Access
Boolean-network simplification and rule fitting to unravel chemotherapy resistance in non-small cell lung cancer
Boolean networks are powerful frameworks for capturing the logic of gene-regulatory circuits, yet their combinatorial explosion hampers exhaustive analyses. Here, we present a systematic reduction of a 31-node Boolean model that describes cisplatin- and pemetrexed-resistance in non-small-cell lung cancer to a compact 9-node core that exactly reproduces the original attractor landscape. The streamlined network shrinks the state space by four orders of magnitude, enabling rapid exploration of critical control points, rules fitting and candidate therapeutic targets. Extensive synchronous and asynchronous simulations confirm that the three clinically relevant steady states and their basins of attraction are conserved and reflect resistance frequencies close to those reported in clinical studies. The reduced model provides an accessible scaffold for future mechanistic and drug-discovery studies.
Open AccessBoolean-network simplification and rule fitting to unravel chemotherapy resistance in non-small cell lung cancer
Boolean networks are powerful frameworks for capturing the logic of gene-regulatory circuits, yet their combinatorial explosion hampers exhaustive analyses. Here, we present a systematic reduction of a 31-node Boolean model that describes cisplatin- and pemetrexed-resistance in non-small-cell lung cancer to a compact 9-node core that exactly reproduces the original attractor landscape. The streamlined network shrinks the state space by four orders of magnitude, enabling rapid exploration of critical control points, rules fitting and candidate therapeutic targets. Extensive synchronous and asynchronous simulations confirm that the three clinically relevant steady states and their basins of attraction are conserved and reflect resistance frequencies close to those reported in clinical studies. The reduced model provides an accessible scaffold for future mechanistic and drug-discovery studies.
- 26 September 2024
- Published by Elsevier in Computational Biology and Chemistry
- Vol. 113, 108225
Dynamical robustness of a Boolean model for the human gonadal sex determination
- 26 September 2024
- Published by Elsevier in Computational Biology and Chemistry
- Vol. 113, 108225
Dynamical robustness of a Boolean model for the human gonadal sex determination
- 20 April 2022
- Published by Springer Nature
- p. 203-217
Thermodynamics of Small Systems Through a Reversible and Conservative Discrete Automaton
- 20 April 2022
- Published by Springer Nature
- p. 203-217
Thermodynamics of Small Systems Through a Reversible and Conservative Discrete Automaton
- Open Access
- 11 March 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (6) , 600
Lac Operon Boolean Models: Dynamical Robustness and Alternative Improvements
In Veliz-Cuba and Stigler 2011, Boolean models were proposed for the lac operon in Escherichia coli capable of reproducing the operon being OFF, ON and bistable for three (low, medium and high) and two (low and high) parameters, representing the concentration ranges of lactose and glucose, respectively. Of these 6 possible combinations of parameters, 5 produce results that match with the biological experiments of Ozbudak et al., 2004. In the remaining one, the models predict the operon being OFF while biological experiments show a bistable behavior. In this paper, we first explore the robustness of two such models in the sense of how much its attractors change against any deterministic update schedule. We prove mathematically that, in cases where there is no bistability, all the dynamics in both models lack limit cycles while, when bistability appears, one model presents 30% of its dynamics with limit cycles while the other only 23%. Secondly, we propose two alternative improvements consisting of biologically supported modifications; one in which both models match with Ozbudak et al., 2004 in all 6 combinations of parameters and, the other one, where we increase the number of parameters to 9, matching in all these cases with the biological experiments of Ozbudak et al., 2004.
- 11 March 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (6) , 600
Open AccessLac Operon Boolean Models: Dynamical Robustness and Alternative Improvements
In Veliz-Cuba and Stigler 2011, Boolean models were proposed for the lac operon in Escherichia coli capable of reproducing the operon being OFF, ON and bistable for three (low, medium and high) and two (low and high) parameters, representing the concentration ranges of lactose and glucose, respectively. Of these 6 possible combinations of parameters, 5 produce results that match with the biological experiments of Ozbudak et al., 2004. In the remaining one, the models predict the operon being OFF while biological experiments show a bistable behavior. In this paper, we first explore the robustness of two such models in the sense of how much its attractors change against any deterministic update schedule. We prove mathematically that, in cases where there is no bistability, all the dynamics in both models lack limit cycles while, when bistability appears, one model presents 30% of its dynamics with limit cycles while the other only 23%. Secondly, we propose two alternative improvements consisting of biologically supported modifications; one in which both models match with Ozbudak et al., 2004 in all 6 combinations of parameters and, the other one, where we increase the number of parameters to 9, matching in all these cases with the biological experiments of Ozbudak et al., 2004.
- 1 October 2020
- Published by Elsevier in Information and Computation
- Vol. 274
Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations
- 1 October 2020
- Published by Elsevier in Information and Computation
- Vol. 274
Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations