Equivalence of Stock-Recruitment Functions and Parent-Progeny Relationships in Discrete-Time Multi-Stage Models
Ute Schaarschmidt, Anna S. J. Frank, Sam Subbey

TL;DR
This paper shows that traditional stock-recruitment models in fisheries management may be too simplistic and suggests using more detailed multi-stage models instead.
Contribution
The study identifies mathematical conditions under which stock-recruitment functions align with multi-stage population models.
Findings
Traditional stock-recruitment functions may not capture complex life-stage dynamics in fish populations.
Specific mathematical conditions allow equivalence between stock-recruitment functions and multi-stage models.
Multi-stage models could improve fisheries management by better representing population dynamics.
Abstract
Understanding the relationship between adult fish populations (the "stock") and the number of new fish entering the population (the "recruits") is essential for effective fisheries management. Traditionally, this relationship is represented by a stock-recruitment (SR) function, which is a simplified mathematical model that directly links stock size to recruitment. However, fish populations pass through several life stages, each stage influenced by unique population dynamic factors. Current SR functions often overlook these complexities, assuming that recruitment depends solely on the adult population size. In this study, we use a multi-stage, age-structured discrete-time population dynamic model that accounts for all life stages and the transitions between them. We demonstrate that, in general, a closed-form, univariate SR function may not accurately represent the recruitment process…
Genes, proteins, chemicals, diseases, species, mutations and cell lines named across the full text — each resolved to its canonical identifier and authoritative record.
Click any figure to enlarge with its caption.
Figure 1
Figure 2
Figure 3
Figure 4
Figure 5- —NTNU Norwegian University of Science and Technology (incl St. Olavs Hospital - Trondheim University Hospital)
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMarine and fisheries research · Fish Ecology and Management Studies · Marine Bivalve and Aquaculture Studies
Introduction
The life history of marine populations often comprises a series of distinct stages or stanzas (Paulik 1973), each characterized by a unique set of factors influencing survival (Nash 1998) (see Fig. 1).Fig. 1A schematic diagram of the life-history cycle of a fish with four stanzas. The principal developmental processes are indicated. Transitions from one age class to the next age class are represented by loops. In addition, the linkages between the adults and the early life-history stages through cannibalism are illustrated
These life stanzas encompass critical developmental phases such as eggs, larvae, juveniles, and adults. Principal developmental processes (e.g., spawning, hatching, metamorphosis, and maturation) cause transitions from one life stanza to the next (Paulik 1973).
Understanding this intricate dynamics of marine populations is fundamental for effective and sustainable fisheries management (to maintain healthy fish populations). Central to this understanding is the concept of stock recruitment (SR) and the SR function.
Fish stock recruitment refers to the relationship between the number of juvenile fish (recruits) that enter a population and the number of adult fish (the stock) that spawn to produce those recruits. It is a critical concept in fisheries biology and management because it helps (scientists and managers) understand and predict how changes in the number of adult fish (e.g., due to fishing or environmental factors) can affect the abundance of young fish that join the population. The stock recruitment relationship is often described by a function of one variable and defined in terms of numbers of individuals (Chambers and Trippel 1997). In fisheries science, the functions are usually unimodal and often assume that as the size of the parental population increases, the number of recruits also increases or remains constant (Beverton and Holt 1957) and may only decrease after reaching a unique maximum (Ricker 1954). These functions can capture certain patterns and can be useful simplifications. While neither adult population numbers nor recruitment can be measured directly in marine systems, collecting information on prerecruits is even more challenging. SR functions can be fitted to data for mature fish, thereby omitting any challenges related to collecting information on fecundity, egg survival, larvae survival, and juvenile survival from marine systems. This reliance on adult population numbers, not directly measured from the ecosystem, partly explains the popularity of traditional SR functions. However, issues have been raised, which revolve around both the fundamental existence and formulation of these functions (Subbey et al 2014).
The SR function is conventionally assumed to exist. However, several studies have illuminated nuances in recruitment patterns, some of which are inconsistent with conventional SR functions (reviewed by Haddon (2011) and Hilborn and Walters (1992, chapter 7)). For instance, empirical multi-modal patterns of recruitment have been reported in the literature (Hennemuth et al 1980), which may only be explained by multi-modal fish SR functions. Such functions may be derived by considering multiple life stages prior to recruitment (Brooks and Powers 2007; Paulik 1973), though this is a departure from current convention. On the other hand, multi-stage model simulations have revealed that the existence of a SR function may not be guaranteed under certain conditions. For instance, when parameters such as fecundity, reproductive rates, or predation rates vary with age, the traditional SR function may fail to emerge (Touzeau and Gouzé 1998). In contrast, in multi-stage models that account for recruitment as a function of an age-structured parental population, the resulting function becomes multivariate, diverging from the conventional SR function, which typically relies on a single variable (Schaarschmidt et al 2018). Thus, the quest of the paper is to determine necessary and sufficient conditions for existence of a (I) closed-form SR function, and (II) multivariate SR function in a multi-stage framework.
We do not aim to investigate whether a causal relationship exists between parent and progeny; rather, we assume that such a biological link is present. Our focus is to examine the conditions under which this parent-progeny relationship can be adequately represented by a traditional closed-form SR function, such as the Ricker model (Ricker 1954) or the Beverton-Holt model (Beverton and Holt 1957). We consider recruitment as a function of spawning stock biomass to be a simplified representation of the parent-progeny relationship compared to more complex stage- and age-structured population dynamics models.
In addressing the above issues, the paper uses theorems, which are summarized in a Ph.D thesis (Schaarschmidt 2018). This paper extends the work in Schaarschmidt (2018) by providing rigorous proofs and biological interpretations of the theorems. Furthermore, we discuss the choice of the mathematical model and interpretations of our results.
We will employ a systematic, modeling-driven approach to comprehend the parent-progeny relationship within multi-stage population dynamics. In contrast to studies that rely on inherently variable and uncertain data to investigate SR relationships (Myers and Barrowman 1996; Gilbert 1997), our methodology consistently provides a mathematical representation of the parent-progeny relationship.
Our approach involving research on multi-stage SR relationships is aligned with literature (Quinn and Deriso 1999; Schaarschmidt et al 2018; Touzeau and Gouzé 1998), but differ in the following way. In contrast to (Schaarschmidt et al 2018; Touzeau and Gouzé 1998), we consider all life history stages (eggs, larvae, juveniles and adults), rather than a broad classification of life stages into prerecruits and recruits. We consider a more comprehensive life cycle process than in Quinn and Deriso (1999).
The article is organized in the following way. Section 2 presents the modeling framework adopted in this manuscript. It states the necessary assumptions and the equations of the general discrete time multi-stage model that is used to simulate the entire life history cycle of fish populations. Section 3 focuses on the parent-progeny relationship and its mathematical simplification into the multivariate and closed-form SR functions, by proving necessary and sufficient conditions for their existence. We also provide mathematical proofs of these conditions. In the discussion, Section 4, we compare our findings to current literature and provide biological interpretations for the necessary and sufficient conditions.
Modeling framework
An adopted modeling framework must satisfy certain criteria, which include the ability to clearly delineate different life stages, e.g., in Fig. 1. This specificity enables a more accurate representation of the dynamics at, and between each stage. While it is possible to categorize the adult population by length (Callahan et al 2019) or size (weight) (Meng et al 2013), we align with previous research on multi-stage SR relationships (Schaarschmidt et al 2018; Touzeau and Gouzé 1998), and focus on an age-structured adult population model.
We now specify a multi-stage model to describe the life-history cycle illustrated in Fig. 1, which is subject to the following biological (B1–B2) assumptions and model-time characteristics (T1–T4): **B1:**Egg production varies with fecundity and the proportion of spawners.**B2:**Mortality rates of larvae and juveniles are functions of numbers of adults, larvae, and juveniles.
The assumption B1 follows a standard approach in fisheries (e.g. Hilborn and Walters 1992, chapter 3), while B2 reflects that survival may be affected by processes such as cannibalism, food availability, and competition (e.g. Hilborn and Walters 1992, chapter 7). **T1:**Discrete Time Transitions: We assume discrete transitions between life stanzas (see e.g., Fig. 1).**T2:**Unified Time Steps: We consider uniform time steps across all life stanzas.**T3:**Time Delay Constraint: Our approach incorporates a positive time delay, recognizing the delay between spawning and recruitment.**T4:**Transition Time: Spawning and transition to the juvenile stage are assumed to happen within one time step. If surviving, juveniles and adults age by one in every simulation time step. The assumptions T1, T2 and T3 are consistent with the fisheries literature (Quinn and Deriso 1999, chapter 5). Assumptions T1 and T2 also allow for direct comparison between model predictions and observed data, as empirical data on marine populations often come in discrete time intervals. Assumption T4 can be justified from the fisheries literature, with egg and larva stage duration of a few months, maturation after a few years, and life spans of several years (Petitgas et al 2013). Furthermore, faster evolution of prerecruits in comparison to adults is an assumption underlying other multi-stage models for SR (Schaarschmidt et al 2018; Touzeau and Gouzé 1998).
A general discrete time multi-stage model (DTMM)
Table 1. Nomenclature for the DTMM (adapted from Schaarschmidt (2018)).
Based on B1–B2 and T1–T4, we formally define an age-structured population dynamic model that describes births, survivals, and transitions from one stanza to the next. The considered stages are eggs (e), larvae (l), juveniles (j), and adults (a). We have age classes \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$0, \dots , m-1$$\end{document} representing juveniles and age classes \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$m, \dots , n$$\end{document} for adults. We use the symbols in brackets and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$0, \dots , n$$\end{document} as indices. An overview of the nomenclature for the model is given in Table 1.
Let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal {D}} \subset {\mathbb {R}}_{\ge 0}^{{n}+1}$$\end{document} , where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal {D}}$$\end{document} is non-empty. The general discrete time multi-stage model (DTMM) is defined by (1)–(7) with initial condition \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$({\textbf{J}}_0, {\textbf{N}}_0) \in {\mathcal {D}}$$\end{document} .
Most age and / or length structured marine populations have mature individuals distributed over several age and length groups (see e.g., Jokar et al (2021)). Hence, total egg production in (1) is defined as the sum of eggs produced over all age classes and depends on the adult population. The number of larvae presented in (2) is the number of eggs that survive in this time step.
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {E}_{t}&= \; \sum \limits _{k= {m}}^{{n}} f_k\;p_k\; N_{k,t-1} = \;e({\textbf{N}}_{t-1}) \end{aligned}$$\end{document} \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {L}_{t}&= \; {E}_{t} \; \cdot \; s_{e}({\textbf{N}}_{t-1}) \end{aligned}$$\end{document}The juveniles may exist in several age categories (see (3) and (4)) and Fig. 1. The initial juvenile population of age 0 transitions directly from the larvae stage, and its survival may depend on the number of larvae and the adult fish population. The older juvenile populations of age \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k=1,...,m-1$$\end{document} transition from the previous age group into the next, and their survival may be influenced by the number of juveniles within their own age group and the adult population. The rationale behind the survival rate is that (i) juveniles within each age group k compete for the same food resource and habitat (ii) the adult population could cannibalize on the lower developmental stanzas, i.e., eggs, larvae and juveniles.
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {J}_{0,t}&=\; {L}_{t} \; \cdot \; s_{l}(L_{t}, \; {\textbf{N}}_{t-1}) \end{aligned}$$\end{document} \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {J}_{k,t}&=\; {J}_{k-1,t-1} \; \cdot \; s_{k-1}(J_{k-1,t-1}, \; {\textbf{N}}_{t-1}), \;\;\;\;\;\;\;\;\; k=1, \dots , {m}-1 \end{aligned}$$\end{document}Maturation to the youngest age class of adults as described by (5) is either directly from the initial juvenile stage (if \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$m=0$$\end{document} ), or a juvenile group of age \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$m-1$$\end{document} (if \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$m\ge 1$$\end{document} ). As described by (6), the adults age linearly. The oldest age class of adults presented in (7) may consist of several age classes, i.e. individuals of any age \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ge n$$\end{document} .
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {N}_{{m},t}&=\; \left\{ \begin{array}{ll} {J}_{{m}-1,t-1} \; \cdot \; s_{{m}-1}(J_{{m}-1,t-1}, \; {\textbf{N}}_{t-1})\, , & \;\; {m} \ge 1, \\ {J}_{0,t} \, , & \;\; {m} = 0, \end{array} \right. \end{aligned}$$\end{document} \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} N_{k,t}&= \; s_{k-1} \; \cdot \; N_{k-1,{t-1}} , \;\;\;\;\;\;\;\;\; k={m}+1, \dots , {n}-1 \end{aligned}$$\end{document} \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} N_{{n},t}&=\; s_{{n}-1} \; \cdot \; N_{{n}-1,t-1} \; + \; s_{n}\; \cdot \; N_{{n},t-1} \end{aligned}$$\end{document}All adult age classes \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$m, \dots , n$$\end{document} can produce eggs unless fecundity \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$f_k$$\end{document} for an age class k is equal to 0 (see (1)).
The following conditions guarantee non-negative solutions of (1)–(7) with initial conditions \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$({\textbf{J}}_0, {\textbf{N}}_0) \in {\mathcal {D}} \subset {\mathbb {R}}_{\ge 0}^{{n}+1}$$\end{document} (since the product of two non-negative terms is non-negative).
Condition 1
For all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k=m, \dots , n$$\end{document} , let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$p_k \in (0,1)$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$f_k\ge 0$$\end{document} (as in Table 1).
Condition 2
For all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$i \in \{e,l,0, \dots , {n}-1\}$$\end{document} , let the codomains of functions \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$s_{i}$$\end{document} be subsets of (0, 1]. Let the codomain of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$s_n$$\end{document} be a subset of [0, 1].
Furthermore, we assume that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sum _{k={m}}^{{n}} f_kp_k > 0$$\end{document} and exclude the case that egg production is equal to zero for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{N}}_t \in {\mathbb {R}}_{\ge 0}^{{n-m}+1}$$\end{document} .
The SR relationship in multi-stage population dynamics
Given the general DTMM in (1)–(7), we focus in this section on the parent-progeny relationship, as well as mathematical formulations describing this relationship in form of SR functions.
Recruitment \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$R_t=N_{{m},t}$$\end{document} is defined as the number of individuals included in stage m at time \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t \in {\mathbb {N}}_0$$\end{document} , and represented in (5) in the general DTMM. Stock \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{t}$$\end{document} is defined as an aggregation of the counts of adults represented by a weighted sum (see (10)).
While the parent-progeny relationship is the general term that describes the relationship between an adult population and their offspring, the traditional SR functions have been defined to mathematically describe the parent-progeny relationship. Whether the existence of SR functions is mathematically valid in a multi-stage framework has not been proven and is the goal of this section.
To establish conditions leading to a closed-form SR function, we proceed in the following way: Step 1We use the DTMM (in (1)-(7)), representing the full life history cycle, to define the general parent-progeny relationship in Section 3.1.Step 2We then define and prove conditions under which the general parent progeny relationship can be simplified into a multi-variate SR function (not yet closed-form) (see Section 3.2).Step 3In Section 3.3, we identify further conditions that allow us to reduce the multi-variate SR function into a closed-from SR function.
In order to establish conditions for steps 2 and 3, we posit two hypotheses for the existence of SR functions, based on our general DTMM.
Hypothesis 1
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\exists \, \tau \in [1,m+1]$$\end{document} , \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\exists \, {\tilde{r}}$$\end{document} such that for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t \ge \tau$$\end{document} ,
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {\tilde{r}}: {\mathbb {R}}_{\ge 0}^{n-m+1} \rightarrow {\mathbb {R}}_{\ge 0} \text { s.t. } {N}_{{m},t} = \; {\tilde{r}}\left( {\textbf{N}}_{t-\tau }\right) . \end{aligned}$$\end{document}Hypothesis 2
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\exists \, \tau \in [1,m+1]$$\end{document} , \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\exists \, r$$\end{document} such that for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t \ge \tau$$\end{document} ,
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} r: \;&{\mathbb {R}}_{\ge 0} \rightarrow {\mathbb {R}}_{\ge 0} \;\;\; \text { s.t. } \;\;\, {N}_{{m},t} =\; r\left( S_{t-\tau }\right) \, , \end{aligned}$$\end{document}where
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} S_{t}&=\; b({\textbf{N}}_t)=\sum _{k={m}}^{{n}} w_k N_{k,t} \, , \text { with } w_k \ge 0 \, . \end{aligned}$$\end{document}The functions \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\tilde{r}}$$\end{document} and r are the multivariate SR, and SR functions, respectively.
Remark 1
Examples of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_t$$\end{document} are the total number of adults (with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$w_k=1$$\end{document} for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k={m}, \dots , {n}$$\end{document} ) and the spawning stock biomass (the total weight of fish matured enough to contribute to the reproduction process). In the latter case, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$w_k>0$$\end{document} is the average biomass of an individual in class k, respectively.
Remark 2
The requirement that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau \in [1,m+1]$$\end{document} stems from the observation that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$R_t=N_{m,t}$$\end{document} is in general a function of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{N}}_{t-m-1}, \dots , {\textbf{N}}_{t-1}$$\end{document} , as we will see in the following subsection.
If the SR function r exists, we may define function \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\tilde{r}} = r \circ b$$\end{document} , the composite function of r with the linear function \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$b: \; {\mathbb {R}}_{\ge 0} \rightarrow {\mathbb {R}}_{\ge 0}$$\end{document} defined by (10). Function \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\tilde{r}}$$\end{document} is a multivariate SR function. This allows the following remark.
Remark 3
Existence of a multivariate SR function is a necessary condition for the existence of a SR function.
General form of the parent-progeny relationship
The following lemma describes the underlying link between adults and recruitment given by the DTMM.
Lemma 1
Let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$E_t, L_t, {\textbf{J}}_t, {\textbf{N}}_t$$\end{document} for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t \ge 0$$\end{document} satisfy (1)–(7) with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$({\textbf{J}}_0, {\textbf{N}}_0) \in {\mathcal {D}}$$\end{document} . Then, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$R_t=N_{{m},t}$$\end{document} is given by (11) for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t \ge {m}+1$$\end{document} . Here, the probability \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$j_k$$\end{document} of survival of eggs to class \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k=0, \dots , {m}$$\end{document} is defined recursively by (12)–(13).
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned}&{N}_{{m},t}= \; e({\textbf{N}}_{t-{m}-1}) \; \cdot \; j_{{m}}({\textbf{N}}_{t-1}, \dots , {\textbf{N}}_{t-{m}-1}) \, \end{aligned}$$\end{document} \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned}&j_0( {\textbf{N}}_{t-1}) = \; s_{e}({\textbf{N}}_{t-1}) \; \cdot \; s_{l}\Big (e({\textbf{N}}_{t-1}) \cdot s_{e}({\textbf{N}}_{t-1}), \; {\textbf{N}}_{t-1}\Big ) \end{aligned}$$\end{document} \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned}&j_k( {\textbf{N}}_{t-1} , \dots , {\textbf{N}}_{t-k-1}) = \; j_{k-1}({\textbf{N}}_{t-2}, \dots , {\textbf{N}}_{t-k-1}) \nonumber \\ &\cdot \; s_{k-1} \Big (e({\textbf{N}}_{t-k-1}) \cdot j_{k-1}({\textbf{N}}_{t-2}, \dots , {\textbf{N}}_{t-k-1}),{\textbf{N}}_{t-1} \Big ), \; k = 1, \dots ,{m} \end{aligned}$$\end{document}Proof
By (1)–(2), we can substitute \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$e({\textbf{N}}_{t-1})\cdot s_e({\textbf{N}}_{t-1})$$\end{document} for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$L_t$$\end{document} into (3). We then find \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$J_{0,t}$$\end{document} as a function of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{N}}_{t-1}$$\end{document} given by (14). Using (12), we then substitute \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$j_0({\textbf{N}}_{t-1})$$\end{document} into (14) to find that (15) holds for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k=0$$\end{document} .
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {J}_{0,t}=&\; e({\textbf{N}}_{t-1}) \; \cdot \; s_{e}({\textbf{N}}_{t-1}) \; \cdot \; s_{l}\Big (e({\textbf{N}}_{t-1}) \cdot s_{e}({\textbf{N}}_{t-1}), \; {\textbf{N}}_{t-1}\Big )\end{aligned}$$\end{document} \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {J}_{k,t}=&\; e({\textbf{N}}_{t-k-1}) \; \cdot \; j_k({\textbf{N}}_{t-1}, \dots , {\textbf{N}}_{t-k-1}), \;\; k = 0, \dots ,{m}-1 \end{aligned}$$\end{document}We now assume (15) to be true for some integer \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k-1\in \{0,\dots , m-2\}$$\end{document} and find
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {J}_{k,t}=&\; {J}_{k-1,t-1} \; \cdot \; s_{k-1}(J_{k-1,t-1}, \; {\textbf{N}}_{t-1}) \;\;\; \text {(from~}(4)) \\ =&\; e({\textbf{N}}_{t-k-1}) \; \cdot \; j_{k-1}({\textbf{N}}_{t-2}, \dots , {\textbf{N}}_{t-k-1})\; \\&\cdot \; s_{k-1} \Big (e({\textbf{N}}_{t-k-1}) \cdot j_{k-1}({\textbf{N}}_{t-2}, \dots , {\textbf{N}}_{t-k-1}),{\textbf{N}}_{t-1} \Big ) \end{aligned}$$\end{document}and thus, by definition (13), we see that (15) also holds for k. By mathematical induction, (15) is true for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k=0, \dots , m-1$$\end{document} .
Similarly to one induction step, we use (5), (13) and (15) with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k=m-1$$\end{document} to find \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N_{{m},t}$$\end{document} as given by (11). \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\square$$\end{document}
We observe that the DTMM describes recruitment \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$R_t=N_{m,t}$$\end{document} through (11) as a function of the vectors \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{N}}_{t-m-1}, \dots , {\textbf{N}}_{t-1}$$\end{document} of numbers of adults at times \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t-m-1, \dots , m-1$$\end{document} . The general parent-progeny relationship involves a series of past states of the adult population at several time steps (from \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t-m-1$$\end{document} to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t-1$$\end{document} ).
The general form of the parent-progeny relationship admitted by the DTMM is illustrated in Fig. 2. Egg production and the number of larvae and juveniles of age 0 in time step \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t-{m}$$\end{document} are functions of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{N}}_{t-m-1}$$\end{document} . Numbers of juveniles of ages \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k\ge 1$$\end{document} are given by functions of the numbers of juveniles in the previous year and age class and the numbers of adults in the previous time step. We obtain recruitment \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N_{{m},t}$$\end{document} at time t from the variables \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{N}}_{t-{m}-1}$$\end{document} , ... , \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{N}}_{t-1}$$\end{document} . In general, one needs to track the life cycle from the time of spawning to the time of recruitment and use information about each year’s adult population to obtain the SR relationship given by the DTMM.Fig. 2. The general parent-progeny relationship for the DTMM. The evolution of individuals spawned at time \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t-{m}$$\end{document} to recruitment at time t is given by (1)–(5). Links between stages are represented by arrows. As an example, an arrow from \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N_{t-m-1}$$\end{document} to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$E_{t-m}$$\end{document} represents the assumption that egg production at time step \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t-{m}$$\end{document} is given by function e of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{N}}_{t-m-1}$$\end{document} (From Schaarschmidt (2018))
Using the recursive definition for the probability of survival of eggs to recruitment, we may redefine the multi-stage model in terms of fewer variables.
Corollary 1
Let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$E_t, L_t, {\textbf{J}}_t, {\textbf{N}}_t$$\end{document} for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t \ge 0$$\end{document} be a solution of a DTMM. Then, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{N}}_t$$\end{document} with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t \ge 0$$\end{document} is a solution of a dynamical system given by (11)–(13) and (6)–(7) with initial condition \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{N}}_{u} \in \tilde{{\mathcal {D}}}_u \subset {\mathbb {R}}_{\ge 0}^{n-m+1}$$\end{document} , for suitable \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tilde{{\mathcal {D}}}_u$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$u=0, \dots , {m}$$\end{document} .
The alternative formulation of the DTMM in Corollary 1 involves only one stage (adults), but the difference equation is of order m. We use Corollary 1 to prove the following result.
Lemma 2
Let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$E_t, L_t, {\textbf{J}}_t, {\textbf{N}}_t$$\end{document} for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t \ge 0$$\end{document} be a solution of a DTMM and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{N}}_t = {\textbf{N}}$$\end{document} for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t \in [0, {m}+1]$$\end{document} . Then, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{N}}_t ={\textbf{N}}$$\end{document} for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t \ge 0$$\end{document} .
Proof
From (11) and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{N}}_t = {\textbf{N}}$$\end{document} for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t =0, \dots ,{m}+1$$\end{document} , it follows that
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} N_{{m},{m}+2}\;=\; e({\textbf{N}}_{1}) \; \cdot \; j_{{m}}({\textbf{N}}_{m+1}, \dots , {\textbf{N}}_{1}) \; = \; e({\textbf{N}}_{0}) \; \cdot \; j_{{m}}({\textbf{N}}_{m}, \dots , {\textbf{N}}_{0}) \; = \; N_{{m},{m}+1}. \end{aligned}$$\end{document}With (6)–(7) and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{N}}_{{m}+1}={\textbf{N}}_{{m}}$$\end{document} , we obtain \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N_{k,{m}+2}=N_{k,{m}+1}$$\end{document} , for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k={m}+1, \dots , n$$\end{document} . Overall, we found that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{N}}_t = {\textbf{N}}$$\end{document} for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t =0, \dots ,{m}+1$$\end{document} implies \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{N}}_t = {\textbf{N}}$$\end{document} for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t =0, \dots ,{m}+2$$\end{document} . Similarly, we observe that if \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{N}}_t = {\textbf{N}}$$\end{document} for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t =0, \dots ,{k}+1$$\end{document} for some \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k \ge m$$\end{document} , then \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{N}}_t = {\textbf{N}}$$\end{document} for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t =0, \dots ,{k}+2$$\end{document} . By induction, we find \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{N}}_t = {\textbf{N}}$$\end{document} for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t \ge 0$$\end{document} . \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\square$$\end{document}
In other words, having a constant adult population for a duration that corresponds to the delay between spawning and recruitment implies the population to be constant for all future times.
Existence of a multivariate SR function
In this subsection, we investigate, whether the multi-stage model always admits a multi-variate SR function, and state sufficient conditions for the existence of the multi-variate function.
Theorem 1
There exist DTMMs without multivariate SR function (as defined in Hypothesis 1).
The proof is by construction, using the following example of a DTMM.
Example 1
We consider a dynamical system of form (1)–(7) under assumptions (16)–(19). Let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal {D}}$$\end{document} be a cuboid with positive volume, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${m}=1$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${n}=2$$\end{document} . Assumptions (16)–(19) are in accordance with conditions 1–2 which we impose on the DTMM in Sect. 2. The dynamical system is an example of a DTMM.
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {E}_{t}&= \; N_{1,t-1}+N_{2,t-1}\end{aligned}$$\end{document} \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} s_{e}({\textbf{N}}_{t-1})&=\; s_{l}(L_{t},{\textbf{N}}_{t-1})=s \in (0,1)\end{aligned}$$\end{document} \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} s_{0}(J_{k,t-1}, \; {\textbf{N}}_{t-1})&=\; e ^{-2N_{1,t-1}}\end{aligned}$$\end{document} \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} s_1&= 0.2 \; \text { and } s_2 = 0 \end{aligned}$$\end{document}Substituting assumptions (16)–(19) into the DTMM, the dynamics for juveniles and adults are given by (20)–(22) with (21) for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$R_t=N_{1,t}$$\end{document} .
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} J_{0,t}&= \; (N_{1,t-1}+N_{2,t-1}) s^2 \end{aligned}$$\end{document} \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} N_{1,t}&=\; J_{0,t-1} e ^{-2N_{1,t-1}} \end{aligned}$$\end{document} \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} N_{2,t}&=\; 0.2 N_{1,t-1} \end{aligned}$$\end{document}Proof of Theorem 1
Our goal is to show that there exist solutions to the dynamical system that are such that a multivariate SR function cannot exist for any \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau \in [1,m+1]=[1,2]$$\end{document} .
Let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$({\textbf{J}}^1_0, {\textbf{N}}^1_0)$$\end{document} , \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$({\textbf{J}}^2_0, {\textbf{N}}^2_0) \in {\mathcal {D}}$$\end{document} such that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{N}}_0^1 = {\textbf{N}}_0^2$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$J_{0,0}^1 \ne J_{0,0}^2$$\end{document} . These vectors exist in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal {D}}$$\end{document} since the cuboid is assumed to have positive volume. Denote by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$({\textbf{J}}^1_t, {\textbf{N}}^1_t)$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$({\textbf{J}}^2_t, {\textbf{N}}^2_t)$$\end{document} the solutions to (20)–(22) with initial condition \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$({\textbf{J}}^1_0, {\textbf{N}}^1_0)$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$({\textbf{J}}^2_0, {\textbf{N}}^2_0)$$\end{document} , respectively.
**The case ** \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varvec{\tau = 1}$$\end{document} . For this case, we let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t=1$$\end{document} and consider recruitment \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N_{1,1}$$\end{document} as given by (21). With the assumptions \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N_{1,0}^1= N_{1,0}^2$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$J_{0,0}^1 \ne J_{0,0}^2$$\end{document} about the initial conditions, we see that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N_{1,1}^1 \ne N_{1,1}^2$$\end{document} . As \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{N}}_0^1 = {\textbf{N}}_0^2$$\end{document} but \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N_{1,1}^1 \ne N_{1,1}^2$$\end{document} , a multivariate SR function \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\tilde{r}}: {\mathbb {R}}_{\ge 0}^{n-m+1} \rightarrow {\mathbb {R}}_{\ge 0}$$\end{document} s.t. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${N}_{1,t} ={\tilde{r}}\left( {\textbf{N}}_{t-1}\right)$$\end{document} for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t \ge 1$$\end{document} cannot exist.
**The case ** \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varvec{\tau = 2}$$\end{document} . Now, let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t=2$$\end{document} . We substitute \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$J_{0,0}$$\end{document} as defined by (20) into (21) for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N_{1,t}$$\end{document} and obtain (23) for recruitment at time \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t=2$$\end{document} . Since \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{N}}_0^1 = {\textbf{N}}_0^2$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N_{1,1}^1 \ne N_{1,1}^2$$\end{document} , we observe that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N_{1,2}^1 \ne N_{1,2}^2$$\end{document} . Thus, a function \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\tilde{r}}: {\mathbb {R}}_{\ge 0}^{n-m+1} \rightarrow {\mathbb {R}}_{\ge 0}$$\end{document} s.t. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${N}_{1,t} ={\tilde{r}}\left( {\textbf{N}}_{t-2}\right)$$\end{document} for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t \ge 2$$\end{document} cannot exist.
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} N_{1,2} \; = \; (N_{1,0}+N_{2,0}) s^2 e ^{-2N_{1,1}} \end{aligned}$$\end{document}Summarizing, we have now shown that for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau = 1$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau = 2$$\end{document} , the DTMM (20)–(22) has solutions, for which there cannot exist any function \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\tilde{r}}: {\mathbb {R}}_{\ge 0}^n \rightarrow {\mathbb {R}}_{\ge 0}$$\end{document} s.t. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${N}_{1,t} ={\tilde{r}}\left( {\textbf{N}}_{t-\tau }\right)$$\end{document} for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t \ge \tau$$\end{document} . Hypothesis 1 does not hold for Example 1.
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\square$$\end{document}
In the following, we consider a set of properties of Example 1. We consider them as logical statements and use terminology described e.g. in Rosen (2012).
Propositions
Define the following set of propositions, which are said to be true if they are true for all solutions \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$E_t, L_t, {\textbf{J}}_t, {\textbf{N}}_t$$\end{document} , \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t \ge 0$$\end{document} of a DTMM.
- \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{N}}_{t}= {\textbf{N}}_0$$\end{document} for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t \in [0,{m}+1]$$\end{document} ,
- \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$s_{k}(J_{k,t}, \; {\textbf{N}}_t) = s_{k}(J_{k,t})$$\end{document} for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k=0, \dots {m}-1$$\end{document} and for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t \ge 0$$\end{document} ,
- \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${m}=0$$\end{document} , i.e. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N_{{m},t}=J_{0,t}$$\end{document} is given by (3). A biological interpretation of (C3) is that there is only one cohort of juveniles. Then, recruitment of fish spawned at time t occurs at time \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t+1$$\end{document} .
Remark 4
For Example 1, the logical solution of ((C1) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\vee$$\end{document} (C2) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\vee$$\end{document} (C3)) is false.
Proof
The verification that (C1) evaluates as false follows directly from the proof of Theorem 1. Since there exists \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\tilde{t}} \ge 0$$\end{document} such that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N_{1,{\tilde{t}}} \ne N_{1,{\tilde{t}}+1}$$\end{document} and (18) holds, (C2) cannot be true. The negation of (C3) holds by definition of the dynamical system. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\square$$\end{document}
In other words, the multi-stage model from Example 1 without multivariate SR function has none of the properties (C1), (C2) or (C3).
Sufficient conditions for the existence of a multivariate SR function
Theorem 2
For all DTMMs, each of the conditions (C1), (C2) and (C3) is individually sufficient for the existence of a multivariate SR function (Hypothesis 1). Function \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\tilde{r}}$$\end{document} is given by (24) and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau ={m}+1$$\end{document} .
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {N}_{{m},t} =&\; e({\textbf{N}}_{t-{m}-1}) \; \cdot \; j_{{m}}({\textbf{N}}_{t-{m}-1})\, , \; \text {for all } t \ge m+1\, . \end{aligned}$$\end{document}For the proof, we use Lemma 1 and (11)–(13) given therein. For the convenience of the reader, the equations are re-stated here,
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned}&{N}_{{m},t}= \; e({\textbf{N}}_{t-{m}-1}) \; \cdot \; j_{{m}}({\textbf{N}}_{t-1}, \dots , {\textbf{N}}_{t-{m}-1}) \, \end{aligned}$$\end{document} \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned}&j_0( {\textbf{N}}_{t-1}) = \; s_{e}({\textbf{N}}_{t-1}) \; \cdot \; s_{l}\Big (e({\textbf{N}}_{t-1}) \cdot s_{e}({\textbf{N}}_{t-1}), \; {\textbf{N}}_{t-1}\Big ) \end{aligned}$$\end{document} \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned}j_k(& {\textbf{N}}_{t-1} , \dots , {\textbf{N}}_{t-k-1}) = \; j_{k-1}({\textbf{N}}_{t-2}, \dots , {\textbf{N}}_{t-k-1}) \\ \cdot & \; s_{k-1} \Big (e({\textbf{N}}_{t-k-1}) \cdot j_{k-1}({\textbf{N}}_{t-2}, \dots , {\textbf{N}}_{t-k-1}),{\textbf{N}}_{t-1} \Big ), \; k = 1, \dots ,{m} \end{aligned}$$\end{document}Proof
Assume that (C1) holds. With Lemma 2, we obtain that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{N}}_t={\textbf{N}}$$\end{document} for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t \ge 0$$\end{document} . By (11) for recruitment in Lemma 1, we can conclude that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N_{{m},t}$$\end{document} is given by (24), for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t \ge {m}+1$$\end{document} .
Using the recursive definition (12)-(13) for probability \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$j_k({\textbf{N}}_t)$$\end{document} , we observe that (C2) implies that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$j_k$$\end{document} is given by (25) for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k=1, \dots ,{m}$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t \ge k+1$$\end{document} . In this case and due to (11), we obtain (24), for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t \ge {m}+1$$\end{document} .
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} j_k({\textbf{N}}_{t-k-1}) = \; j_{k-1}({\textbf{N}}_{t-k-1}) \; \cdot \; s_{k-1} \Big (e({\textbf{N}}_{t-k-1}) \cdot j_{k-1}( {\textbf{N}}_{t-k-1})\Big ) \end{aligned}$$\end{document}Proposition (C3) and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$m=0$$\end{document} implies the existence of a multivariate SR function of form (24) for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t \ge {m}+1$$\end{document} by (11). \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\square$$\end{document}
The simplification of the general parent-progeny relationship from Fig. 2 into a multi-variate SR function is illustrated in Fig. 3. The biological interpretation of Theorem 2 is that we can be sure to have a multi-variate SR function, if either
- the system is at a stable fixed point,
- survival rates of juveniles are constant with respect to the numbers of adults, or
- there is no more than one time step delay between spawning and recruitment. Fig. 3. The multi-variate SR function for the DTMM. Here, the evolution of individuals spawned at time \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t-{m}$$\end{document} to recruitment at time t is given by equations (1)–(5) under condition (C2) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\vee$$\end{document} (C3). The resulting parent-progeny relationship is a multi-variate SR function (as recruitment is a function of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{N}}_{t-m-1}$$\end{document} ). The gray color of some nodes represents the fact that under (C3), i.e., \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$m=0$$\end{document} , the nodes \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$J_{1,t-m+1}$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$J_{m-1,t-1}$$\end{document} are not included in the graph (adapted from Schaarschmidt (2018))
Existence of a SR function
We now state sufficient conditions for a multi-variate SR function to have the characteristic form of a SR function and investigate what happens, if any of the conditions are violated.
For the DTMM, we define the following propositions. Here, we use linear function \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$b: \; {\mathbb {R}}^{n-m+1}_{\ge 0} \rightarrow {\mathbb {R}}_{\ge 0}$$\end{document} defined by (10).
- \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\exists$$\end{document} \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\tilde{e}}: {\mathbb {R}}_{\ge 0} \rightarrow {\mathbb {R}}_{\ge 0}$$\end{document} s.t. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$e({\textbf{x}})={\tilde{e}}(b({\textbf{x}}))$$\end{document} , for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{x}} \in {\mathbb {R}}_{\ge 0}^{n-m+1}$$\end{document} . A biological interpretation of (C4)(a) is that egg production can be adequately represented by a function of the weighted sum \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_t$$\end{document} of numbers of adults.
- \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\exists$$\end{document} \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\tilde{s}}_e: {\mathbb {R}}_{\ge 0} \rightarrow (0,1]$$\end{document} s.t. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$s_e({\textbf{x}})={\tilde{s}}_e(b({\textbf{x}}))$$\end{document} , for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{x}} \in {\mathbb {R}}_{\ge 0}^{n-m+1}$$\end{document} . In other words, survival of eggs can be described by a function of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_t$$\end{document} .
- \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\exists$$\end{document} \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\tilde{s}}_l: {\mathbb {R}}_{\ge 0}^2 \rightarrow (0,1]$$\end{document} s.t. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$s_l(y,{\textbf{x}})={\tilde{s}}_l(y,b({\textbf{x}}))$$\end{document} for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{x}} \in {\mathbb {R}}_{\ge 0}^{n-m+1}$$\end{document} , \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$y \in {\mathbb {R}}_{\ge 0}$$\end{document} .
This translates to mean that survival of larvae can be represented by a function of the stock \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_t$$\end{document} .The codomains of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\tilde{s}}_e$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\tilde{s}}_l$$\end{document} are chosen in line with assumption 2 on the DTMM.
Remark 5
Let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$E_t, L_t, {\textbf{J}}_t, {\textbf{N}}_t$$\end{document} , \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t \ge 0$$\end{document} , be a solution of a DTMM and assume that (C1) is true. From Lemma 2, we know that (C1) implies \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {{N}}_{t}={\textbf{N}}_{0}$$\end{document} for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t \ge 0$$\end{document} . Thus, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${N}_{m,t}={N}_{m,0}$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_t=S_0$$\end{document} for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t \ge 0$$\end{document} and it is possible to construct a SR function \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$r: \; {\mathbb {R}}_{\ge 0} \rightarrow {\mathbb {R}}_{\ge 0}$$\end{document} such that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${N}_{{m},t} =\; r\left( S_{t-{(m+1)}}\right)$$\end{document} for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t \ge m+1$$\end{document} , i.e., Hypothesis 2 is true.
Theorem 3
Consider a DTMM, for which the logic solution of (C3) is true. Then, violation of exactly one of the logical statements (C4)(a)–(c) implies that no SR function exists.
Proof
Consider a DTMM such that (C4)(b) and (C4)(c) hold and (C4)(a) is violated. Assume \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$m=0$$\end{document} , i.e. a multivariate SR function exists. From the proof to Lemma 1, we know that recruitment \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N_{{m},t}$$\end{document} is given by (14), for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t \ge 1$$\end{document} . With (C4)(b) and (C4)(c), assuming the existence of a SR function would imply (26)–(27) for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t \ge 1$$\end{document} . This would be a contraction to (C4)(a) being false. Thus, this DTMM cannot have any SR function.
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {N}_{0,t} =&\; e({\textbf{N}}_{t-1}) \; \cdot \; {\tilde{s}}_{e}(b({\textbf{N}}_{t-1})) \; \cdot \; {\tilde{s}}_{l}(b({\textbf{N}}_{t-1}))= \;r(b({\textbf{N}}_{t-1})) \end{aligned}$$\end{document} \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} e({\textbf{N}}_{t}) =&\; \left\{ \begin{array}{ll} {\tilde{s}}_{e}(b({\textbf{N}}_{t})) \; \cdot \; {\tilde{s}}_{l}\left( b({\textbf{N}}_{t})\right) \;/ \; r(b({\textbf{N}}_{t})), & \; r(b({\textbf{N}}_{t})) >0 \\ 0 , & \text { else } \end{array} \right. \end{aligned}$$\end{document}Similarly, we can define DTMMs, for which either (C4)(b) or (C4)(c) is violated, but (C4)(a) holds and there exists no SR function. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\square$$\end{document}
We have now proved that a multi-variate SR function is not required to have the characteristic form of a SR function unless we impose structural conditions on the functions representing egg production and survival rates of eggs and larvae. However, we will now see that the combination of these three conditions ensures the existence of a SR function.
Sufficient conditions for the existence of a SR function
Theorem 4
For all DTMMs, the logic solution of ((C4) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\wedge$$\end{document} ((C2) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\vee$$\end{document} (C3))) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\vee$$\end{document} (C1) is sufficient for the existence of a SR function r given by (28) with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau = {m}+1$$\end{document} . Here, we use \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\tilde{j}}_k:{\mathbb {R}}_{\ge 0} \rightarrow {\mathbb {R}}_{\ge 0}$$\end{document} s.t. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${j}_k = {\tilde{j}}_k \circ b$$\end{document} for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k=0, \dots , m$$\end{document} .
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {N}_{{m},t}&= \; r(S_{t-m-1}) = \; {\tilde{e}}(b({\textbf{N}}_{t-{m}-1})) \; \cdot \; {\tilde{j}}_{{m}}(b({\textbf{N}}_{t-k-1})) \; \text { for all } t \ge m+1 \, . \end{aligned}$$\end{document}Proof
Let (C4) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\wedge$$\end{document} ((C2) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\vee$$\end{document} (C3)) be true and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$E_t, L_t, {\textbf{J}}_t, {\textbf{N}}_t$$\end{document} , \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t \ge 0$$\end{document} , a solution of a DTMM. Then, by Theorem 2 and Lemma 1, we know that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N_{m,t}$$\end{document} is given by (12) and (24)–(25), for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t \ge m + 1$$\end{document} .
Due to (C4), we get (29) and may represent probability \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$j_0$$\end{document} as a function of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{t-m-1}=b({\textbf{N}}_{t-m-1})$$\end{document} . Using (C4), we recursively find that (30) holds for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k=1, \dots , {m}$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf{x}} \in {\mathbb {R}}^{{n}-{m}+1}$$\end{document} . From Theorem 2, we see that the SR function is in this case defined by (28).
\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} j_0&({\textbf{x}}) = \; {\tilde{s}}_{e}(b({\textbf{x}})) \; \cdot \; {\tilde{s}}_{l}(b({\textbf{x}})) = \; {\tilde{j}}_0(b({\textbf{x}})) \end{aligned}$$\end{document} \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} j_k&( {\textbf{x}}) =\; {\tilde{j}}_{k-1}(b({\textbf{x}})) \; \cdot \; s_{k-1} \Big ({\tilde{e}}(b({\textbf{x}})) \cdot {\tilde{j}}_{k-1}(b({\textbf{x}}))\Big ) =\; {\tilde{j}}_k( b({\textbf{x}})) \end{aligned}$$\end{document}The existence of a SR function, if (C1) evaluates as true, follows directly from Remark 5. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\square$$\end{document}
The simplification of the general parent-progeny relationship for the DTMM into a closed-form SR function is illustrated in Fig. 4.Fig. 4. The closed-form SR function for the DTMM. The evolution of individuals spawned at time \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t-{m}$$\end{document} to recruitment at time t given is by equations (1)–(5) assuming (C4) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\wedge$$\end{document} ((C2) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\vee$$\end{document} (C3)) to be true. The resulting parent-progeny relationship is a closed-form SR function (since \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N_{m,t}$$\end{document} is a function of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S_{t-m-1}$$\end{document} ). The gray color of some nodes represents the fact that under (C3), i.e., \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$m=0$$\end{document} , the nodes \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$J_{1,t-m+1}$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$J_{m-1,t-1}$$\end{document} vanish (adapted from Schaarschmidt (2018))
Discussion
Age- and stage-structure of fish populations may vary with time. Hence, there is a need to consider all stanzas in the life history to realistically define the transition from spawning to recruitment. Consistent with this consideration, we have presented a DTMM describing a generic life cycle of fish with four stages and several age classes. Based on this model, we have demonstrated two important principles concerning a functional presentation of the parent-progeny relationship for fish. Firstly, we have proven that in general, both the multi-variate and closed-form SR functions are limiting, because they do not track the age- and stage-structure from spawning to recruitment. Secondly, we defined necessary and sufficient conditions for the existence of a closed-form SR function. In other words, we outlined assumptions that enable the biological processes driving recruitment to be represented through a SR function, i.e., a mathematical function involving one or more variables.
The closest modeling approach to that presented in this paper is by Touzeau and Gouzé (1998) and Schaarschmidt et al (2018). Our work presents an extension of these previous approaches in considering all life history stages, instead of a broad classification of the population into prerecruits (eggs, larvae, and juveniles) and adults. We have represented both the fast processes (spawning, egg and larval survival) and the slower processes (ageing of juveniles) which occur prior to recruitment.
Assuming that conditions (C2) and (C4) are true, the existence of a SR function is guaranteed by Theorem 4. These two conditions are implied when one assumes that (i) the number of individuals in the first life stage is a function of S, and (ii) the number of individuals in all subsequent stages is a function of the number of individuals in the previous stage. The approach by Paulik (1973) and Brooks and Powers (2007) in investigating the functional forms of parent-progeny relationships admitted by multi-stage models, was underpinned by these assumptions. It is known that cannibalism can be a limiting factor for survival (Bogstad et al 2016). Inclusion of cannibalism and age-structure in our model, extends the approaches by Paulik (1973) and Brooks and Powers (2007).
We found the existence of a multi-variate SR function to be premised on either the population being at a stable fixed point, recruitment being defined as the transition rate to age class 0, or mortality of juveniles being constant with respect to the number of adults. These conditions are considered sufficient.
We proved that the existence of a multi-variate SR function is necessary, but not sufficient, for the existence of a SR function of a single variable. To ensure that the parent-progeny relationship has the conventional form of a SR function, additional conditions must be imposed on the structure of the functions representing egg production and survival of eggs and larvae. It is required that the three processes are given by functions of the same weighted sum of numbers of adults (e.g., the total number of adults or the spawning stock biomass).
When defining recruitment as the transition rate to age class 0, the evolution of all prerecruit (eggs, larvae, juveniles) happens at faster rates than aging and mortality of adult fish. This is in line with the observation made by Schaarschmidt et al (2018), who found fast prerecruit dynamics to be a prerequisite for the existence of a multi-variate SR function.
Previously, SR functions have been derived assuming age-independence of parameters related to egg production and survival of prerecruits (Quinn and Deriso 1999; Touzeau and Gouzé 1998). In this case, all age classes in the adult population contribute homogeneously to egg production and survival and the sufficient condition (C4) for the existence of an SR function holds. However, assuming age-independence of parameters is but one way of ensuring that (C4) holds.
In summary, we observe that by choosing a generic modeling framework, we found necessary and sufficient conditions for the existence and structure of the SR function with broad applicability. In this sense, our results extend and unify previous observations made under a variety of modeling assumptions.
Our DTMM approach offers valuable insights into recruitment dynamics but includes simplifications that may affect real-world applicability. Biological processes like spawning, maturation, and survival are continuous by nature, but we discretized them for mathematical analysis and to derive SR function conditions. This may overlook temporal and spatial variations in these processes. Future research could integrate continuous-time dynamics, potentially using differential equations. Incorporating spatially explicit data and time-varying parameters would also better capture survival and maturation variability influenced by habitat, predation, and competition. Hybrid models combining discrete and continuous elements, as well as further stochastic details, could enhance the realism and predictive power of the DTMM. A further step towards capturing the complexities of recruitment processes would be to account for environmental factors that influence fish populations. Recruitment models that include environmental covariates have been described in the fisheries literature (as reviewed by Subbey et al (2014)). While simplified, our approach provides a robust framework for understanding the relationship between adult fish populations and recruitment.
We have considered an age-structured population though the framework can apply to populations structured by length or weight. The existence of a multi-variate SR function remains valid regardless of whether the adult population is structured according to age, length or weight. However, a univariate SR function in a closed-form is dependent on additional conditions.
From a modeling perspective, the multi-stage approach enhances the realism of simulations by accounting for all life stages and their inter-dependencies. It allows for a more comprehensive assessment of how various pressures (e.g., fishing intensity and environmental changes) affect each stage and, consequently, overall recruitment. This approach can potentially help identify biological factors that influence early life stages, which are critical for predicting future stock sizes and assessing potential risks to recruitment.
By delineating the necessary and sufficient conditions for a valid SR function, the multi-stage modeling approach could help clarify the contexts in which traditional SR models may fail, thereby reducing uncertainty in stock assessments. Alternatively, starting with a multi-stage model, one could determine when a SR function may be a valid simplification, thus reducing model complexity in stock assessment. This way, we also address challenges related to data collection: if conditions for the existence of a multi-variate SR function prevail, any challenges related to prerecruit data may safely be omitted.
For fisheries management, the insights from this paper highlight the potential risks of relying solely on traditional SR functions, which may lead to over- or underestimations of recruitment under specific conditions. The proposed multi-stage model offers a more nuanced framework, potentially enabling managers to pinpoint critical bottlenecks in the life cycle that could be addressed to enhance recruitment. This approach supports more targeted interventions, such as setting quotas or establishing protected areas tailored to specific life stages. Given the complexity of life cycles in many fish species, this model provides an approach to developing management strategies that align more closely with species-specific dynamics.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1Nash RDM (1998) Exploring the population dynamics of Irish Sea plaice, Pleuronectes platessa L., through the use of Paulik diagrams. J Sea Res 40(1–2):1–18. 10.1016/S 1385-1101(98)00012-4
