TOPICS
Search

Search Results for ""


291 - 300 of 13135 for Probability TheorySearch Results
The probability that a statistical test will be negative for a negative statistic.
The probability of getting a positive result for a given test which should produce a positive result.
An m-gonal n-cone graph, also called the n-point suspension of C_m or generalized wheel graph (Buckley and Harary 1988), is defined by the graph join C_m+K^__n, where C_m is ...
The Miller Institute knot is the 6-crossing prime knot 6_2. It is alternating, chiral, and invertible. A knot diagram of its laevo form is illustrated above, which is ...
The stevedore's knot is the 6-crossing prime knot 6_1. It is implemented in the Wolfram Language as KnotData["Stevedore"]. It has braid word ...
The Meringer graph is one of the four (5,5)-cage graphs, discovered by Meringer (1999) after it had long been thought that only three such cages existed. Like the other ...
The Georges graph, illustrated above, is 50-node graph which is the smallest currently known example of a 3-connected bicubic nonhamiltonian graph. It is implemented in the ...
A point process is a probabilistic model for random scatterings of points on some space X often assumed to be a subset of R^d for some d. Oftentimes, point processes describe ...
There are at least two distinct notions of when a point process is stationary. The most commonly utilized terminology is as follows: Intuitively, a point process X defined on ...
The weak law of large numbers (cf. the strong law of large numbers) is a result in probability theory also known as Bernoulli's theorem. Let X_1, ..., X_n be a sequence of ...
1 ... 27|28|29|30|31|32|33 ... 1314 Previous Next

...