Search Results for ""

The term discrete percolation is used to describe models of percolation theory whose media are discrete sets like sets of regular lattice points (e.g., bond percolation and ...

Let S be a semigroup and alpha a positive real-valued function on S such that alpha(st)<=alpha(s)alpha(t) (s,t in S). If l^1(S,alpha) is the set of all complex-valued ...

A set S is discrete in a larger topological space X if every point x in S has a neighborhood U such that S intersection U={x}. The points of S are then said to be isolated ...

The discrete uniform distribution is also known as the "equally likely outcomes" distribution. Letting a set S have N elements, each of them having the same probability, then ...

A discriminant is a quantity (usually invariant under certain classes of transformations) which characterizes certain properties of a quantity's roots. The concept of the ...

The disjoint union of two sets A and B is a binary operator that combines all distinct elements of a pair of given sets, while retaining the original set membership as a ...

A statement is in disjunctive normal form if it is a disjunction (sequence of ORs) consisting of one or more disjuncts, each of which is a conjunction (AND) of one or more ...

A disk algebra is an algebra of functions which are analytic on the open unit disk in C and continuous up to the boundary. A representative measure for a point x in the ...

The disk model is the standard Boolean-Poisson model in two-dimensional continuum percolation theory. In particular, the disk model is characterized by the existence of a ...

For a connected graph G of graph diameter d, the distance-k graph G_k for k=1, ..., d is a graph with the same vertex set and having edge set consisting of the pairs of ...