ScholarGate
アシスタント

手法を比較

選択した手法を並べて確認できます。異なる行はハイライト表示されます。

Triad Census×Structural Balance Theory×
分野SociologySociology
系統Process / pipelineProcess / pipeline
提唱年19701946 (Heider); 1956 (Cartwright & Harary)
提唱者Paul Holland & Samuel LeinhardtFritz Heider; formalized by Dorwin Cartwright & Frank Harary
種類Enumeration of the 16 isomorphism classes of directed triadsTheory and graph-theoretic test for tension in signed relationships
原典Holland, P. W., & Leinhardt, S. (1970). A method for detecting structure in sociometric data. American Journal of Sociology, 76(3), 492–513. DOI ↗Cartwright, D., & Harary, F. (1956). Structural balance: a generalization of Heider's theory. Psychological Review, 63(5), 277–293. DOI ↗
別名triad count, triadic census, 16-type triad census, MAN triad censusbalance theory, Heider balance, signed network balance, structural balance analysis
関連45
概要The triad census counts how many of a directed network's three-actor subgroups fall into each of the 16 possible types of triad, providing a compact fingerprint of the network's local structure. Introduced by Paul Holland and Samuel Leinhardt in 1970, it is the standard way to test structural theories — balance, clustering, transitivity, ranked clusters — by comparing the observed distribution of triad types against what a random network would produce.Structural balance theory analyzes networks whose ties carry a sign — positive for liking, alliance, or trust, negative for hostility or distrust — and asks which configurations are psychologically and socially stable. Originating in Fritz Heider's cognitive balance principle and given a graph-theoretic form by Dorwin Cartwright and Frank Harary in 1956, it predicts that signed networks evolve toward states free of the tension produced by inconsistent triads such as 'the friend of my enemy'.
ScholarGateデータセット
  1. v1
  2. 2 出典
  3. PUBLISHED
  1. v1
  2. 2 出典
  3. PUBLISHED

検索へ スライドをダウンロード

ScholarGate手法を比較: Triad Census · Structural Balance Theory. 2026-06-24に以下より取得 https://scholargate.app/ja/compare