In this paper we propose a new notion of a clique reliability. The clique reliability is understood as the ratio of the number of statistically significant links in a clique to the number of edges of the clique. This notion relies on a recently proposed original technique for separating inferences about pairwise connections between vertices of a network into significant and admissible ones. In this paper, we propose an extension of this technique to the problem of clique detection. We propose a method of step-by-step construction of a clique with a given reliability. The results of constructing cliques with a given reliability using data on the returns of stocks included in the Dow Jones index are presented.

在本文中，我们提出了团可靠性的新概念。团可靠性被理解为团中统计上显着的链接的数量与团的边的数量的比率。这个概念依赖于最近提出的一项原始技术，用于将网络顶点之间的成对连接的推论分离为重要的和可接受的推论。在本文中，我们提出将该技术扩展到派系检测问题。我们提出了一种逐步构建具有给定可靠性的派系的方法。给出了使用道琼斯指数中包含的股票收益数据构建具有给定可靠性的派系的结果。