High Quality Content by WIKIPEDIA articles! Structural cohesion is the sociological conception of cohesion in social groups. It is defined as the minimal number of actors in a social network that need to be removed to disconnect at least two actors in the remaining group. It is thus identical to the question of the node connectivity of a given graph. The solution to the boundary problem for structural cohesion, i.e., the question whether there is a single actor that acts as a bridge between two groups, is thus found by the vertex-cut version of Menger's theorem. The boundaries of structural endogamy are a special case of structural cohesion. It is also useful to know that k-cohesive graphs (or k-components) are always a subgraph of a k-core, although a k-core is not always k-cohesive. A k-core is simply a subgraph in which all nodes have at least k neighbors but it need not even be connected. Данное издание представляет собой компиляцию сведений, находящихся в свободном доступе в...

В наличии:
	Sprinter - 1008 руб.	Перейти		Лучшая цена
	Books.Ru - 1128 руб.	Перейти
Под заказ:
	OZON.ru - 1125 руб.	Перейти

Рейтинг книги: 5 из 5, 2 голос(-ов).