Clustering of events in a stochastic process
- 1 March 1981
- journal article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 18 (1) , 268-275
- https://doi.org/10.2307/3213188
Abstract
In this paper we derive bounds for the expected waiting time of clustering of at least n events of a stochastic process within a fixed interval of length p. Using this approach of clustering, we derive bounds for the expected duration of the period of time that at least n servers are busy in an ∞-server queue with constant service time. For the case of Poisson arrivals we derive the exact distribution of the duration of that period.Keywords
This publication has 15 references indexed in Scilit:
- Expected waiting time for the visual responseBiological Cybernetics, 1979
- Distribution of the minimum number of points in a scanning interval on the lineStochastic Processes and their Applications, 1978
- Locating bright spots in a point processAdvances in Applied Probability, 1978
- A Generalization of the Karlin-McGregor Theorem on Coincidence Probabilities and an Application to ClusteringThe Annals of Probability, 1977
- A Simpler Expression for $K$th Nearest Neighbor Coincidence ProbabilitiesThe Annals of Probability, 1975
- Adapting coincidence scalers and neural modelling studies of visionBiological Cybernetics, 1971
- Limit theorems for stochastic processes occurring in studies of the light-sensitivity of the human eyeStatistica Neerlandica, 1969
- A Combinatorial Identity and Its Application to the Problem Concerning the First Occurrence of a Rare EventTheory of Probability and Its Applications, 1966
- On bouman-velden-yamamoto’s asymptotic evaluation formula for the probability of visual response in a certain experimental research in quantum-biophysics of visionAnnals of the Institute of Statistical Mathematics, 1965
- The Number of Quanta Necessary for the Perception of Light of the Human EyeOphthalmologica, 1946