Statistical classificationWhen classification is performed by a computer, statistical methods are normally used to develop the algorithm.View analysis →
Spanning treeIn the mathematical field of graph theory, a spanning tree T of an undirected graph G is a subgraph that is a tree which includes all of the vertices of G. In general, a graph…View analysis →
Mathematical statisticsMathematical statistics is the application of probability theory and other mathematical concepts to statistics, as opposed to techniques for collecting statistical data. Specific…View analysis →
Directed graphIn mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed edges, often called arcs.View analysis →
PseudoforestIn graph theory, a pseudoforest is an undirected graph in which every connected component has at most one cycle. That is, it is a system of vertices and edges connecting pairs of…View analysis →
Probability density functionIn probability theory, a probability density function (PDF), density function, or simply density of an absolutely continuous random variable, is a function whose value at any…View analysis →
Graph minorIn graph theory, an undirected graph H is called a minor of the undirected graph G if H can be formed from G by deleting edges and vertices and by contracting edges.View analysis →
Rook's graphIn graph theory, a rook's graph is an undirected graph that represents all legal moves of the rook chess piece on a chessboard. Each vertex of a rook's graph represents a square…View analysis →
Functional equationIn mathematics, a functional equation is, in the broadest meaning, an equation in which one or several functions appear as unknowns. So, differential equations and integral…View analysis →
Probability spaceIn probability theory, a probability space or a probability triple ( Ω , F , P ) {\displaystyle (\Omega ,{\mathcal {F}},P)} is a mathematical construct that provides a formal…View analysis →
Interval graphIn graph theory, an interval graph is an undirected graph formed from a set of intervals on the real line, with a vertex for each interval and an edge between vertices whose…View analysis →
Bayesian statisticsBayesian statistics (/ˈbeɪziən/ BAY-zee-ən or /ˈbeɪʒən/ BAY-zhən) is a theory in the field of statistics based on the Bayesian interpretation of probability, where probability…View analysis →
Hypercube graphIn graph theory, the hypercube graph Q n {\displaystyle Q_{n}} is the edge graph of the n {\displaystyle n} -dimensional hypercube, that is, it is the graph formed from the…View analysis →
Statistical modelA statistical model is a mathematical model that embodies a set of statistical assumptions concerning the generation of sample data (and similar data from a larger population). A…View analysis →
Kneser graphIn graph theory, the Kneser graph K(n, k) (alternatively KGn,k) is the graph whose vertices correspond to the k-element subsets of a set of n elements, and where two vertices are…View analysis →
PolytreeIn mathematics, and more specifically in graph theory, a polytree (also called directed tree, oriented tree or singly connected network) is a directed acyclic graph whose…View analysis →
Compound probability distributionIn probability and statistics, a compound probability distribution (also known as a mixture distribution or contagious distribution) is the probability distribution that results…View analysis →
Clebsch graphIn the mathematical field of graph theory, the Clebsch graph is either of two complementary graphs on 16 vertices, a 5-regular graph with 40 edges and a 10-regular graph with 80…View analysis →
Moore graphIn graph theory, a Moore graph is a regular graph whose girth (the shortest cycle length) is more than twice its diameter (the distance between the farthest two vertices). If the…View analysis →
Tree (graph theory)In graph theory, a tree is an undirected graph in which every pair of distinct vertices is connected by exactly one path, or equivalently, a connected acyclic undirected graph. A…View analysis →
Gray graphIn the mathematical field of graph theory, the Gray graph is an undirected bipartite graph with 54 vertices and 81 edges. It is a cubic graph: every vertex touches exactly three…View analysis →
Circulant graphIn graph theory, a circulant graph is an undirected graph acted on by a cyclic group of symmetries which takes any vertex to any other vertex. It is sometimes called a cyclic…View analysis →
Cop-win graphIn graph theory, a cop-win graph is an undirected graph on which the pursuer (cop) can always win a pursuit–evasion game against a robber, with the players taking alternating…View analysis →
Polyhedral graphIn geometric graph theory, a branch of mathematics, a polyhedral graph is the undirected graph formed from the vertices and edges of a convex polyhedron. Alternatively, in purely…View analysis →
SquaregraphIn graph theory, a branch of mathematics, a squaregraph is a type of undirected graph that can be drawn in the plane in such a way that every bounded face is a quadrilateral and…View analysis →
Bernoulli distributionIn probability theory and statistics, the Bernoulli distribution, named after Swiss mathematician Jacob Bernoulli, is the discrete probability distribution of a random variable…View analysis →
Separation of variablesIn mathematics, separation of variables (also known as the Fourier method) is any of several methods for solving ordinary and partial differential equations, in which algebra…View analysis →
Mixed graphIn graph theory, a mixed graph G = (V, E, A) is a graph consisting of a set of vertices V, a set of (undirected) edges E, and a set of directed edges (or arcs) A.View analysis →
Probability generating functionIn probability theory, the probability generating function of a discrete random variable is a power series representation (the generating function) of the probability mass…View analysis →
Circle graphIn graph theory, a circle graph is the intersection graph of a chord diagram. That is, it is an undirected graph whose vertices can be associated with a finite system of chords…View analysis →
Graph isomorphismIn graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and HView analysis →
Moment generating functionIn probability theory and statistics, the moment generating function of a real-valued random variable is a generating function that provides an alternative specification of the…View analysis →
Prism graphIn the mathematical field of graph theory, a prism graph is a graph that has one of the prisms as its skeleton.View analysis →
Comparability graphIn graph theory and order theory, a comparability graph is an undirected graph that connects pairs of elements that are comparable to each other in a partial order. Comparability…View analysis →
Statistical distanceIn statistics, probability theory, and information theory, a statistical distance quantifies the distance between two statistical objects, which can be two random variables, or…View analysis →
Triangle-free graphIn the mathematical area of graph theory, a triangle-free graph is an undirected graph in which no three vertices form a triangle of edges. Triangle-free graphs may be…View analysis →