Search Results for ""

A d-dimensional discrete percolation model is said to be inhomogeneous if different graph edges (in the case of bond percolation models) or vertices (in the case of site ...

A 2-dimensional discrete percolation model is said to be mixed if both graph vertices and graph edges may be "blocked" from allowing fluid flow (i.e., closed in the sense of ...

Intuitively, a d-dimensional discrete percolation model is said to be long-range if direct flow is possible between pairs of graph vertices or graph edges which are "very ...

A stationary point process X is said to drive a model of continuum percolation theory if one of the characterizing axioms of the model hinges on the existence of X. In this ...

A purple cow is a confirming instance of the hypothesis that all crows are black.

Even though real arithmetic is uncountable, it possesses a countable "model."

The dual polyhedron of the small rhombidodecahedron and Wenninger model W_(74).

In the field of percolation theory, the term percolation threshold is used to denote the probability which "marks the arrival" (Grimmett 1999) of an infinite connected ...

The Löwenheim-Skolem theorem is a fundamental result in model theory which states that if a countable theory has a model, then it has a countable model. Furthermore, it has a ...

A plot of y_i versus the estimator e_i=y^^_i-y_i. Random scatter indicates the model is probably good. A pattern indicates a problem with the model. If the spread in e_i ...