Certain statistical problems on graphs (Q2266318): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Radim Jiroušek / rank | |||
Property / reviewed by | |||
Property / reviewed by: Radim Jiroušek / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3262608 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5538132 / rank | |||
Normal rank |
Latest revision as of 17:10, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Certain statistical problems on graphs |
scientific article |
Statements
Certain statistical problems on graphs (English)
0 references
1984
0 references
The problem of existence of consistent tests, solved in this paper, has arisen, as the author says, in connection with problems of cluster analysis when statistical methods are used to establish significance of the selected clusters. There are considered two hypotheses \(H_ 0\) and \(H_ k\) defined as follows. Let \(G_ n\) be the class of all graphs with n vertices \(X_ n=(x_ 1,...,x_ n)\). For all \(A\subseteq X_ n\) a special, in a certain sense independent, probability measure \(P_ A\) on \(G_ n\) is defined such that \(P_ A(G=(X_ n,E))\) depends only on a number of edges from E which are incidental to elements of A. Testing the null hypothesis \(H_ 0: A=\emptyset\) against the alternative \(H_ k:| A| =k\) is considered. There are three theorems proven in the paper specifying sufficient conditions for situations when corresponding consistent tests do or do not exist.
0 references
cluster analysis
0 references
nonformal clusters
0 references
proximity graphs
0 references
existence of consistent tests
0 references