Direct blockmodeling of valued and binary networks: a dichotomization-free approach

A long-standing open problem with direct blockmodeling is that it is explicitly intended for binary, not valued, networks. The underlying dilemma is how empirical valued blocks can be compared with ideal binary blocks, an intrinsic problem in the direct approach where partitions are solely determined through such comparisons. Addressing this dilemma, valued networks have either been dichotomized into binary versions, or novel types of ideal valued blocks have been introduced. Both these workarounds are problematic in terms of interpretability, unwanted data reduction, and the often arbitrary setting of model parameters.This paper proposes a direct blockmodeling approach that effectively bypasses the dilemma with blockmodeling of valued networks. By introducing an adaptive weighted correlation-based criteria function, the proposed approach is directly applicable to both binary and valued networks, without any form of dichotomization or transformation of the valued (or binary) data at any point in the analysis, while still using the conventional set of ideal binary blocks from structural, regular and generalized blockmodeling.The proposed approach seemingly solves two other open problems with direct blockmodeling. First, its standardized goodness-of-fit measure allows for direct comparisons across solutions, within and between networks of different sizes, value types, and notions of equivalence. Secondly, through an inherent bias of point-biserial correlations, the approach puts a premium on solutions that are closer to the mid-point density of blockmodels. This, it is argued, translates into solutions that are more intuitive and easier to interpret.The approach is demonstrated by structural, regular and generalized blockmodeling applications of six classical binary and valued networks. Finding feasible and intuitive optimal solutions in both the binary and valued examples, the approach is proposed not only as a practical, dichotomization-free heuristic for blockmodeling of valued networks but also, through its additional benefits, as an alternative to the conventional direct approach to blockmodeling.     

A deviational approach to blockmodeling of valued networks

This article proposes a novel approach to blockmodeling of valued (one-mode) networks where the identification of (binary) block patterns in the valued relations differ from existing approaches. Rather than looking at the absolute values of relations, or examining valued ties on a per-actor basis (cf. Nordlund, 2007), the approach identifies prominent (binary) ties on the basis of deviations from expected values. By comparing the distribution of each actor's valued relations to its alters with the macro-level distributions of total in- and outdegrees, prominent (1) and non-prominent (0) ties are determined both on a per-actor-to-actor and a per-actor-from-actor basis. This allows for a direct interpretation of the underlying functional anatomy of a non-dichotomized valued network using the standard set of ideal blocks as found in generalized blockmodeling of binary networks.In addition to its applicability for direct blockmodeling, the article also suggests a novel indirect measure of deviational structural equivalence on the basis of such deviations from expected values.Exemplified with the note-sharing data in Žiberna (2007a), citations among social work journals (Baker, 1992), and total commodity trade among EU/EFTA countries as of 2010, both the direct and indirect approach produce results that are more sensitive to variations at the dyadic level than existing approaches. This is particularly evident in the case of the EU/EFTA trade network, where the indirect approach yields partitions and blockmodels in support of theories of regional trade, despite the significantly skewed valued degree distribution of the dataset.     

Generalized blockmodeling of valued networks

The paper presents several approaches to generalized blockmodeling of valued networks, where values of the ties are assumed to be measured on at least interval scale. The first approach is a straightforward generalization of the generalized blockmodeling of binary networks [Doreian, P., Batagelj, V., Ferligoj, A., 2005. Generalized Blockmodeling. Cambridge University Press, New York.] to valued blockmodeling. The second approach is homogeneity blockmodeling. The basic idea of homogeneity blockmodeling is that the inconsistency of an empirical block with its ideal block can be measured by within block variability of appropriate values. New ideal blocks appropriate for blockmodeling of valued networks are presented together with definitions of their block inconsistencies.     

A multiple indicator approach to blockmodeling signed networks

Regardless of whether the focus is on algebraic structures, elaborating role structures or the simple delineation of concrete social structures, generalized blockmodeling faces a pair of vulnerabilities. One is sensitivity to poor quality of the relational data and the other is a risk of over fitting blockmodels to the details of specific networks. Over fitting blockmodels can lead to multiple equally well fitting partitions where choices cannot be made between them on a principled basis. This paper presents a method of tackling these problems by viewing (when possible) observed social relations as multiple indicators of an underlying affect dimension. Quadratic assignment methods using matching coefficients, product moment correlations and Goodman and Kruskal's gamma are used to assess the appropriateness of using the sum of observed relations as input for applying generalized blockmodeling. Data for four groups are used to show the value of this approach within which multiple equally well fitting blockmodels for single relations are replaced by unique (or near-unique) partitions of the summed data. This strategy is located also within a broader problem of blockmodeling three-dimensional networks data and suggestions are made for future work.     

A goodness-of-fit index for blockmodels

