Search Results for ""

Intuitively, a model of d-dimensional percolation theory is said to be a Bernoulli model if the open/closed status of an area is completely random. In particular, it makes ...

In discrete percolation theory, bond percolation is a percolation model on a regular point lattice L=L^d in d-dimensional Euclidean space which considers the lattice graph ...

In continuum percolation theory, the Boolean-Poisson model is a Boolean model driven by a stationary point process X which is a Poisson process. The Boolean-Poisson model is ...

The Chu-Vandermonde identity _2F_1(-n,b;c;1)=((c-b)_n)/((c)_n) (1) (for n in Z^+) is a special case of Gauss's hypergeometric theorem _2F_1(a,b;c;1) = ((c-b)_(-a))/((c)_(-a)) ...

The Dejter graph is a weakly regular graph on 112 vertices and 336 edges with regular paremeters (nu,k,lambda,mu)=(112,6,0,(0,1,2)). It can be obtained by deleting a copy of ...

The Diffie-Hellman protocol is a method for two computer users to generate a shared private key with which they can then exchange information across an insecure channel. Let ...

Let c_k be the number of edge covers of a graph G of size k. Then the edge cover polynomial E_G(x) is defined by E_G(x)=sum_(k=0)^mc_kx^k, (1) where m is the edge count of G ...

The term "Euler graph" is sometimes used to denote a graph for which all vertices are of even degree (e.g., Seshu and Reed 1961). Note that this definition is different from ...

First-passage percolation is a time-dependent generalization of discrete Bernoulli percolation in which each graph edge e of Z^d is assigned a nonnegative random variable ...

A fiveleaper graph is a graph formed by all possible moves of a hypothetical chess piece called a "fiveleaper" which moves analogously to a knight except that it is ...