Mathematical Sciences

Permanent URI for this communityhttps://scholarworks.montana.edu/handle/1/48

Mathematical research at MSU is focused primarily on related topics in pure and applied mathematics. Research programs complement each other and are often applied to problems in science and engineering. Research in statistics encompasses a broad range of theoretical and applied topics. Because the statisticians are actively engaged in interdisciplinary work, much of the statistical research is directed toward practical problems. Mathematics education faculty are active in both qualitative and quantitative experimental research areas. These include teacher preparation, coaching and mentoring for in-service teachers, online learning and curriculum development.

Browse

Author: search.filters.author.Crawford-Kahrl, Peter

Search Results

Now showing 1 - 3 of 3
  • Thumbnail Image
    Item
    Joint realizability of monotone Boolean functions
    (Elsevier BV, 2022-06) Crawford-Kahrl, Peter; Cummins, Bree; Gedeon, Tomáš
    The study of monotone Boolean functions (MBFs) has a long history. We explore a connection between MBFs and ordinary differential equation (ODE) models of gene regulation, and, in particular, a problem of the realization of an MBF as a function describing the state transition graph of an ODE. We formulate a problem of joint realizability of finite collections of MBFs by establishing a connection between the parameterized dynamics of a class of ODEs and a collection of MBFs. We pose a question of what collections of MBFs can be realized by ODEs that belong to nested classes defined by increased algebraic complexity of their right-hand sides. As we progressively restrict the algebraic form of the ODE, we show by a combination of theory and explicit examples that the class of jointly realizable functions strictly decreases. Our results impact the study of regulatory network dynamics, as well as the classical area of MBFs. We conclude with a series of potential extensions and conjectures.
  • Thumbnail Image
    Item
    Genetic networks encode secrets of their past
    (Elsevier BV, 2022-03) Crawford-Kahrl, Peter; Nerem, Robert R.; Cummins, Bree; Gedeon, Tomas
    Research shows that gene duplication followed by either repurposing or removal of duplicated genes is an important contributor to evolution of gene and protein interaction networks. We aim to identify which characteristics of a network can arise through this process, and which must have been produced in a different way. To model the network evolution, we postulate vertex duplication and edge deletion as evolutionary operations on graphs. Using the novel concept of an ancestrally distinguished subgraph, we show how features of present-day networks require certain features of their ancestors. In particular, ancestrally distinguished subgraphs cannot be introduced by vertex duplication. Additionally, if vertex duplication and edge deletion are the only evolutionary mechanisms, then a graph’s ancestrally distinguished subgraphs must be contained in all of the graph’s ancestors. We analyze two experimentally derived genetic networks and show that our results accurately predict lack of large ancestrally distinguished subgraphs, despite this feature being statistically improbable in associated random networks. This observation is consistent with the hypothesis that these networks evolved primarily via vertex duplication. The tools we provide open the door for analyzing ancestral networks using current networks. Our results apply to edge-labeled (e.g. signed) graphs which are either undirected or directed.
  • Thumbnail Image
    Item
    Comparison of Combinatorial Signatures of Global Network Dynamics Generated by Two Classes of ODE Models
    (2019-04) Crawford-Kahrl, Peter; Cummins, Bree; Gedeon, Tomas
    Modeling the dynamics of biological networks introduces many challenges, among them the lack of first principle models, the size of the networks, and difficulties with parameterization. Discrete time Boolean networks and related continuous time switching systems provide a computationally accessible way to translate the structure of the network to predictions about the dynamics. Recent work has shown that the parameterized dynamics of switching systems can be captured by a combinatorial object, called a Dynamic Signatures Generated by Regulatory Networks (DSGRN) database, that consists of a parameter graph characterizing a finite parameter space decomposition, whose nodes are assigned a Morse graph that captures global dynamics for all corresponding parameters. We show that for a given network there is a way to associate the same type of object by considering a continuous time ODE system with a continuous right-hand side, which we call an L-system. The main goal of this paper is to compare the two DSGRN databases for the same network. Since the L-systems can be thought of as perturbations (not necessarily small) of the switching systems, our results address the correspondence between global parameterized dynamics of switching systems and their perturbations. We show that, at corresponding parameters, there is an order preserving map from the Morse graph of the switching system to that of the L-system that is surjective on the set of attractors and bijective on the set of fixed-point attractors. We provide important examples showing why this correspondence cannot be strengthened.
Copyright (c) 2002-2022, LYRASIS. All rights reserved.