The ‘fit’ between blockmodels and data networks is extended from a binary to a continuous concept. An index of goodness-of-fit for α-fit blockmodels is proposed, based on the purity (density of 1's or 0's) of the submatrices of the data matrix(es) after the blockmodel partition is imposed. The characteristics of this index are compared with those of correlation coefficient. Some applications are described.     

Notes on blockmodeling

We attempt to develop further the blockmodeling of networks, so as better to capture the network structure. For this purpose a richer structure than ordinary (valued) graphs has to be used for a model. Such structures are valued graphs with typified (complete, dominant, regular, etc.) connections. Based on the proposed formalization, the blockmodeling is cast as an optimization problem.     

A new criterion function for exploratory blockmodeling for structural and regular equivalence

We present a new criterion function for blockmodeling two-way two-mode relation matrices when the number of blocks as well as the equivalence relation are unknown. For this, we specify a measure of fit based on data compression theory, which allows for the comparison of blockmodels of different sizes and block types from different equivalence relations. We arm an alternating optimization algorithm with this criterion and demonstrate that the method reproduces consensual blockings of three datasets without any pre-specification. We perform a simulation study where we compare our compression-based criterion to the commonly used criterion that measures the number of inconsistencies with an ideal blockmodel.     

Analysing networks of networks

We consider data with multiple observations or reports on a network in the case when these networks themselves are connected through some form of network ties. We could take the example of a cognitive social structure where there is another type of tie connecting the actors that provide the reports; or the study of interpersonal spillover effects from one cultural domain to another facilitated by the social ties. Another example is when the individual semantic structures are represented as semantic networks of a group of actors and connected through these actors’ social ties to constitute knowledge of a social group. How to jointly represent the two types of networks is not trivial as the layers and not the nodes of the layers of the reported networks are coupled through a network on the reports. We propose to transform the different multiple networks using line graphs, where actors are affiliated with ties represented as nodes, and represent the totality of the different types of ties as a multilevel network. This affords studying the associations between the social network and the reports as well as the alignment of the reports to a criterion graph. We illustrate how the procedure can be applied to studying the social construction of knowledge in local flood management groups. Here we use multilevel exponential random graph models but the representation also lends itself to stochastic actor-oriented models, multilevel blockmodels, and any model capable of handling multilevel networks.     

Connectedness in a general model for valued networks

Social networks have been closely identified with graph theoretical models, which constitute their most familiar mode of representation. There are a number of such models which may embody symmetric, directed, or valued relationships. But the study of networks with valued linkages, using the natural formalization provided by the valued graph or digraph, has been impeded by a traditional lack of analytical machinery for dealing with valued structures. In this paper, we demonstrate the development and elaboration of formalizations for the central network concepts of reachability, joining, and connectedness through graph theoretical models of increasing complexity, culminating in their expression within a general model for valued structures. This model for valued (symmetric or directed) graphs, or vigraphs, provides a unified representation and matrix methodology for dealing with qualitative and quantitative structures, incorporates many existing methods as special cases, and suggests new applications. Some of the most interesting of these follow the recognition, consistent with the model, that the “values” assigned to network linkages may be sorts of entities other than numbers.     

Actor non-response in valued social networks: The impact of different non-response treatments on the stability of blockmodels

Social network data usually contain different types of errors. One of them is missing data due to actor non-response. This can seriously jeopardize the results of analyses if not appropriately treated. The impact of missing data may be more severe in valued networks where not only the presence of a tie is recorded, but also its magnitude or strength. Blockmodeling is a technique for delineating network structure. We focus on an indirect approach suitable for valued networks. Little is known about the sensitivity of valued networks to different types of measurement errors. As it is reasonable to expect that blockmodeling, with its positional outcomes, could be vulnerable to the presence of non-respondents, such errors require treatment. We examine the impacts of seven actor non-response treatments on the positions obtained when indirect blockmodeling is used. The start point for our simulation are networks whose structure is known. Three structures were considered: cohesive subgroups, core-periphery, and hierarchy. The results show that the number of non-respondents, the type of underlying blockmodel structure, and the employed treatment all have an impact on the determined partitions of actors in complex ways. Recommendations for best practices are provided.     

Detecting measurement bias in respondent reports of personal networks

Inaccuracy of sociometric reports poses a serious challenge to social network analysis. Nevertheless, researchers continue to draw potentially misleading conclusions from flawed data. We consider two particular types of systematic error in measurement of network size: individuals over/underreporting others (expansiveness bias), and individuals being over/underreported by others (attractiveness bias). We examine evidence of individual variation in these biases in one apparently typical sociometric dataset. We specifically suggest that variation in expansiveness bias may commonly distort findings concerning characteristics of individual networks (e.g. size, range, density), and properties of whole networks (e.g. inequality, transitivity, clustering, and blockmodels). We suggest methodological improvements and urge further research.     

