Prevalence of deficiency zero reaction networks in an Erdos-Renyi framework

Abstract

Reaction networks are commonly used within the mathematical biology and mathematical chemistry communities to model the dynamics of interacting species. These models differ from the typical graphs found in random graph theory since their vertices are constructed from elementary building blocks, i.e., the species. In this paper, we consider these networks in an Erd os-R\'enyi framework and, under suitable assumptions, derive a threshold function for the network to have a deficiency of zero, which is a property of great interest in the reaction network community. Specifically, if the number of species is denoted by n and if the edge probability is denote by pn, then we prove that the probability of a random binary network being deficiency zero converges to 1 if pnr(n) 0, as n ∞, and converges to 0 if pnr(n) ∞, as n ∞, where r(n)=1n3.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…