Search

We consider a continuous-time Ehrenfest model defined over the integers from -N to N, and subject to catastrophes occurring at constant rate. The effect of each catastrophe instantaneously resets the process to state 0. We investigate both the transient and steady-state probabilities of the above model. Further, the first passage time through state 0 is discussed. We perform a jump-diffusion approximation of the above model, which leads to the Ornstein-Uhlenbeck process with catastrophes. The underlying jump-diffusion process is finally studied, with special attention to the symmetric case arising when the Ehrenfest model has equal upward and downward transition rates., Comment: 21 pages, 10 figures

We investigate an M/M/1 queue operating in two switching environments, where the switch is governed by a two-state time-homogeneous Markov chain. This model allows to describe a system that is subject to regular operating phases alternating with anomalous working phases or random repairing periods. We first obtain the steady-state distribution of the process in terms of a generalized mixture of two geometric distributions. In the special case when only one kind of switch is allowed, we analyze the transient distribution, and investigate the busy period problem. The analysis is also performed by means of a suitable heavy-traffic approximation which leads to a continuous random process. Its distribution satisfies a partial differential equation with randomly alternating infinitesimal moments. For the approximating process we determine the steady-state distribution, the transient distribution and a first-passage-time density., Comment: 31 pages, 18 figures

Consider a system performing a continuous-time random walk on the integers, subject to catastrophes occurring at constant rate, and followed by exponentially-distributed repair times. After any repair the system starts anew from state zero. We study both the transient and steady-state probability laws of the stochastic process that describes the state of the system. We then derive a heavy-traffic approximation to the model that yields a jump-diffusion process. The latter is equivalent to a Wiener process subject to randomly occurring jumps, whose probability law is obtained. The goodness of the approximation is finally discussed., Comment: 18 pages, 5 figures, paper accepted by "Methodology and Computing in Applied Probability", the final publication is available at http://www.springerlink.com

The research work outlined in the present note highlights the essential role played by the simulation procedures implemented by us on CINECA supercomputers to complement the mathematical investigations carried within our group over the past several years. The ultimate target of our research is the understanding of certain crucial features of the information processing and transmission by single neurons embedded in complex networks. More specifically, here we provide a bird's eye look of some analytical, numerical and simulation results on the asymptotic behavior of first passage time densities for Gaussian processes, both of a Markov and of a non-Markov type. Several figures indicate significant similarities or diversities between computational and simulated results., Comment: Extended version of the paper published in Science and Supercomputing at CINECA - Report 2003 (Garofalo F., Moretti M., Voli M., eds.), 375-381. ISBN 88-86037-13-9

For a birth-death process subject to catastrophes, defined on the state-space $S=\{r,r+1,r+2,...\}$, with $r$ a positive integer or zero, the first-visit time to a state $k\in S$ is considered and the Laplace transform of its probability density function is determined, use of which is then made to obtain mean and variance. The Laplace transform of the probability density function of the first effective catastrophe occurrence time and its expected value are also obtained. Some extensions to time-non-homogeneous processes are then provided. Finally, certain additional results concerning the determination of the steady-state distribution and the representation of the transition probabilities are worked out, while some applications to particular birth-death processes are shown in the Appendix., Comment: 23 pages, no figures

This paper focuses on the outline of some computational methods for the approximate solution of the integral equations for the neuronal firing probability density and an algorithm for the generation of sample-paths in order to construct histograms estimating the firing densities. Our results originate from the study of non-Markov stationary Gaussian neuronal models with the aim to determine the neuron's firing probability density function. A parallel algorithm has been implemented in order to simulate large numbers of sample paths of Gaussian processes characterized by damped oscillatory covariances in the presence of time dependent boundaries. The analysis based on the simulation procedure provides an alternative research tool when closed-form results or analytic evaluation of the neuronal firing densities are not available., Comment: 10 pages, 3 figures, to be published in Scientiae Mathematicae Japonicae

Making use of a Rice-like series expansion, for a class of stationary Gaussian processes the asymptotic behavior of the first passage time probability density function through certain time-varying boundaries, including periodic boundaries, is determined. Sufficient conditions are then given such that the density asymptotically exhibits an exponential behavior when the boundary is either asymptotically constant or asymptotically periodic., Comment: 21 pages, 7 figures, to be published in Methodology and Computing in Applied Probability