scholarly journals An Analytical Framework for Studying Small-Number Effects in Catalytic Reaction Networks: A Probability Generating Function Approach to Chemical Master Equations

2016 ◽  
Vol 7 ◽  
Author(s):  
Masaki Nakagawa ◽  
Yuichi Togashi
2017 ◽  
Vol 31 (14) ◽  
pp. 1750161 ◽  
Author(s):  
Yin Long ◽  
Xiao-Jun Zhang ◽  
Kui Wang

In this paper, theoretical solutions for degree distribution of decreasing random birth-and-death networks [Formula: see text] are provided. First, we prove that the degree distribution has the form of Poisson summation, for which degree distribution equations under steady state and probability generating function approach are employed. Then, based on the form of Poisson summation, we further confirm the tail characteristic of degree distribution is Poisson tail. Finally, simulations are carried out to verify these results by comparing the theoretical solutions with computer simulations.


This article take a gander at a bunch area single server channel Queuing system, where the server gives two sorts of organizations viz., beginning one a central organization and the optional organization is permitted as a second organization. In case in need, the customer settle on the optional organization .We other than anticipate that after the execution of the second time of affiliation, if the structure is unfilled, the server takes a required get-away of general dissemination. Organization thwarts in the midst of principal organization at random. Additionally if the customer isn't satisfied with the primary central organization, an info advantage for the proportionate is given to make a worthy space for the customers in the system. For the above delineated covering issue, the supplementary variable technique and generating function approach are used to derive the probability generating function of the queue size and the average length of the queue.


2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Nikolaos Halidias

Abstract In this note we study the probability and the mean time for absorption for discrete time Markov chains. In particular, we are interested in estimating the mean time for absorption when absorption is not certain and connect it with some other known results. Computing a suitable probability generating function, we are able to estimate the mean time for absorption when absorption is not certain giving some applications concerning the random walk. Furthermore, we investigate the probability for a Markov chain to reach a set A before reach B generalizing this result for a sequence of sets A 1 , A 2 , … , A k {A_{1},A_{2},\dots,A_{k}} .


Mathematics ◽  
2021 ◽  
Vol 9 (8) ◽  
pp. 868
Author(s):  
Khrystyna Prysyazhnyk ◽  
Iryna Bazylevych ◽  
Ludmila Mitkova ◽  
Iryna Ivanochko

The homogeneous branching process with migration and continuous time is considered. We investigated the distribution of the period-life τ, i.e., the length of the time interval between the moment when the process is initiated by a positive number of particles and the moment when there are no individuals in the population for the first time. The probability generating function of the random process, which describes the behavior of the process within the period-life, was obtained. The boundary theorem for the period-life of the subcritical or critical branching process with migration was found.


2021 ◽  
Vol 13 (2) ◽  
pp. 413-426
Author(s):  
S. Naderi ◽  
R. Kazemi ◽  
M. H. Behzadi

Abstract The bucket recursive tree is a natural multivariate structure. In this paper, we apply a trivariate generating function approach for studying of the depth and distance quantities in this tree model with variable bucket capacities and give a closed formula for the probability distribution, the expectation and the variance. We show as j → ∞, lim-iting distributions are Gaussian. The results are obtained by presenting partial differential equations for moment generating functions and solving them.


Sign in / Sign up

Export Citation Format

Share Document