Cristobal Rojas
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
Cristobal Rojas has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Michael Yampolsky
University of Toronto
7 shared publications - Ilia Binder
University of Toronto, Canada
3 shared publications - Mathieu Hoyrup
Université de Lorraine, CNRS, Inria, LORIA
3 shared publications - Mathieu Sablik
Université Paul Sabatier, France
2 shared publications Michael Yampolsky
University of Toronto
2 shared publications- Adi Glücksam
Tel Aviv University
1 shared publication
Latest Publications
- Open Access
XBP1s as a Therapeutic Target to Preserve Retinal Function During Aging and Neurodegeneration
Loss of physiological complexity, characterized by reduced adaptive multiscale coordination among system components, is increasingly recognized as a hallmark of aging and neurodegenerative disease. The retina, a window into the brain, offers a unique, accessible platform to monitor neurodegenerative disorders such as Alzheimer’s disease (AD). Here, we investigate the therapeutic potential of the unfolded protein response transcription factor XBP1s in preserving retinal function during aging and AD-related pathology in murine models. Using micro-electroretinography with multielectrode arrays, we recorded retinal responses to chirp and white noise stimuli in four mouse models: wild-type (WT), XBP1s-overexpressing (Tg XBP1s ), AD model (5xFAD), and their crossbreed (Tg XBP1s /5xFAD) at approximately 3 and 7 months of age. We assessed retinal signals through entropy-based complexity measures and wavelet coherence between stimulus and response. While WT and 5xFAD mice exhibited age-related decline in retinal complexity, Tg XBP1s and Tg XBP1s /5xFAD mice maintained higher complexity levels and increased Wcoh in adulthood, indicating functional preservation. These results demonstrate that sus-tained XBP1s expression protects retinal electrophysiological integrity and highlight the retina’s value as a scalable, noninvasive biomarker platform to evaluate therapeutic efficacy targeting neurodegenerative mechanisms.
Open AccessXBP1s as a Therapeutic Target to Preserve Retinal Function During Aging and Neurodegeneration
Loss of physiological complexity, characterized by reduced adaptive multiscale coordination among system components, is increasingly recognized as a hallmark of aging and neurodegenerative disease. The retina, a window into the brain, offers a unique, accessible platform to monitor neurodegenerative disorders such as Alzheimer’s disease (AD). Here, we investigate the therapeutic potential of the unfolded protein response transcription factor XBP1s in preserving retinal function during aging and AD-related pathology in murine models. Using micro-electroretinography with multielectrode arrays, we recorded retinal responses to chirp and white noise stimuli in four mouse models: wild-type (WT), XBP1s-overexpressing (Tg XBP1s ), AD model (5xFAD), and their crossbreed (Tg XBP1s /5xFAD) at approximately 3 and 7 months of age. We assessed retinal signals through entropy-based complexity measures and wavelet coherence between stimulus and response. While WT and 5xFAD mice exhibited age-related decline in retinal complexity, Tg XBP1s and Tg XBP1s /5xFAD mice maintained higher complexity levels and increased Wcoh in adulthood, indicating functional preservation. These results demonstrate that sus-tained XBP1s expression protects retinal electrophysiological integrity and highlight the retina’s value as a scalable, noninvasive biomarker platform to evaluate therapeutic efficacy targeting neurodegenerative mechanisms.
- Open Access
- 10 March 2025
- Published by Cambridge University Press (CUP) in Ergodic Theory and Dynamical Systems
- Vol. 45 (8) , 2533-2560
On the algorithmic descriptive complexity of attractors in topological dynamics
We study the computational problem of rigorously describing the asymptotic behavior of topological dynamical systems up to a finite but arbitrarily small pre-specified error. More precisely, we consider the limit set of a typical orbit, both as a spatial object (attractor set) and as a statistical distribution (physical measure), and we prove upper bounds on the computational resources of computing descriptions of these objects with arbitrary accuracy. We also study how these bounds are affected by different dynamical constraints and provide several examples showing that our bounds are sharp in general. In particular, we exhibit a computable interval map having a unique transitive attractor with Cantor set structure supporting a unique physical measure such that both the attractor and the measure are non-computable.
- 10 March 2025
- Published by Cambridge University Press (CUP) in Ergodic Theory and Dynamical Systems
- Vol. 45 (8) , 2533-2560
Open AccessOn the algorithmic descriptive complexity of attractors in topological dynamics
We study the computational problem of rigorously describing the asymptotic behavior of topological dynamical systems up to a finite but arbitrarily small pre-specified error. More precisely, we consider the limit set of a typical orbit, both as a spatial object (attractor set) and as a statistical distribution (physical measure), and we prove upper bounds on the computational resources of computing descriptions of these objects with arbitrary accuracy. We also study how these bounds are affected by different dynamical constraints and provide several examples showing that our bounds are sharp in general. In particular, we exhibit a computable interval map having a unique transitive attractor with Cantor set structure supporting a unique physical measure such that both the attractor and the measure are non-computable.
- 11 October 2024
- Published by Cambridge University Press (CUP) in Ergodic Theory and Dynamical Systems
- p. 1-41
Effective dynamical systems beyond dimension zero and factors of SFTs
Using tools from computable analysis, we develop a notion of effectiveness for general dynamical systems as those group actions on arbitrary spaces that contain a computable representative in their topological conjugacy class. Most natural systems one can think of are effective in this sense, including some group rotations, affine actions on the torus and finitely presented algebraic actions. We show that for finitely generated and recursively presented groups, every effective dynamical system is the topological factor of a computable action on an effectively closed subset of the Cantor space. We then apply this result to extend the simulation results available in the literature beyond zero-dimensional spaces. In particular, we show that for a large class of groups, many of these natural actions are topological factors of subshifts of finite type.
- 11 October 2024
- Published by Cambridge University Press (CUP) in Ergodic Theory and Dynamical Systems
- p. 1-41
Effective dynamical systems beyond dimension zero and factors of SFTs
Using tools from computable analysis, we develop a notion of effectiveness for general dynamical systems as those group actions on arbitrary spaces that contain a computable representative in their topological conjugacy class. Most natural systems one can think of are effective in this sense, including some group rotations, affine actions on the torus and finitely presented algebraic actions. We show that for finitely generated and recursively presented groups, every effective dynamical system is the topological factor of a computable action on an effectively closed subset of the Cantor space. We then apply this result to extend the simulation results available in the literature beyond zero-dimensional spaces. In particular, we show that for a large class of groups, many of these natural actions are topological factors of subshifts of finite type.
- Open Access
- 28 September 2023
- Published by IOS Press
- p. 190-197
No Agreement Without Loss: Learning and Social Choice in Peer Review
In peer review systems, reviewers are often asked to evaluate various features of submissions, such as technical quality or novelty. A score is given to each of the predefined features and based on these the reviewer has to provide an overall quantitative recommendation. It may be assumed that each reviewer has her own mapping from the set of features to a recommendation, and that different reviewers have different mappings in mind. This introduces an element of arbitrariness known as commensuration bias. In this paper we discuss a framework, introduced by Noothigattu, Shah and Procaccia, and then applied by the organizers of the AAAI 2022 conference. Noothigattu, Shah and Procaccia proposed to aggregate reviewer’s mapping by minimizing certain loss functions, and studied axiomatic properties of this approach, in the sense of social choice theory. We challenge several of the results and assumptions used in their work and report a number of negative results. On the one hand, we study a trade-off between some of the axioms proposed and the ability of the method to properly capture agreements of the majority of reviewers. On the other hand, we show that dropping a certain unrealistic assumption has dramatic effects, including causing the method to be discontinuous.
- 28 September 2023
- Published by IOS Press
- p. 190-197
Open AccessNo Agreement Without Loss: Learning and Social Choice in Peer Review
In peer review systems, reviewers are often asked to evaluate various features of submissions, such as technical quality or novelty. A score is given to each of the predefined features and based on these the reviewer has to provide an overall quantitative recommendation. It may be assumed that each reviewer has her own mapping from the set of features to a recommendation, and that different reviewers have different mappings in mind. This introduces an element of arbitrariness known as commensuration bias. In this paper we discuss a framework, introduced by Noothigattu, Shah and Procaccia, and then applied by the organizers of the AAAI 2022 conference. Noothigattu, Shah and Procaccia proposed to aggregate reviewer’s mapping by minimizing certain loss functions, and studied axiomatic properties of this approach, in the sense of social choice theory. We challenge several of the results and assumptions used in their work and report a number of negative results. On the one hand, we study a trade-off between some of the axioms proposed and the ability of the method to properly capture agreements of the majority of reviewers. On the other hand, we show that dropping a certain unrealistic assumption has dramatic effects, including causing the method to be discontinuous.
- 9 July 2021
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 22 (3) , 1-25
Computability in Harmonic Analysis
- 9 July 2021
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 22 (3) , 1-25
Computability in Harmonic Analysis
- 5 June 2021
- Published by Springer Nature
- p. 143-172
Computable Geometric Complex Analysis and Complex Dynamics
- 5 June 2021
- Published by Springer Nature
- p. 143-172
Computable Geometric Complex Analysis and Complex Dynamics
- 1 February 2021
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 21 (1) , 59-69
Real Quadratic Julia Sets Can Have Arbitrarily High Complexity
- 1 February 2021
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 21 (1) , 59-69
Real Quadratic Julia Sets Can Have Arbitrarily High Complexity
- Open Access
- 22 June 2020
- Published by Association for Computing Machinery (ACM)
- Vol. 297, 1066-1072
How to lose at Monte Carlo: a simple dynamical system whose typical statistical behavior is non-computable
We consider the simplest non-linear discrete dynamical systems, given by the logistic maps f a (x)=ax(1−x) of the interval [0,1]. We show that there exist real parameters a∈ (0,4) for which almost every orbit of f a has the same statistical distribution in [0,1], but this limiting distribution is not Turing computable. In particular, the Monte Carlo method cannot be applied to study these dynamical systems.
- 22 June 2020
- Published by Association for Computing Machinery (ACM)
- Vol. 297, 1066-1072
Open AccessHow to lose at Monte Carlo: a simple dynamical system whose typical statistical behavior is non-computable
We consider the simplest non-linear discrete dynamical systems, given by the logistic maps f a (x)=ax(1−x) of the interval [0,1]. We show that there exist real parameters a∈ (0,4) for which almost every orbit of f a has the same statistical distribution in [0,1], but this limiting distribution is not Turing computable. In particular, the Monte Carlo method cannot be applied to study these dynamical systems.
- Open Access
Real quadratic Julia sets can have arbitrarily high complexity
We show that there exist real parameters $c$ for which the Julia set $J_c$ of the quadratic map $z^2+c$ has arbitrarily high computational complexity. More precisely, we show that for any given complexity threshold $T(n)$, there exist a real parameter $c$ such that the computational complexity of computing $J_c$ with $n$ bits of precision is higher than $T(n)$. This is the first known class of real parameters with a non poly-time computable Julia set.Open AccessReal quadratic Julia sets can have arbitrarily high complexity
We show that there exist real parameters $c$ for which the Julia set $J_c$ of the quadratic map $z^2+c$ has arbitrarily high computational complexity. More precisely, we show that for any given complexity threshold $T(n)$, there exist a real parameter $c$ such that the computational complexity of computing $J_c$ with $n$ bits of precision is higher than $T(n)$. This is the first known class of real parameters with a non poly-time computable Julia set. - Open Access
- 1 January 2020
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems
- Vol. 40 (7) , 4259-4286
Computability of topological entropy: From general systems to transformations on Cantor sets and the interval
The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological entropy for this kind of systems turned out to be algorithmic. Part of the great importance of these symbolic systems relies on the role they have played in understanding more general systems over non-symbolic spaces. The aim of this article is to investigate topological entropy from a computability point of view in this more general, not necessarily symbolic setting. In analogy to effective subshifts, we consider computable maps over effective compact sets in general metric spaces, and study the computability properties of their topological entropies. We show that even in this general setting, the entropy is always a $ \Sigma_2 $-computable number. We then study how various dynamical and analytical constrains affect this upper bound, and prove that it can be lowered in different ways depending on the constraint considered. In particular, we obtain that all $ \Sigma_2 $-computable numbers can already be realized within the class of surjective computable maps over $ \{0,1\}^{{\mathbb N}} $, but that this bound decreases to $ \Pi_{1} $(or upper)-computable numbers when restricted to expansive maps. On the other hand, if we change the geometry of the ambient space from the symbolic $ \{0,1\}^{{\mathbb N}} $ to the unit interval $ [0,1] $, then we find a quite different situation – we show that the possible entropies of computable systems over $ [0,1] $ are exactly the $ \Sigma_{1} $(or lower)-computable numbers and that this characterization switches down to precisely the computable numbers when we restrict the class of system to the quadratic family.- 1 January 2020
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems
- Vol. 40 (7) , 4259-4286
Open AccessComputability of topological entropy: From general systems to transformations on Cantor sets and the interval
The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological entropy for this kind of systems turned out to be algorithmic. Part of the great importance of these symbolic systems relies on the role they have played in understanding more general systems over non-symbolic spaces. The aim of this article is to investigate topological entropy from a computability point of view in this more general, not necessarily symbolic setting. In analogy to effective subshifts, we consider computable maps over effective compact sets in general metric spaces, and study the computability properties of their topological entropies. We show that even in this general setting, the entropy is always a $ \Sigma_2 $-computable number. We then study how various dynamical and analytical constrains affect this upper bound, and prove that it can be lowered in different ways depending on the constraint considered. In particular, we obtain that all $ \Sigma_2 $-computable numbers can already be realized within the class of surjective computable maps over $ \{0,1\}^{{\mathbb N}} $, but that this bound decreases to $ \Pi_{1} $(or upper)-computable numbers when restricted to expansive maps. On the other hand, if we change the geometry of the ambient space from the symbolic $ \{0,1\}^{{\mathbb N}} $ to the unit interval $ [0,1] $, then we find a quite different situation – we show that the possible entropies of computable systems over $ [0,1] $ are exactly the $ \Sigma_{1} $(or lower)-computable numbers and that this characterization switches down to precisely the computable numbers when we restrict the class of system to the quadratic family.