Search arXiv⌕ Search

arXiv · math/0603302

Probabilistic Gene Regulatory Networks, isomorphisms of Markov Chains

Abstract

In this paper we study homomorphisms of Probabilistic Regulatory Gene Networks(PRN) introduced in arXiv:math.DS/0603289 v1 13 Mar 2006. The model PRN is a natural generalization of the Probabilistic Boolean Networks (PBN), introduced by I. Shmulevich, E. Dougherty, and W. Zhang in 2001, that has been using to describe genetic networks and has therapeutic applications. In this paper, our main objectives are to apply the concept of homomorphism and $ε$-homomorphism of probabilistic regulatory networks to the dynamic of the networks. The meaning of $ε$ is that these homomorphic networks have similar distributions and the distance between the distributions is upper bounded by $ε$. Additionally, we prove that the class of PRN together with the homomorphisms form a category with products and coproducts. Projections are special homomorphisms, and they always induce invariant subnetworks that contain all the cycles and steady states in the network. Here, it is proved that the $ε$-homomorphism for $0<ε<1$ produce simultaneous Markov Chains in both networks, that permit to introduce the concept of $ε$-isomorphism of Markov Chains, and similar networks.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Maria A. Avino-Diaz. 2006-03-13. Probabilistic Gene Regulatory Networks, isomorphisms of Markov Chains. https://arxiv.org/abs/math/0603302

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Classification of critically fixed anti-Thurston maps

We provide a complete combinatorial classification of critically fixed anti-Thurston maps, i.e., orientation-reversing branched covers of the 2-sphere that fix every critical point. The first step in the proof, and an interesting result in its own right, is a combinatorial classification of critically fixed anti-rational maps as "Schottky maps" associated with certain plane graphs. Both of these classification results heavily rely on an orientation-reversing version of Thurston's theory, including the canonical decomposition of anti-Thurston maps, which we develop in this paper. We use our combinatorial framework to answer special instances of the global curve attractor and twisting problems, and to resolve the Hurwitz existence problem in the setting of critically fixed anti-rational maps. Finally, we give some applications to the study of anti-rational maps with symmetries and to critically fixed anti-polynomials.

math.DS↗

Strong stable sets and asymptotic fineness

We investigate the strong stable sets of the geodesic flow on hyperbolic surfaces and their relation to the injectivity radius. We prove that the strong stable set of a vector does not coincide with its stable horocycle if and only if the injectivity radius along the associated geodesic ray is not bounded away from zero and the ray does not diverge through a cusp. In that case, the strong stable set is an uncountable union of stable horocycles. In previous works, we considered the particular cases where the ray meets arbitrarily short closed geodesics or closed horocycles. Here we complete the study by treating the third possible case, where the ray meets closed hypercycles of arbitrarily small length.

math.DS↗

Infinite unrestricted sumsets in subsets of abelian groups with large density

Let $(G,+)$ be a countable abelian group such that the subgroup $\{g+g\colon g\in G\}$ has finite index and the doubling map $g\mapsto g+g$ has finite kernel. We establish lower bounds on the upper density of a set $A\subset G$ with respect to an appropriate Følner sequence, so that $A$ contains a sumset of the form $\{t+b_1+b_2\colon b_1,b_2\in B\}$ or $\{b_1+b_2\colon b_1,b_2\in B\}$, for some infinite $B\subset G$ and some $t\in G$. Both assumptions on $G$ are necessary for our results to be true. We also characterize the Følner sequences for which this is possible. Finally, we show that our lower bounds are optimal in a strong sense.

math.DS↗