scholarly journals Integration with Stochastic Point Processes

2016 ◽  
Vol 35 (5) ◽  
pp. 1-16 ◽  
Author(s):  
A. Cengiz Öztireli
Keyword(s):  
Point Processes ◽  
Stochastic Point Processes

An analysis of the Pólya point process

1983 ◽  
Vol 15 (01) ◽  
pp. 39-53 ◽  
Author(s):  
Ed Waymire ◽  
Vijay K. Gupta
Keyword(s):  
Point Process ◽  
Point Processes ◽  
Critical Value ◽  
General Representation ◽  
Infinitely Divisible ◽  
Generating Functional ◽  
Representation Problem ◽  
Polya Process ◽  
Pólya Process ◽  
Stochastic Point Processes

The Pólya process is employed to illustrate certain features of the structure of infinitely divisible stochastic point processes in connection with the representation for the probability generating functional introduced by Milne and Westcott in 1972. The Pólya process is used to provide a counterexample to the result of Ammann and Thall which states that the class of stochastic point processes with the Milne and Westcott representation is the class of regular infinitely divisble point processes. So the general representation problem is still unsolved. By carrying the analysis of the Pólya process further it is possible to see the extent to which the general representation is valid. In fact it is shown in the case of the Pólya process that there is a critical value of a parameter above which the representation breaks down. This leads to a proper version of the representation in the case of regular infinitely divisible point processes.

On Updating Algorithms and Inference for Stochastic Point Processes

1975 ◽  
Vol 12 (S1) ◽  
pp. 239-259 ◽  
Author(s):  
D. Vere-Jones
Keyword(s):  
Stochastic Process ◽  
Maximum Likelihood ◽  
Stochastic Approximation ◽  
Approximation Theory ◽  
Point Processes ◽  
Maximum Likelihood Estimates ◽  
Doubly Stochastic ◽  
Stochastic Point Processes ◽  
Asymptotically Efficient ◽  
Estimation And Filtering

This paper is an attempt to interpret and extend, in a more statistical setting, techniques developed by D. L. Snyder and others for estimation and filtering for doubly stochastic point processes. The approach is similar to the Kalman-Bucy approach in that the updating algorithms can be derived from a Bayesian argument, and lead ultimately to equations which are similar to those occurring in stochastic approximation theory. In this paper the estimates are derived from a general updating formula valid for any point process. It is shown that almost identical formulae arise from updating the maximum likelihood estimates, and on this basis it is suggested that in practical situations the sequence of estimates will be consistent and asymptotically efficient. Specific algorithms are derived for estimating the parameters in a doubly stochastic process in which the rate alternates between two levels.

The coincidence approach to stochastic point processes

1975 ◽  
Vol 7 (1) ◽  
pp. 83-122 ◽  
Author(s):  
Odile Macchi
Keyword(s):  
Poisson Process ◽  
Probability Space ◽  
Point Processes ◽  
Counting Process ◽  
Regular Point ◽  
General Point ◽  
Completely Regular ◽  
Photon Process ◽  
Stochastic Point Processes

The structure of the probability space associated with a general point process, when regarded as a counting process, is reviewed using the coincidence formalism. The rest of the paper is devoted to the class of regular point processes for which all coincidence probabilities admit densities. It is shown that their distribution is completely specified by the system of coincidence densities. The specification formalism is stressed for ‘completely’ regular point processes. A construction theorem gives a characterization of the system of coincidence densities of such a process. It permits the study of most models of point processes. New results on the photon process, a particular type of conditioned Poisson process, are derived. New examples are exhibited, including the Gauss-Poisson process and the ‘fermion’ process that is suitable whenever the points are repulsive.

A stochastic process whose successive intervals between events form a first order Markov chain — I

1968 ◽  
Vol 5 (03) ◽  
pp. 648-668
Author(s):  
D. G. Lampard
Keyword(s):  
Markov Chain ◽  
Point Processes ◽  
Electronic Device ◽  
Statistical Properties ◽  
Time Intervals ◽  
First Order ◽  
Stochastic Point Process ◽  
Order Markov Chain ◽  
The One ◽  
Stochastic Point Processes

In this paper we discuss a counter system whose output is a stochastic point process such that the time intervals between pairs of successive events form a first order Markov chain. Such processes may be regarded as next, in order of complexity, in a hierarchy of stochastic point processes, to “renewal” processes, which latter have been studied extensively. The main virtue of the particular system which is studied here is that virtually all its important statistical properties can be obtained in closed form and that it is physically realizable as an electronic device. As such it forms the basis for a laboratory generator whose output may be used for experimental work involving processes of this kind. Such statistical properties as the one and two-dimensional probability densities for the time intervals are considered in both the stationary and nonstationary state and also discussed are corresponding properties of the successive numbers arising in the stores of the counter system. In particular it is shown that the degree of coupling between successive time intervals may be adjusted in practice without altering the one dimensional probability density for the interval lengths. It is pointed out that operation of the counter system may also be regarded as a problem in queueing theory involving one server alternately serving two queues. A generalization of the counter system, whose inputs are normally a pair of statistically independent Poisson processes, to the case where one of the inputs is a renewal process is considered and leads to some interesting functional equations.

scholarly journals A fluid limit for a cache algorithm with general request processes

2010 ◽  
Vol 42 (03) ◽  
pp. 816-833 ◽  
Author(s):  
Takayuki Osogami
Keyword(s):  
Stochastic Models ◽  
Point Processes ◽  
Original System ◽  
Poisson Processes ◽  
Fluid Limit ◽  
Average Probability ◽  
Inhomogeneous Poisson Processes ◽  
Formal Limit ◽  
Stochastic Point Processes ◽  
General Stochastic

We introduce a formal limit, which we refer to as a fluid limit, of scaled stochastic models for a cache managed with the least-recently-used algorithm when requests are issued according to general stochastic point processes. We define our fluid limit as a superposition of dependent replications of the original system with smaller item sizes when the number of replications approaches ∞. We derive the average probability that a requested item is not in a cache (average miss probability) in the fluid limit. We show that, when requests follow inhomogeneous Poisson processes, the average miss probability in the fluid limit closely approximates that in the original system. Also, we compare the asymptotic characteristics, as the cache size approaches ∞, of the average miss probability in the fluid limit to those in the original system.

Node Deployment by Stochastic Point Processes in Wireless Sensor Networks

2010 ◽  
Author(s):  
Heitor Ramos ◽  
Marcelo Almiron ◽  
Alejandro Frery ◽  
Eduardo Nakamura ◽  
Antonio Loureiro
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Point Processes ◽  
Wireless Sensor ◽  
Node Deployment ◽  
Stochastic Point Processes
Sign in / Sign up

Export Citation Format

Share Document