Stochastic Process Research Papers
in 2015 and M/M/1 queue with catastrophes given in the reference by Di Crescenzo et al.Several aging and stochastic properties of the network are investigated.The reliabilities of two different networks subjected to the same or different GCPs are compared based on the stochastic order between their signature vectors.The residual lifetime of the network is also assessed where the components fail based on a GCP.The second part of the paper is concerned with three-state networks.Dear Colleagues, The aim of this Special Issue is to publish original research articles that cover recent advances in the theory and applications of stochastic processes. Once you are registered, click here to go to the submission form. Research articles, review articles as well as short communications are invited.The focus will especially be on applications of stochastic processes as models of dynamic phenomena in various research areas, such as biology, economics, medicine, queuing theory, reliability theory, and statistical physics. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.Submitted papers should be well formatted and use good English.Authors may use MDPI's English editing service prior to publication or during author revisions.Finally, we provide various results on the dynamic differential entropy of the lifetime of the improved system. In this paper, we investigate the reliability and stochastic properties of an n-component network under the assumption that the components of the network fail according to a counting process called a geometric counting process (GCP). In the first part, we consider a two-state network (with states up and down) and we assume that its components are subjected to failure based on a GCP.Full article In this paper, we investigate the reliability and stochastic properties of an n-component network under the assumption that the components of the network fail according to a counting process called a geometric counting process (GCP). Some mixture representations for the network reliability are obtained in terms of signature of the network and the reliability function of the arrival times of the GCP.