enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Bernoulli process - Wikipedia

    en.wikipedia.org/wiki/Bernoulli_process

    A Bernoulli process is a finite or infinite sequence of independent random variables X 1, X 2, X 3, ..., such that for each i, the value of X i is either 0 or 1; for all values of , the probability p that X i = 1 is the same. In other words, a Bernoulli process is a sequence of independent identically distributed Bernoulli trials.

  3. Random walk - Wikipedia

    en.wikipedia.org/wiki/Random_walk

    Five eight-step random walks from a central point. Some paths appear shorter than eight steps where the route has doubled back on itself. (animated version)In mathematics, a random walk, sometimes known as a drunkard's walk, is a stochastic process that describes a path that consists of a succession of random steps on some mathematical space.

  4. Chapman–Kolmogorov equation - Wikipedia

    en.wikipedia.org/wiki/Chapman–Kolmogorov_equation

    where P(t) is the transition matrix of jump t, i.e., P(t) is the matrix such that entry (i,j) contains the probability of the chain moving from state i to state j in t steps. As a corollary, it follows that to calculate the transition matrix of jump t, it is sufficient to raise the transition matrix of jump one to the power of t, that is

  5. Balls into bins problem - Wikipedia

    en.wikipedia.org/wiki/Balls_into_bins_problem

    In the simplest case, if one allocates balls into bins (with =) sequentially one by one, and for each ball one chooses random bins at each step and then allocates the ball into the least loaded of the selected bins (ties broken arbitrarily), then with high probability the maximum load is: [8]

  6. Binomial distribution - Wikipedia

    en.wikipedia.org/wiki/Binomial_distribution

    In probability theory and statistics, the binomial distribution with parameters n and p is the discrete probability distribution of the number of successes in a sequence of n independent experiments, each asking a yes–no question, and each with its own Boolean-valued outcome: success (with probability p) or failure (with probability q = 1 − p).

  7. Probability theory - Wikipedia

    en.wikipedia.org/wiki/Probability_theory

    This is the same as saying that the probability of event {1,2,3,4,6} is 5/6. This event encompasses the possibility of any number except five being rolled. The mutually exclusive event {5} has a probability of 1/6, and the event {1,2,3,4,5,6} has a probability of 1, that is, absolute certainty.

  8. Branching process - Wikipedia

    en.wikipedia.org/wiki/Branching_process

    The most common formulation of a branching process is that of the Galton–Watson process.Let Z n denote the state in period n (often interpreted as the size of generation n), and let X n,i be a random variable denoting the number of direct successors of member i in period n, where X n,i are independent and identically distributed random variables over all n ∈{ 0, 1, 2, ...} and i ∈ {1 ...

  9. Urn problem - Wikipedia

    en.wikipedia.org/wiki/Urn_problem

    In probability and statistics, an urn problem is an idealized mental exercise in which some objects of real interest (such as atoms, people, cars, etc.) are represented as colored balls in an urn or other container. One pretends to remove one or more balls from the urn; the goal is to determine the probability of drawing one color or another ...