enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Geometric probability - Wikipedia

    en.wikipedia.org/wiki/Geometric_probability

    Problems of the following type, and their solution techniques, were first studied in the 18th century, and the general topic became known as geometric probability. (Buffon's needle) What is the chance that a needle dropped randomly onto a floor marked with equally spaced parallel lines will cross one of the lines?

  3. Geometric distribution - Wikipedia

    en.wikipedia.org/wiki/Geometric_distribution

    The geometric distribution is the only memoryless discrete probability distribution. [4] It is the discrete version of the same property found in the exponential distribution . [ 1 ] : 228 The property asserts that the number of previously failed trials does not affect the number of future trials needed for a success.

  4. Buffon's needle problem - Wikipedia

    en.wikipedia.org/wiki/Buffon's_needle_problem

    The short-needle problem can also be solved without any integration, in a way that explains the formula for p from the geometric fact that a circle of diameter t will cross the distance t strips always (i.e. with probability 1) in exactly two spots. This solution was given by Joseph-Émile Barbier in 1860 [5] and is also referred to as "Buffon ...

  5. Coupon collector's problem - Wikipedia

    en.wikipedia.org/wiki/Coupon_collector's_problem

    In probability theory, the coupon collector's problem refers to mathematical analysis of "collect all coupons and win" contests. It asks the following question: if each box of a given product (e.g., breakfast cereals) contains a coupon, and there are n different types of coupons, what is the probability that more than t boxes need to be bought ...

  6. List of probability distributions - Wikipedia

    en.wikipedia.org/wiki/List_of_probability...

    The Gauss–Kuzmin distribution; The geometric distribution, a discrete distribution which describes the number of attempts needed to get the first success in a series of independent Bernoulli trials, or alternatively only the number of losses before the first success (i.e. one less). The Hermite distribution; The logarithmic (series) distribution

  7. Matrix geometric method - Wikipedia

    en.wikipedia.org/wiki/Matrix_geometric_method

    In probability theory, the matrix geometric method is a method for the analysis of quasi-birth–death processes, continuous-time Markov chain whose transition rate matrices with a repetitive block structure. [1] The method was developed "largely by Marcel F. Neuts and his students starting around 1975." [2]

  8. Hypergeometric distribution - Wikipedia

    en.wikipedia.org/wiki/Hypergeometric_distribution

    In probability theory and statistics, the hypergeometric distribution is a discrete probability distribution that describes the probability of successes (random draws for which the object drawn has a specified feature) in draws, without replacement, from a finite population of size that contains exactly objects with that feature, wherein each draw is either a success or a failure.

  9. Negative hypergeometric distribution - Wikipedia

    en.wikipedia.org/wiki/Negative_hypergeometric...

    Negative-hypergeometric distribution (like the hypergeometric distribution) deals with draws without replacement, so that the probability of success is different in each draw. In contrast, negative-binomial distribution (like the binomial distribution) deals with draws with replacement , so that the probability of success is the same and the ...