pith. sign in

arxiv: 2605.17186 · v1 · pith:IQEPJLKLnew · submitted 2026-05-16 · 🧮 math.NA · cs.NA· math.DS· math.PR· q-bio.QM· stat.CO

Solving linear-rate ODE hierarchies (like master equations) using closures and operator splitting

Pith reviewed 2026-05-20 13:50 UTC · model grok-4.3

classification 🧮 math.NA cs.NAmath.DSmath.PRq-bio.QMstat.CO
keywords linear-rate ODE hierarchiesgenerating functionsmethod of characteristicsoperator splittingmaster equationscontinuous-time Markov chainsnumerical closure methods
0
0 comments X

The pith

A linear-rate condition on transition rates lets generating functions close infinite ODE hierarchies into finite polynomial systems for any output window.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes that when Markov transition rates take the linear form L_{n+r,n} = alpha_r n + beta_r, the probability generating function satisfies a first-order linear PDE whose solution is a composition-multiplier map G(z,t) = K_t(z) G(Phi_t(z),0). The Taylor coefficients of Phi_t and K_t up to any finite N are then governed exactly by a closed lower-triangular ODE on 2(N+1) variables that never references states above N. Truncation is needed only for the initial distribution's support, removing the usual boundary bias and cubic cost of direct truncation-plus-exponentiation. For generators that split into a linear-rate part and a non-affine remainder, the same closure combines with Strang splitting and Richardson extrapolation to reach fourth-order accuracy at modest extra cost.

Core claim

Under the linear-rate structural condition the generating function obeys G(z,t) = K_t(z) G(Phi_t(z),0) where the coefficient vectors of Phi_t and K_t on {0,...,N} evolve exactly under a closed polynomial ODE of dimension 2(N+1) whose right-hand side depends only on those 2(N+1) unknowns.

What carries the argument

Method of characteristics applied to the first-order linear PDE satisfied by the generating function under the linear-rate rate condition, yielding the composition-multiplier representation whose Taylor coefficients close independently of higher states.

If this is right

  • Probabilities on any finite window {0,...,N} are obtained without truncation bias from states above N.
  • The same finite closed system applies to Markov branching with immigration, multi-type branching, and signed hierarchies.
  • Pairing the closure with Strang splitting on a non-affine remainder produces a fourth-order scheme whose wall-clock cost scales far better than dense Padé or sparse Krylov exponentiation on large state spaces.
  • A closure-Strang power iteration extends the method to stationary distributions on multi-dimensional product spaces where sparse LU exhausts memory.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same generating-function closure may extend to certain non-Markovian or measure-valued processes whose intensity kernels admit analogous linear structure.
  • Because the closed ODE is polynomial and lower-triangular, its Jacobian is cheap to form, suggesting possible use inside implicit or exponential integrators for still higher accuracy.
  • The linear-rate class includes many models whose stationary distributions are known in closed form; the dynamical closure therefore supplies a consistent way to evolve those distributions without artificial boundaries.

Load-bearing premise

The transition rates must satisfy L_{n+r,n} = alpha_r n + beta_r for all relevant n and r.

What would settle it

Compute the next coefficient above N from the closed ODE and check whether it equals the true evolution obtained from a much larger truncation; any discrepancy grows with time if the linear-rate condition fails.

Figures

Figures reproduced from arXiv: 2605.17186 by Joshua C Chang.