Parameter estimation procedures for exponential-family random graph models on count-valued networks: A comparative simulation study

The exponential-family random graph models (ERGMs) have emerged as an important framework for modeling social networks for a wide variety of relational types. ERGMs for valued networks are less well-developed than their unvalued counterparts, and pose particular computational challenges. Network data with edge values on the non-negative integers (count-valued networks) is an important such case, with examples ranging from the magnitude of migration and trade flows between places to the frequency of interactions and encounters between individuals. Here, we propose an efficient parallelizable subsampled maximum pseudo-likelihood estimation (MPLE) scheme for count-valued ERGMs, and compare its performance with existing Contrastive Divergence (CD) and Monte Carlo Maximum Likelihood Estimation (MCMLE) approaches via a simulation study based on migration flow networks in two U.S. states. Our results suggest that edge value variance is a key factor in method performance, while network size mainly influences their relative merits in computational time. For small-variance networks, all methods perform well in point estimations while CD greatly overestimates uncertainties, and MPLE underestimates them for dependence terms; all methods have fast estimation for small networks, but CD and subsampled multi-core MPLE provides speed advantages as network size increases. For large-variance networks, both MPLE and MCMLE offer high-quality estimates of coefficients and their uncertainty, but MPLE is significantly faster than MCMLE; MPLE is also a better seeding method for MCMLE than CD, as the latter makes MCMLE more prone to convergence failure. The study suggests that MCMLE and MPLE should be the default approach to estimate ERGMs for small-variance and large-variance valued networks, respectively. We also offer further suggestions regarding choice of computational method for valued ERGMs based on data structure, available computational resources and analytical goals.     

Social context,spatial structure and social network structure

Frequently, social networks are studied in their own right with analyses devoid of contextual details. Yet contextual features – both social and spatial – can have impacts on the networks formed within them. This idea is explored with five empirical networks representing different contexts and the use of distinct modeling strategies. These strategies include network visualizations, QAP regression, exponential random graph models, blockmodeling and a combination of blockmodels with exponential random graph models within a single framework. We start with two empirical examples of networks inside organizations. The familiar Bank Wiring Room data show that the social organization (social context) and spatial arrangement of the room help account for the social relations formed there. The second example comes from a police academy where two designed arrangements, one social and one spatial, powerfully determine the relational social structures formed by recruits. The next example is an inter-organizational network that emerged as part of a response to a natural disaster where features of the improvised context helped account for the relations that formed between organizations participating in the search and rescue mission. We then consider an anthropological example of signed relations among sub-tribes in the New Guinea highlands where the physical geography is fixed. This is followed by a trading network off the Dalmatian coast where geography and physical conditions matter. Through these examples, we show that context matters by shaping the structure of networks that form and that a variety of network analytic tools can be mobilized to reveal how networks are shaped, in part, by social and spatial contexts. Implications for studying social networks are suggested.     

Conditionally exponential random models for individual properties and network structures: Method and application

Exponential random models have been widely adopted as a general probabilistic framework for complex networks and recently extended to embrace broader statistical settings such as dynamic networks, valued networks or two-mode networks. Our aim is to provide a further step into the generalization of this class of models by considering sample spaces which involve both families of networks and nodal properties verifying combinatorial constraints. We propose a class of probabilistic models for the joint distribution of nodal properties (demographic and behavioral characteristics) and network structures (friendship and professional partnership). It results in a general and flexible modeling framework to account for homophily in social structures. We present a Bayesian estimation method based on the full characterization of their sample spaces by systems of linear constraints. This provides an exact simulation scheme to sample from the likelihood, based on linear programming techniques. After a detailed analysis of the proposed statistical methodology, we illustrate our approach with an empirical analysis of co-authorship of journal articles in the field of neuroscience between 2009 and 2013.     

Predictability of social connections over time

A developed theory of social networks would potentially provide predictive and explanatory models for social processes at the most general level. The paper contributes to such a theory by elaborating one basic proposition: that social connections attract each other as a regular function of network parameters such as ‘structural strength’ (number of common links) and ‘distance’ (length of minimal path of linkage). The proposition is tested on longitudinal data from three locality-based networks.     

Exponential Family Models for sampled and census Network data

