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. Stein's method - Wikipedia

    en.wikipedia.org/wiki/Stein's_method

    Stein's method is a general method in probability theory to obtain bounds on the distance between two probability distributions with respect to a probability metric.It was introduced by Charles Stein, who first published it in 1972, [1] to obtain a bound between the distribution of a sum of -dependent sequence of random variables and a standard normal distribution in the Kolmogorov (uniform ...

  5. Jackson network - Wikipedia

    en.wikipedia.org/wiki/Jackson_network

    In queueing theory, a discipline within the mathematical theory of probability, a Jackson network (sometimes Jacksonian network [1]) is a class of queueing network where the equilibrium distribution is particularly simple to compute as the network has a product-form solution.

  6. Renewal theory - Wikipedia

    en.wikipedia.org/wiki/Renewal_theory

    The renewal process is a generalization of the Poisson process. In essence, the Poisson process is a continuous-time Markov process on the positive integers (usually starting at zero) which has independent exponentially distributed holding times at each integer i {\displaystyle i} before advancing to the next integer, i + 1 {\displaystyle i+1} .

  7. Point process operation - Wikipedia

    en.wikipedia.org/wiki/Point_process_operation

    The thinning operation entails using some predefined rule to remove points from a point process to form a new point process .These thinning rules may be deterministic, that is, not random, which is the case for one of the simplest rules known as -thinning: [1] each point of is independently removed (or kept) with some probability (or ).

  8. Nearest neighbour distribution - Wikipedia

    en.wikipedia.org/wiki/Nearest_neighbour_distribution

    For a Poisson point process, the J function is simply J(r) = 1, hence why it is used as a non-parametric test for whether data behaves as though it were from a Poisson process. It is, however, thought possible to construct non-Poisson point processes for which J ( r ) = 1, [ 10 ] but such counterexamples are viewed as somewhat 'artificial' by ...

  9. Mixed Poisson process - Wikipedia

    en.wikipedia.org/wiki/Mixed_Poisson_process

    Mixed Poisson processes are doubly stochastic in the sense that in a first step, the value of the random variable is determined. This value then determines the "second order stochasticity" by increasing or decreasing the original intensity measure μ {\displaystyle \mu } .