Figure 3
Figure 3. Figure 3: reports wall clock and error at [PITH_FULL_IMAGE:figures/full_fig_p014_3.png] view at source ↗
Figure 3
Figure 3. Figure 3: reports wall clock and splitting error [PITH_FULL_IMAGE:figures/full_fig_p016_3.png] view at source ↗
Figure 3
Figure 3. Figure 3: reports wall clock and in-window error at two cases: [PITH_FULL_IMAGE:figures/full_fig_p017_3.png] view at source ↗
Figure 3
Figure 3. Figure 3 [PITH_FULL_IMAGE:figures/full_fig_p018_3.png] view at source ↗
Figure 3
Figure 3. Figure 3: shows wall clock vs. error at fixed [PITH_FULL_IMAGE:figures/full_fig_p019_3.png] view at source ↗
Figure 3
Figure 3. Figure 3: consolidates four [PITH_FULL_IMAGE:figures/full_fig_p020_3.png] view at source ↗
Figure 3
Figure 3. Figure 3: ( [PITH_FULL_IMAGE:figures/full_fig_p037_3.png] view at source ↗
read the original abstract

Countably infinite systems of linear ODEs arise as forward equations for many continuous-time Markov processes. The standard recipe -- truncate to a finite cap N and exponentiate -- pays cubic cost in N and a time-growing boundary-feedback bias. We identify a structural condition on the rates, L_{n+r,n} = alpha_r n + beta_r ("linear-rate"), under which the generating function G(z,t) = sum_n x_n(t) z^n satisfies a first-order linear PDE in z, and the method of characteristics yields a composition-multiplier representation G(z,t) = K_t(z) G(Phi_t(z), 0). The Taylor coefficients of Phi_t and K_t on any output window {0,...,N} are determined exactly by a closed lower-triangular polynomial ODE on R^{2(N+1)}, independent of any coefficients above N. Truncation enters only through the support M_0 of the initial law, set independently of N. For binary birth-death the closure collapses to the geometric tail p_n(t) = p_1(t) rho(t)^{n-1} with rho(t) = lambda(1 - e^{-(mu-lambda)t})/(mu - lambda e^{-(mu-lambda)t}). The linear-rate class spans Markov branching with immigration, multi-type branching, matrix-valued telegraph and G/R elongation, and signed or non-stochastic hierarchies. When the generator decomposes as L = A + B with A linear-rate and B non-affine (Schlogl bistable, predator-prey, lattice reaction-diffusion), we pair the closure with Strang splitting on B; Richardson extrapolation lifts the time order to Delta-t^4 at ~3x wall clock. On the Schlogl problem at V=500, N=8,000, the split runs 6.3x faster than dense Pade and 20x faster than sparse Krylov expv. For the stationary regime, a closure-Strang power iteration extends the same machinery to multi-dimensional product-state-space generators where sparse LU hits OOM/OOT or boundary-projection bias at usable caps. Numerical experiments locate where each route wins and where it is dominated by standard tools.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 2 minor

Summary. The manuscript develops a closure technique for countably infinite linear ODE hierarchies (master equations) under the structural assumption that transition rates satisfy L_{n+r,n} = alpha_r n + beta_r. The generating function G(z,t) obeys a first-order linear PDE whose solution is expressed via the method of characteristics as G(z,t) = K_t(z) G(Phi_t(z),0). The Taylor coefficients of Phi_t and K_t up to any finite window {0,...,N} are shown to satisfy a closed lower-triangular polynomial ODE on R^{2(N+1)} whose right-hand side depends only on coefficients of index <=N. For the binary birth-death process this yields an exact geometric tail. The method is paired with Strang splitting and Richardson extrapolation when the generator decomposes as L = A + B with A linear-rate and B non-affine; numerical tests on the Schlogl model at V=500, N=8000 report 6.3x speedup over dense Pade and 20x over sparse Krylov.

Significance. If the algebraic closure holds, the work supplies an exact, truncation-free solver for an important subclass of master equations together with a practical splitting strategy for broader models. The demonstrated wall-clock gains on large state spaces and the extension to stationary regimes via power iteration are concrete strengths. The approach is parameter-free once the linear-rate coefficients are given and supplies reproducible closed-form expressions for special cases such as binary birth-death.

major comments (1)
  1. [§3.3] §3.3, Eq. (17): the induction establishing that the coefficient ODE for phi_k(t), k<=N is independent of all phi_m with m>N is stated but the explicit cancellation of higher monomials in the composed series p(Phi(z)) is not written out; a short inductive step or generating-function identity would make the load-bearing closure claim fully verifiable.
minor comments (2)
  1. [Figure 2] Figure 2 caption: the legend for the Richardson-extrapolated curve is missing the order label; add 'O(Delta t^4)' for clarity.
  2. [§5.2] §5.2: the statement that 'boundary-projection bias' is avoided should be quantified by reporting the L1 distance to a reference solution at a larger cap for at least one test case.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the positive evaluation, the clear summary of the contribution, and the constructive suggestion for improving verifiability. We address the single major comment below and will revise the manuscript accordingly.

read point-by-point responses
  1. Referee: [§3.3] §3.3, Eq. (17): the induction establishing that the coefficient ODE for phi_k(t), k<=N is independent of all phi_m with m>N is stated but the explicit cancellation of higher monomials in the composed series p(Phi(z)) is not written out; a short inductive step or generating-function identity would make the load-bearing closure claim fully verifiable.

    Authors: We agree that an explicit verification of the cancellation would strengthen the presentation of the closure. In the revised manuscript we will add a short inductive argument (or, alternatively, the generating-function identity) showing that the coefficients of z^k for k > N in the expansion of any polynomial p(Phi(z)) vanish identically when only the first N+1 coefficients of Phi are retained. The argument proceeds by induction on the degree, using the fact that the linear-rate structure makes the right-hand side of the coefficient ODE for phi_k depend only on lower-index terms; this makes the independence from phi_m, m > N, immediate without altering any theorems or numerical results. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation is algebraically self-contained

full rationale

The paper derives the closed lower-triangular polynomial ODE for the Taylor coefficients of Phi_t and K_t directly from the method of characteristics applied to the first-order linear PDE for the generating function G(z,t), which itself follows from the linear-rate structural assumption L_{n+r,n} = alpha_r n + beta_r. This closure property is an algebraic consequence of the polynomial coefficients in the characteristic equations and the composition of power series, with no reduction to fitted parameters, self-citations, or redefinition of outputs as inputs. The truncation and splitting steps are presented as standard numerical techniques applied after the closure, without feedback into the core claim. The result is independent of any external benchmarks or prior author work in a load-bearing way.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The linear-rate structural condition is the sole load-bearing assumption extracted from the abstract; no free parameters, invented entities, or additional axioms are stated.

axioms (1)
  • domain assumption Transition rates satisfy L_{n+r,n} = alpha_r n + beta_r for constants alpha_r, beta_r independent of n.
    This is the premise that converts the master equation into a first-order linear PDE for the generating function.

pith-pipeline@v0.9.0 · 5955 in / 1623 out tokens · 43001 ms · 2026-05-20T13:50:34.336689+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

153 extracted references · 153 canonical work pages · 9 internal anchors

  1. [1]

    Survival and

    First Passage Time Models:. Survival and. doi:10.1007/978-0-387-68560-1_10 , urldate =

  2. [2]

    doi:10.1007/978-0-387-68560-1_1 , urldate =

    An Introduction to Survival and Event History Analysis , booktitle =. doi:10.1007/978-0-387-68560-1_1 , urldate =

  3. [3]

    doi:10.1007/978-0-387-68560-1_8 , urldate =

    Marginal and Dynamic Models for Recurrent Events and Clustered Survival Data , booktitle =. doi:10.1007/978-0-387-68560-1_8 , urldate =

  4. [4]

    doi:10.1007/978-0-387-68560-1_3 , urldate =

    Nonparametric Analysis of Survival and Event History Data , booktitle =. doi:10.1007/978-0-387-68560-1_3 , urldate =

  5. [5]

    doi:10.1007/978-0-387-68560-1_4 , urldate =

    Regression Models , booktitle =. doi:10.1007/978-0-387-68560-1_4 , urldate =

  6. [6]

    doi:10.1007/978-0-387-68560-1_2 , urldate =

    Stochastic Processes in Event History Analysis , booktitle =. doi:10.1007/978-0-387-68560-1_2 , urldate =

  7. [7]

    and Borgan,

    Aalen, Odd O. and Borgan,. Survival and. doi:10.1007/978-0-387-68560-1 , urldate =

  8. [8]

    Ruin Probabilities and Aggregrate Claims Distributions for Shot Noise

    Albrecher, Hansj. Ruin Probabilities and Aggregrate Claims Distributions for Shot Noise. Scandinavian Actuarial Journal , volume =. doi:10.1080/03461230600630395 , urldate =

  9. [9]

    Physical Review E , volume =

    Generalized Master Equation via Aging Continuous-Time Random Walks , author =. Physical Review E , volume =. doi:10.1103/PhysRevE.68.056123 , urldate =

  10. [10]

    Studies in Applied and Numerical Mathematics , urldate =

    Analytical and. Studies in Applied and Numerical Mathematics , urldate =

  11. [11]

    Analytical and

    Linz, Peter , journal =. Analytical and

  12. [12]

    and Olsson, Marita , year = 1996, journal =

    Asmussen, Ren and Nerman, O. and Olsson, Marita , year = 1996, journal =. Fitting

  13. [13]

    Asmussen, S?ren , year = 2000, publisher =. Ruin

  14. [14]

    and Ney, Peter E

    Athreya, Krishna B. and Ney, Peter E. , editor =. Age-. Branching. doi:10.1007/978-3-642-65371-1_4 , urldate =

  15. [15]

    and Ney, Peter E

    Athreya, Krishna B. and Ney, Peter E. , year = 1972, publisher =. Branching. doi:10.1007/978-3-642-65371-1 , urldate =

  16. [16]

    and Ney, Peter E

    Athreya, Krishna B. and Ney, Peter E. , editor =. The. Branching. doi:10.1007/978-3-642-65371-1_1 , urldate =

  17. [17]

    and Ney, Peter E

    Athreya, Krishna B. and Ney, Peter E. , editor =. Multi-. Branching. doi:10.1007/978-3-642-65371-1_5 , urldate =

  18. [18]

    and Ney, Peter E

    Athreya, Krishna B. and Ney, Peter E. , editor =. One. Branching. doi:10.1007/978-3-642-65371-1_3 , urldate =

  19. [19]

    and Ney, Peter E

    Athreya, Krishna B. and Ney, Peter E. , editor =. Potential. Branching. doi:10.1007/978-3-642-65371-1_2 , urldate =

  20. [20]

    and Ney, Peter E

    Athreya, Krishna B. and Ney, Peter E. , editor =. Special. Branching. doi:10.1007/978-3-642-65371-1_6 , urldate =

  21. [21]

    Baker, George A. and. Pad\'e. doi:10.1017/CBO9780511530074 , urldate =

  22. [22]

    Bellman, Richard and Harris, Theodore , year = 1952, journal =. On. doi:10.2307/1969779 , urldate =. 1969779 , eprinttype =

  23. [23]

    , year = 1948, month = dec, journal =

    Bellman, Richard and Harris, Theodore E. , year = 1948, month = dec, journal =. On the. doi:10.1073/pnas.34.12.601 , urldate =

  24. [24]

    Applied and Computational Harmonic Analysis , series =

    Approximation by Exponential Sums Revisited , author =. Applied and Computational Harmonic Analysis , series =. doi:10.1016/j.acha.2009.08.011 , urldate =

  25. [25]

    Applied and Computational Harmonic Analysis , volume =

    On Approximation of Functions by Exponential Sums , author =. Applied and Computational Harmonic Analysis , volume =. doi:10.1016/j.acha.2005.01.003 , urldate =

  26. [26]

    Bingham, N. H. and Goldie, C. M. and Teugels, J. L. , year = 1987, series =. Regular. doi:10.1017/CBO9780511721434 , urldate =

  27. [27]

    Bladt, Mogens and Nielsen, Bo Friis , editor =. Some. Matrix-. doi:10.1007/978-1-4939-7049-0_11 , urldate =

  28. [28]

    Estimation of

    Bladt, Mogens and Nielsen, Bo Friis , editor =. Estimation of. Matrix-. doi:10.1007/978-1-4939-7049-0_13 , urldate =

  29. [29]

    Bladt, Mogens and Nielsen, Bo Friis , editor =. Markov. Matrix-. doi:10.1007/978-1-4939-7049-0_9 , urldate =

  30. [30]

    Markovian

    Bladt, Mogens and Nielsen, Bo Friis , editor =. Markovian. Matrix-. doi:10.1007/978-1-4939-7049-0_10 , urldate =

  31. [31]

    Martingales and

    Bladt, Mogens and Nielsen, Bo Friis , editor =. Martingales and. Matrix-. doi:10.1007/978-1-4939-7049-0_2 , urldate =

  32. [32]

    Bladt, Mogens and Nielsen, Bo Friis , editor =. Matrix-. Matrix-. doi:10.1007/978-1-4939-7049-0_4 , urldate =

  33. [33]

    Bladt, Mogens and Nielsen, Bo Friis , year = 2017, series =. Matrix-. doi:10.1007/978-1-4939-7049-0 , urldate =

  34. [34]

    Multivariate

    Bladt, Mogens and Nielsen, Bo Friis , editor =. Multivariate. Matrix-. doi:10.1007/978-1-4939-7049-0_8 , urldate =

  35. [35]

    Bladt, Mogens and Nielsen, Bo Friis , editor =. Phase-. Matrix-. doi:10.1007/978-1-4939-7049-0_3 , urldate =

  36. [36]

    Preliminaries on

    Bladt, Mogens and Nielsen, Bo Friis , editor =. Preliminaries on. Matrix-. doi:10.1007/978-1-4939-7049-0_1 , urldate =

  37. [37]

    Bladt, Mogens and Nielsen, Bo Friis , editor =. Random. Matrix-. doi:10.1007/978-1-4939-7049-0_6 , urldate =

  38. [38]

    Regeneration and

    Bladt, Mogens and Nielsen, Bo Friis , editor =. Regeneration and. Matrix-. doi:10.1007/978-1-4939-7049-0_7 , urldate =

  39. [39]

    Bladt, Mogens and Nielsen, Bo Friis , editor =. Renewal. Matrix-. doi:10.1007/978-1-4939-7049-0_5 , urldate =

  40. [40]

    Statistical

    Bladt, Mogens and Nielsen, Bo Friis , editor =. Statistical. Matrix-. doi:10.1007/978-1-4939-7049-0_12 , urldate =

  41. [41]

    Journal of Mathematical Biology , volume =

    Multiscale Stochastic Modelling of Gene Expression , author =. Journal of Mathematical Biology , volume =. doi:10.1007/s00285-011-0468-7 , abstract =

  42. [42]

    Bracci, Filippo and Contreras, Manuel D. and. Continuous. doi:10.1007/978-3-030-36782-4 , urldate =

  43. [43]

    and Hegland, M

    Burrage, K. and Hegland, M. and MacNamara, S. and Sidje, R. , year = 2006, urldate =. A

  44. [44]

    Proceedings of the National Academy of Sciences of the United States of America , volume =

    Analytical Distributions for Detailed Models of Stochastic Gene Expression in Eukaryotic Cells , author =. Proceedings of the National Academy of Sciences of the United States of America , volume =. doi:10.1073/pnas.1910888117 , abstract =

  45. [45]

    Nature Communications , volume =

    Linear Mapping Approximation of Gene Regulatory Networks with Stochastic Dynamics , author =. Nature Communications , volume =. doi:10.1038/s41467-018-05822-0 , urldate =

  46. [46]

    BIT , volume =

    Splitting Methods with Complex Times for Parabolic Equations , author =. BIT , volume =. doi:10.1007/s10543-009-0235-y , urldate =

  47. [47]

    Exact Closure for Infinite-Dimensional Linear

  48. [48]

    Linear Algebra and its Applications , volume =

    Riordan Group Involutions , author =. Linear Algebra and its Applications , volume =. doi:10.1016/j.laa.2007.09.003 , urldate =

  49. [49]

    , year = 2011, month = feb, publisher =

    Chihara, Theodore S. , year = 2011, month = feb, publisher =. An

  50. [50]

    The Journal of Chemical Physics , volume =

    Stochastic Operator-Splitting Method for Reaction-Diffusion Systems , author =. The Journal of Chemical Physics , volume =. doi:10.1063/1.4764108 , urldate =

  51. [51]

    Journal of Theoretical Biology , volume =

    Fixation Times in Differentiation and Evolution in the Presence of Bottlenecks, Deserts, and Oases , author =. Journal of Theoretical Biology , volume =. doi:10.1016/j.jtbi.2015.02.021 , urldate =

  52. [52]

    , year = 2016, month = jul, journal =

    Chou, Tom and Greenman, Chris D. , year = 2016, month = jul, journal =. A. doi:10.1007/s10955-016-1524-x , urldate =

  53. [53]

    Wiley interdisciplinary reviews

    Computational Methods for Birth-Death Processes , author =. Wiley interdisciplinary reviews. Computational statistics , volume =. doi:10.1002/wics.1423 , urldate =

  54. [54]

    Journal of mathematical biology , volume =

    Transition Probabilities for General Birth-Death Processes with Applications in Ecology, Genetics, and Evolution , author =. Journal of mathematical biology , volume =. doi:10.1007/s00285-011-0471-z , urldate =

  55. [55]

    Affine processes on positive semidefinite matrices

    Affine Processes on Positive Semidefinite Matrices , author =. The Annals of Applied Probability , volume =. doi:10.1214/10-AAP710 , urldate =. arXiv , keywords =:0910.0137 , primaryclass =

  56. [56]

    Microelectronics Reliability , volume =

    On the Canonical Representation of Homogeneous Markov Processes Modelling Failure - Time Distributions , author =. Microelectronics Reliability , volume =. doi:10.1016/0026-2714(82)90033-6 , urldate =

  57. [57]

    Stochastic Models of Gene Transcription with Upstream Drives: Exact Solution and Sample Path Characterization , shorttitle =

    Dattani, Justine and Barahona, Mauricio , year = 2017, month = jan, journal =. Stochastic Models of Gene Transcription with Upstream Drives: Exact Solution and Sample Path Characterization , shorttitle =. doi:10.1098/rsif.2016.0833 , urldate =

  58. [58]

    Dawson, D. A. and Li, Zenghu , year = 2006, month = may, journal =. Skew Convolution Semigroups and Affine. doi:10.1214/009117905000000747 , urldate =. arXiv , keywords =:math/0505444 , issn =

  59. [59]

    Dempster, A. P. and Laird, N. M. and Rubin, D. B. , year = 1977, journal =. Maximum. 2984875 , eprinttype =

  60. [60]

    Numerical Linear Algebra with Applications , volume =

    Simultaneous State-Time Approximation of the Chemical Master Equation Using Tensor Product Formats , author =. Numerical Linear Algebra with Applications , volume =. doi:10.1002/nla.1942 , urldate =

  61. [61]

    Physical Review B , volume =

    Auxiliary Master Equation Approach to Nonequilibrium Correlated Impurities , author =. Physical Review B , volume =. doi:10.1103/PhysRevB.89.165105 , urldate =

  62. [62]

    doi:10.1007/978-1-4757-3437-9 , urldate =

    Sequential. doi:10.1007/978-1-4757-3437-9 , urldate =

  63. [63]

    Bernoulli , volume =

    Statistical Estimation of a Growth-Fragmentation Model Observed on a Genealogical Tree , author =. Bernoulli , volume =. doi:10.3150/14-BEJ623 , urldate =

  64. [64]

    The Annals of Applied Probability , volume =

    Affine Processes and Applications in Finance , author =. The Annals of Applied Probability , volume =. doi:10.1214/aoap/1060202833 , urldate =

  65. [65]

    Transform

    Duffie, Darrell and Pan, Jun and Singleton, Kenneth , year = 2000, journal =. Transform. doi:10.1111/1468-0262.00164 , urldate =

  66. [66]

    Emberchts, Paul and Kl. Time. Modelling. doi:10.1007/978-3-642-33483-2_8 , urldate =

  67. [67]

    Modelling

    Embrechts, Paul and Kl. Modelling. doi:10.1007/978-3-642-33483-2 , urldate =

  68. [68]

    Journal of Computational and Applied Mathematics , volume =

    Spectral Approximation of Solutions to the Chemical Master Equation , author =. Journal of Computational and Applied Mathematics , volume =. doi:10.1016/j.cam.2008.10.029 , urldate =

  69. [69]

    Stochastic modelling of reaction-diffusion processes: algorithms for bimolecular reactions

    Erban, Radek and Chapman, S. Jonathan , year = 2009, month = aug, journal =. Stochastic Modelling of Reaction-Diffusion Processes: Algorithms for Bimolecular Reactions , shorttitle =. doi:10.1088/1478-3975/6/4/046001 , urldate =. arXiv , keywords =:0903.1298 , primaryclass =

  70. [70]

    Feller, William , year = 1991, month = jan, publisher =. An

  71. [71]

    Filipovic, Damir and Mayerhofer, Eberhard , year = 2009, month = feb, number =. Affine. doi:10.48550/arXiv.0901.4003 , urldate =. arXiv , keywords =:0901.4003 , primaryclass =

  72. [72]

    Flajolet and R

    Flajolet, Philippe and Sedgewick, Robert , year = 2009, publisher =. Analytic. doi:10.1017/CBO9780511801655 , urldate =

  73. [73]

    Liber Amicorum Prof

    Probability Distributions of Phase Type , author =. Liber Amicorum Prof. Emeritus H. Florin , publisher =

  74. [74]

    Solving the Master Equation without Kinetic

    Gel. Solving the Master Equation without Kinetic. Journal of Computational Physics , volume =

  75. [75]

    Solving the Master Equation without Kinetic

    Gel. Solving the Master Equation without Kinetic. Journal of Computational Physics , volume =. doi:10.1016/j.jcp.2016.03.025 , urldate =

  76. [76]

    The Journal of Physical Chemistry , volume =

    Exact Stochastic Simulation of Coupled Chemical Reactions , author =. The Journal of Physical Chemistry , volume =. doi:10.1021/j100540a008 , urldate =

  77. [77]

    Biophysical Journal , volume =

    Modeling Bursty Transcription and Splicing with the Chemical Master Equation , author =. Biophysical Journal , volume =. doi:10.1016/j.bpj.2022.02.004 , urldate =

  78. [78]

    A kinetic theory for age-structured stochastic birth-death processes

    A Kinetic Theory for Age-Structured Stochastic Birth-Death Processes , author =. Physical Review E , volume =. doi:10.1103/PhysRevE.93.012112 , urldate =. arXiv , keywords =:1506.02111 , primaryclass =

  79. [79]

    The Journal of Chemical Physics , volume =

    A Study of the Accuracy of Moment-Closure Approximations for Stochastic Chemical Kinetics , author =. The Journal of Chemical Physics , volume =. doi:10.1063/1.3702848 , urldate =

  80. [80]

    Backward

    Hairer, Ernst and Wanner, Gerhard and Lubich, Christian , editor =. Backward. Geometric. doi:10.1007/3-540-30666-8_9 , urldate =

Showing first 80 references.