Much progress has been made on the development of statistical methods for network analysis in the past ten years, building on the general class of exponential family random graph (ERG) network models first introduced by Holland and Leinhardt (1981) . Recent examples include models for Markov graphs, "p*" models, and actor‐oriented models. For empirical application, these ERG models take a logistic form, and require the equivalent of a network census: data on all dyads within the network. In a largely separate stream of research, conditional log‐linear (CLL) models have been adapted for analyzing locally sampled ("egocentric") network data. While the general relation between log‐linear and logistic models is well known and has been exploited in the case of a priori blockmodels for networks, the relation for the CLL models is different due to the treatment of absent ties. For fully saturated tie independence models, CLL and ERG are equivalent and related via Bayes' rule. For other tie independence models, the two do not yield equivalent predicted values, but we show that in practice the differences are unlikely to be large. The alternate conditioning in the two models sheds light on the relationship between local and complete network data, and the role that models can play in bridging the gap between them.     

Cluster analysis of multiplex networks: Defining composite network measures

Social relations are multiplex by nature: actors in a group are tied together by various types of relationships. To understand and explain group processes it is, therefore, important to study multiple social networks simultaneously in a given group. However, with multiplexity the complexity of data also increases. Although some multivariate network methods (e.g. Exponential Random Graph Models, Stochastic Actor-oriented Models) allow to jointly analyze multiple networks, modeling becomes complicated when it focuses on more than a few (2–4) network dimensions. In such cases, dimension reduction methods are called for to obtain a manageable set of variables. Drawing on existing statistical methods and measures, we propose a procedure to reduce the dimensions of multiplex network data measured in multiple groups. We achieve this by clustering the networks using their pairwise similarities, and constructing composite network measures as combinations of the networks in each resulting cluster. The procedure is demonstrated on a dataset of 21 interpersonal network dimensions in 18 Hungarian high-school classrooms. The results indicate that the network items organize into three well-interpretable clusters: positive, negative, and social role attributions. We show that the composite networks defined on these three relationship groups overlap but do not fully coincide with the network measures most often used in adolescent research, such as friendship and dislike.     

Model Fit in Structural Equation Models with Censored, Ordinal, and Dichotomous Variables: Testing Vanishing Tetrads

Although the methodology for handling ordinal and dichotomous observed variables in structural equation models (SEMs) is developing rapidly, several important issues are unresolved. One of these is the optimal test statistic to apply as a test of overall model fit. We propose a new "vanishing tetrad" test statistic for such models. We build on Bollen's (1990) simultaneous test statistic for testing multiple vanishing tetrads and on Bollen and Ting's (1993) confirmatory tetrad analysis (CTA) for hypothesis testing of model structures. These and other works on vanishing tetrads assume continuous observed variables and do not consider observed categorical variables. In this paper we present a method to test models when some or all of the observed variables are collapsed or categorical versions of underlying continuous variables. The test statistic that we provide is an alternative "overall fit" statistic for SEMs with censored, ordinal, or dichotomous observed variables. Furthermore, the vanishing tetrad test sometimes permits us to compare the fit of some models that are not nested in the traditional likelihood ratio test. We illustrate the new test statistic with examples and a small simulation experiment comparing it with two other tests of model fit for SEMs with ordinal or dichotomous endogenous variables.     

Networks containing negative ties

Social network analysts have often collected data on negative relations such as dislike, avoidance, and conflict. Most often, the ties are analyzed in such a way that the fact that they are negative is of no consequence. For example, they have often been used in blockmodeling analyses where many different kinds of ties are used together and all ties are treated the same, regardless of meaning. However, sometimes we may wish to apply other network analysis concepts, such as centrality or cohesive subgroups. The question arises whether all extant techniques are applicable to negative tie data. In this paper, we consider in a systematic way which standard techniques are applicable to negative ties and what changes in interpretation have to be made because of the nature of the ties. We also introduce some new techniques specifically designed for negative ties. Finally we show how one of these techniques for centrality can be extended to networks with both positive and negative ties to give a new centrality measure (PN centrality) that is applicable to directed valued data with both positive and negative ties.     

Staying inside: social withdrawal of the young,Finnish ‘Hikikomori’

This article explores socially withdrawn young Finnish people on an Internet forum who identify with the Japanese hikikomori phenomenon. We aim to overcome the dualism between sociology and psychology found in earlier research by referring to Pierre Bourdieu, who provides insights into how individual choices are constructed in accordance with wider social settings. We focus on the individual level and everyday choices, but we suggest that psychological factors (anxiety, depression) can be seen as properties of social relations rather than as individual states of mind, as young adults have unequal access to valued resources. We scrutinise young people’s specific reasoning related to the social and psychological factors and contingent life events that influence their choice to withdraw. An experience of inadequacy, a feeling of failure and a lack of self-efficacy are common experiences in the data. This indicates that young adults who identify with the hikikomori phenomenon find external society demanding and consider themselves lacking resources such as education, social networks or the personality type that they see as valued in society and as essential to ‘survival’. They also feel that they cannot control their life events, which may mean that they receive little help in their everyday lives.