generalized blockmodeling of binary networks

{{Context|date=September 2021}}

Generalized blockmodeling of binary networks (also relational blockmodeling) is an approach of generalized blockmodeling, analysing the binary network(s).{{cite journal |last1=Žiberna |first1=Aleš |date=2007 |title=Generalized Blockmodeling of Valued Networks |url= https://repozitorij.uni-lj.si/IzpisGradiva.php?id=33172|journal=Social Networks |volume= 29|issue= |pages= 105–126|doi=10.1016/j.socnet.2006.04.002|s2cid=17739746 |arxiv=1312.0646 }}

As most network analyses deal with binary networks, this approach is also considered as the fundamental approach of blockmodeling.{{Cite book |last1=Doreian |first1=Patrick |last2=Batagelj |first2=Vladimir |last3=Ferligoj |first3=Anuška |title=Generalized Blackmodeling |publisher=Cambridge University Press |date=2005 |isbn=0-521-84085-6}}{{rp|11}} This is especially noted, as the set of ideal blocks, when used for interpretation of blockmodels, have binary link patterns, which precludes them to be compared with valued empirical blocks.{{cite journal |last1=Nordlund |first1=Carl |date=2016 |title=A deviational approach to blockmodeling of valued networks |url= |journal=Social Networks |volume=44 |issue= |pages=160–178 |doi=10.1016/j.socnet.2015.08.004}}

When analysing the binary networks, the criterion function is measuring block inconsistencies, while also reporting the possible errors. The ideal block in binary blockmodeling has only three types of conditions: "a certain cell must be (at least) 1, a certain cell must be 0 and the $f$ over each row (or column) must be at least 1".

It is also used as a basis for developing the generalized blockmodeling of valued networks.