When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Poisson point process - Wikipedia

    en.wikipedia.org/wiki/Poisson_point_process

    A visual depiction of a Poisson point process starting. In probability theory, statistics and related fields, a Poisson point process (also known as: Poisson random measure, Poisson random point field and Poisson point field) is a type of mathematical object that consists of points randomly located on a mathematical space with the essential feature that the points occur independently of one ...

  3. Point process - Wikipedia

    en.wikipedia.org/wiki/Point_process

    A Poisson (counting) process on the line can be characterised by two properties : the number of points (or events) in disjoint intervals are independent and have a Poisson distribution. A Poisson point process can also be defined using these two properties. Namely, we say that a point process is a Poisson point process if the following two ...

  4. Quasireversibility - Wikipedia

    en.wikipedia.org/wiki/Quasireversibility

    Quasireversibility is equivalent to a particular form of partial balance.First, define the reversed rates q'(x,x') by ′ (, ′) = (′) (′,)then considering just customers of a particular class, the arrival and departure processes are the same Poisson process (with parameter ), so

  5. Poisson distribution - Wikipedia

    en.wikipedia.org/wiki/Poisson_distribution

    In probability theory and statistics, the Poisson distribution (/ ˈ p w ɑː s ɒ n /; French pronunciation:) is a discrete probability distribution that expresses the probability of a given number of events occurring in a fixed interval of time if these events occur with a known constant mean rate and independently of the time since the last event. [1]

  6. Kendall's notation - Wikipedia

    en.wikipedia.org/wiki/Kendall's_notation

    Poisson process (or random) arrival process (i.e., exponential inter-arrival times). M/M/1 queue: M X: batch Markov: Poisson process with a random variable X for the number of arrivals at one time. M X /M Y /1 queue: MAP: Markovian arrival process: Generalisation of the Poisson process. BMAP: Batch Markovian arrival process: Generalisation of ...

  7. Campbell's theorem (probability) - Wikipedia

    en.wikipedia.org/wiki/Campbell's_theorem...

    In probability theory and statistics, Campbell's theorem or the Campbell–Hardy theorem is either a particular equation or set of results relating to the expectation of a function summed over a point process to an integral involving the mean measure of the point process, which allows for the calculation of expected value and variance of the random sum.

  8. Complete spatial randomness - Wikipedia

    en.wikipedia.org/wiki/Complete_spatial_randomness

    Complete spatial randomness (CSR) describes a point process whereby point events occur within a given study area in a completely random fashion. It is synonymous with a homogeneous spatial Poisson process. [1] Such a process is modeled using only one parameter , i.e. the density of points within the defined area. The term complete spatial ...

  9. Phase-type distribution - Wikipedia

    en.wikipedia.org/wiki/Phase-type_distribution

    Further, let the process have an initial probability of starting in any of the m + 1 phases given by the probability vector (α 0,α) where α 0 is a scalar and α is a 1 × m vector. The continuous phase-type distribution is the distribution of time from the above process's starting until absorption in the absorbing state.