Inference and influence of network structure using snapshot social behavior without network data - Science Advances

INTRODUCTION

Human behavior, from voting preferences to vaccine sentiments, can depend on the structure of social networks (1). While we have huge, high-quality, social-scientific datasets linking the behavior of individuals to their individual circumstances [from censuses (2) through health surveys (3) to, in fine spatial aggregate, voting outcomes], it is extremely costly, or even impossible, to have direct access to the social networks on which this behavior is articulated. Here, we do not seek to infer individual links with high accuracy but instead seek a behavior-specific network model that is informative of social network structure and is policy relevant. The need to understand social network structure and how it shapes behavior appears acute: There are concerns about both the role of social networks in health from vaccine refusal to obesity (4–6), and the recurring notion that our societies are becoming excessively polarized (7). By accessing social structure and the behavioral dynamics it supports, we could also improve our perturbative understanding: clarifying how changes in social inequalities might change health and social polarization (3).

Given the need to characterize social network structure, it follows that there has been immense scientific excitement about data from large networking platforms from Twitter to mobile phones (8, 9). It is, however, widely acknowledged that technology platform data have numerous practical issues. A leading concern is whether technology-dependent network datasets give a true indication of the social structure on which society-relevant behaviors, like smoking or voting, depend; it is likely, instead, that different behaviors are spread on different aspects of our social networks (10). Technology-dependent network datasets are commercially sensitive and so are hard to access and share, and are often available for limited time spans or spatial extents, and specific platforms themselves are unlikely to exist indefinitely: This creates concerns for reproducibility and generalizability. The most substantial issue, however, which must limit all such efforts in the future, is the immense privacy implication of large-scale social network data: Social network data are hard to anonymize (11, 12). An alternative route to using data from technology platforms is to use conventional surveys. Beyond issues with scalability, it is often a challenge to identify from surveys whether the inferred network structure relates to the true network on which a particular behavior is articulated (13–15). A third established route is to attempt to infer network models through, e.g., time-series data (16–19). These approaches typically assume repeated observations of individual-level data; unfortunately, human behavior, such as voting or smoking, is often sampled at a single point in time.

While it might thus seem challenging to access behavior-specific social structure, there is one distinctive feature of social data that assists inference: Unlike many networked systems, censuses provide socially relevant coordinate information for individual nodes. Peter Blau postulated an intuitive and powerful theory for social structure such that each individual in a society can be considered as being a point in a high-dimensional space (with dimensions like age, gender, and income) where the rates of connection between individuals are driven by homophily and depend on their relative separation in the space (20–22). This homophily suggests that we can consider individuals to form links conditional on their separation in social space. Typically, these networks are modeled by a soft random geometric graph (SRGG), wherein the probability of a link between two individuals decays with the distance between them (23) [in contrast to random geometric graphs (RGGs), where connections are deterministic: two nodes are connected if the distance between them is within a given threshold]. Beyond information about the coordinates of individuals, health and voting datasets give us snapshot information about the behavior of individuals. There is well-developed theory to capture discrete choices (24), which, in turn, has links to finite-temperature linear threshold models of influence (25, 26) and Ising models (27–29). This paper exploits a merger between Blau’s geometric view of social structure and Ising models of behavior to infer kernels for SRGG models of social structure; we name this a kernel-Blau-Ising (KBI) model.

Our model allows behavior to depend on both social circumstances and the behavior of neighbors in a network. We illustrate this conceptualization in Fig. 1. It takes as input a set of individuals in a social space and invokes both an Ising model for behavior and a simple (SRGG) model for how distances in a social space affect the chance of connections. The simplicity of our model means we can use it to infer network parameter values for simulated data, which carries no network information but only a snapshot of system behavioral state and coordinate information. We illustrate our results for the European Union (EU) referendum and two London mayoral elections (MEs), using only census data and voting outcomes, where we infer network parameter values consistent with the literature and we are able to train on a subset of voting data and make accurate predictions on hold-out data. Last, our model allows us to quantify, model-dependently, the potentially depolarizing effects of shifts in social connectivity preferences (e.g., eliminating income or age homophily) and social coordinates (e.g., reducing income inequality).

Fig. 1 Outline of the KBI methodology.

Input data consist of aggregated behavioral data for different geographical areas and sociodemographic variables (age, income, education, etc.) associated to those areas (from census data). (A) Heatmap of (hypothetical) behavioral data in Greater London, in this case electoral outcomes, where red represents 100% votes to Labour and blue represents 100% votes to Conservatives. (B) Probability distribution of behavioral outcomes in (A). (C) Blau space representation of the behavioral outcomes spanned by sociodemographic characteristics (e.g., age and income). (D) Blau space representation of KBI approach using input data in (1) and learning parameters: the EFs, which account for the general trends, e.g., older people are more likely to vote Conservatives than younger people, and the network that connects the population according to their distances in the Blau space and their homophilic preferences. Once the model parameters are learnt, we can further estimate how changes and interventions affect behavioral outcomes. Examples of potential network-sensitive intervention strategies: how changes to income distribution (E) and homophilic preferences (F) can reduce behavioral polarization.

MATERIALS AND METHODS

An interpretable generative model for both population behavior and social network structure in Blau space

We deploy a generative model for population behavior where the behavior of individuals is partly determined by their social coordinates (as would be standard in logistic regression from survey data, e.g., regressing vaccine refusal on age and income) and partly determined by the behavior of their neighbors on a network as would be standard in socio-physics models (28, 30). Regarding the network, we also deploy a generative model for social structure, where the chance that nodes have a connection depends on their proximity in social space. In our model, we represent individuals’ binary social outcomes as binary spins (for example, voting Conservative/Labour or being smoker/nonsmoker), but it is possible to extend the model to a discrete set of possible outcomes by using a Potts instead of an Ising model (see text S2 for details). Throughout the manuscript, we use the terms individual social outcomes and spins interchangeably. We use an Ising-like model (or binary Markov random field) to model population social outcomes, but instead of locating spins representing individual outcomes in a regular grid, in our approach spins will be embedded in a multidimensional Blau space (where dimensions are sociodemographic variables and geographical coordinates) and social links between individuals occur with a probability depending on their separation in the Blau space. While our methods are phrased in terms of individuals, social connections, and Blau space, they apply to wider settings with Ising dynamics on unobserved RGGs in the presence of spatially embedded applied fields, given information about vertex location and vertex spin state.

Network model. We have N individuals each embedded in a K-dimensional Blau space, where vector z_i ∈ ℝ^K encodes the ith individual’s coordinates in the Blau space representing her age, income, residential coordinates, etc. (see Fig. 2A showing random coordinates of spins in a two-dimensional Blau space). The heterogeneity comes from population distribution in the Blau space, that is, it depends on social segregation in the Blau space. We connect individuals through an SRGG (23) according to a connectivity kernel function, which depends on distances in the Blau space and the kernel parameters (see Fig. 2B for an example of an SRGG). This model makes it easy to simulate realistic networks with clustering (31), although it does not explicitly build in other real social network properties such as heavy-tailed degree distributions. Nonetheless, it is a well-established model for generating social networks that provides interpretable results (31–33). The larger class of conditionally independent link models, e.g., graphons/stochastic block models, could be substituted for the SRGG.

Fig. 2 Generative process for spin configurations balances social/spatial fields and network effects.

(A) Coordinates of spins in a two-dimensional Blau space (e.g., x, y is age versus income). In (B), we show a realization of an SRGG from the connectivity kernel parameters θ_x = θ_y = 10 (θ₀ = 0). (C) Spin configuration for a linear EF in the y axis and low thermal noise (β = 100), where the spins are aligned with the local EFs. Last, in (D), we show the spin configuration under the same EFs as in (C), also with low thermal noise (β = 100), but now the spins are connected according to the SRGG in (B). We see how spins that in (C) aligned with the EFs have now changed their orientation to align more with their neighbors.

We coded connections between individuals in an adjacency matrix, where A_ij = 1 if i and j are connected and 0 otherwise, with A_ij Bernoulli distributed with a connectivity kernel ρ$$P(A_{\mathit{ij}}=1\mid {\mathbf{z}}_{\mathbf{i}},{\mathbf{z}}_{\mathbf{j}},\mathrm{\theta })=\mathrm{\rho }(z_{\mathit{i}},z_{\mathit{j}},\mathrm{\theta })$$(1)

We choose our connectivity kernel to be a logistic sigmoid function, as they have been successfully used for the inference of connectivity kernels on ego networks (15) and in latent space inference (31–33)$$\mathrm{\rho }(z_i,z_j,\mathrm{\theta })=\frac{1}{1+\text{exp}(d_{\mathit{ij}})};d_{\mathit{ij}}={\mathrm{\theta }}_0+\sum _{k=1}^K{\mathrm{\theta }}_k\mid z_{\mathit{ik}}-z_{\mathit{jk}}\mid$$(2)where d_ij is interpreted as the distance in the Blau space, θ₀ is a bias term that accounts for the overall connectivity density regardless of the distances in the Blau space, and θ_k is the connectivity coefficient of Blau dimension k, which weights the contribution of distances in the k dimension to the overall distance. The connectivity coefficients [θ_k, k = (1, …, K)] measure homophily in the Blau space so that the larger θ_k becomes, the stronger the homophily in that dimension (connections becoming more localized in that dimension). The constant bias term θ₀ allows rescaling of system size, because it accounts for density changes without modifying values of the connectivity kernel parameters (see text S3). The connectivity kernels induce an interpretable semimetric for connections on the Blau space (15) and can be used to generate particular realizations of SRGGs.

Behavioral model. Our Ising model is to generate spin configurations as follows. Each individual i embedded in the Blau space (with coordinates z_i) is represented by a spin σ_i = [ −1,1] encoding her binary social outcome so that the population spin configuration is σ ∈ [ −1,1]^N. The spin orientation depends on the external fields (EFs) and the other spins they are connected to in the network. As is common for conventional social statistics (logistic regression with linear dependence on the covariates), we model the EFs as linear fields in each dimension of the Blau space, where the linear coefficient in each dimension of the Blau space k is h_k so that the individual spin interaction with the EFs is the scalar product h · z_i = ∑_kh_kz_ik. The spins interact with the EFs depending only on their coordinates so that they tend to align with the EFs (see Fig. 2C).

The energy of a spin configuration σ is given by the Hamiltonian function$$H(\mathbf{\sigma },\mathbf{h},J,\mathbf{A})=-{\displaystyle \sum _i}({\displaystyle \sum _k}{h}_k{z}_{\mathit{ik}}){\mathrm{\sigma }}_i-J{\displaystyle \sum _{\mathit{ij}}}{A}_{\mathit{ij}}{\mathrm{\sigma }}_i{\mathrm{\sigma }}_j$$(3)where h_k is the EF linear coefficient in dimension k of the Blau space, J is the scale factor between spin-spin interactions and energy known as the connection strength, and A_ij is the adjacency matrix. Notice that the connectivity kernel parameter θ governs the adjacency matrix A such that the only contribution of the kernel parameters to the Hamiltonian is through A. Also, from the Hamiltonian, there is a coupling between the connection strength J and the bias term θ₀ in Eq. 2, which implies that, in some regimes, the same spin configurations can be generated by different combinations of these two factors; this is addressed below in the inference section. We can add a homogeneous field h₀, which is felt by the whole population regardless of their coordinates. However, in the cases we consider in the following, it is reasonable to set h₀ to zero. The configuration probability is given by the Boltzmann distribution with inverse temperature β = 1/T, β ≥ 0$$p(\mathbf{\sigma }\mid \mathrm{\beta },\mathbf{h},J,\mathbf{A})=\frac{e^{-\mathrm{\beta }H(\mathbf{\sigma },\mathbf{h},J,\mathbf{A})}}{Z(\mathrm{\beta },\mathit{h},J,\mathit{A})}$$(4)and the normalization constant$$Z(\mathrm{\beta },\mathbf{h},J,\mathbf{A})={\displaystyle \sum _{\mathbf{\sigma }\prime \in \mathrm{\Omega }}}{e}^{-\mathrm{\beta }H(\mathbf{\sigma }\prime ,\mathbf{h},J,\mathbf{A})}$$(5)is the partition function, where the sum is over all possible spin configurations, Ω, which for an Ising model are 2^N terms. The configuration probabilities p(σ∣β, h, J, A) represent the probability that, in equilibrium, the system is in a state with configuration σ. Figure 2D gives an example of a spin assignment that has been generated conditional on a particular network structure—in our case, an SRGG from a particular connectivity kernel. Vitally, the spins are not exclusively determined by either the EFs or network structure.

Inference method for model parameters

Given a record of a social outcome σ ∈ [ −1,1]^N together with the population Blau space coordinates z ∈ ℝ^{N × K}, our goal is to infer the model parameters Θ = [β, h, J, θ]. For the Ising model, the partition function Z cannot be computed even for small systems, because it requires the computation of 2^N terms. A further challenge is that Z itself depends on the model parameters and would need to be recomputed for each possible parameter set. In this case, the inference is called doubly intractable (34) and Markov chain Monte Carlo is challenging.

As an alternative likelihood-free method (that nonetheless avoids mean-field approximation), we use approximate Bayesian computation (ABC), which has been applied to a wide spectrum of problems with intractable likelihoods (35, 36). In Algorithm 1, we show our rejection-based ABC inference method for the model parameters. We suppose we have priors, π(Θ), on possible parameter values. On lines 4 and 5, the generation of a spin configuration requires two steps: (i) the generation of an SRGG from the connectivity kernel (Eq. 2), given the spin coordinates, and (ii) the generation of the spin configuration conditional on the graph generated in (i) and for the parameters of the Hamiltonian in Eq. 3.

We use Glauber dynamics to generate spin configurations σ′ for any combination of the model parameters Θ′ from Boltzmann distribution. To improve the efficiency of the ABC rejection algorithm, we define a set of lower-dimensional summary statistics. We summarize spins that share the same coordinates z by the fraction of spins down (or up) $S_z=\frac{1}{n_z}{\sum }_{i\mid z_i=z}\mathrm{\delta }({\mathrm{\sigma }}_i,-1)$, where n_z is the number of individual spins at coordinate z of Blau space. When there are C different Blau space coordinates populated with spins, the summary statistic would be such that S(σ) ∈ [0,1]^C (also denoted as S for simplicity of notation). For the method that we proposed to succeed, we require C ≪ N. Therefore, we approximate our posteriors by p(σ∣ {‖η[S(σ′), S(σ)]‖ < ϵ}), where η[S(σ′), S(σ)] measures the discrepancy between σ′ and σ after they are summarized with function S(σ′). We define the distance between S(σ) (summary statistics of the original social outcome data) and S(σ′) (observational data of the spin configuration generated from Θ′) as$$\mathrm{\eta }[\mathit{S}(\mathbf{\sigma }\prime ),\mathit{S}(\mathbf{\sigma })]=\frac{1}{N}{\displaystyle \sum _{z=1}^C}{n}_z\mid S_z-S_z^{\prime }\mid$$(6)where $\mid S_z-S_z^{\prime }\mid$ is the absolute difference between the fraction of spins down in the observed spin data and the generated spins so that the distance is zero only if S_z = S_z′ ∀z. The distance η(S′, S) can also be considered as a weighted mean absolute error (WMAE). Notably, our observational data itself will be aggregated in the form of fractions of spin-up in different small spatial regions (e.g., proportions of smokers or voters in different small spatial patches). Because we are precisely attempting to simulate our observational data, and given that all spins with the same coordinates are statistically indistinguishable (Eq. 3), vitally, S(σ) are sufficient statistics and the ABC posteriors tend to exact Bayesian posteriors in the limit of ϵ → 0. If, e.g., continuous microdata are available for all individuals, some binning would be required to take advantage of our ABC inference, with a corresponding effect on sufficiency. For some applications (as in our voting illustration), population size can be rescaled through rescaling the connectivity kernel bias term θ₀ in Eq. 2 (see text S3). Last, because the ABC approximate posteriors of the model parameters are obtained through independent samples, it is straightforward to parallelize the algorithm so that the samples are obtained concurrently. For a more efficient sampling procedure, sequential sampling schemes for ABC can also be used (37).

RESULTS

ABC inference can estimate model parameters from synthetic data

We tested the ability of our ABC inference method to recover the known parameters of both the network and behavioral processes for synthetic snapshot data. We note that, in a manner distinct from other inverse Ising or network inference approaches (38, 39), we are not seeking to recover unique network links, we do not observe each spin state (only coarsened observations), and we will not use time-series data (although it is possible to extend the model to repeated observations; see text S2). As is reasonable for social data, we suppose that we are given access to information about the social coordinates of individuals. Our simple, but justified, model structure allows us to extract information from very limited datasets composed of snapshot behavioral data and census information. Given that survey and census demographic variables are typically ordinal or categorical, we use ordinal data in our experiments with synthetic data. We performed the ABC rejection method for two different combinations of connection strengths at a temperature corresponding to ordered spin states (compared to the disordered spin states, when the system is in a “hotter” state showing no overall magnetization; see fig. S3). We found that for a given temperature β, there is a value of J_aligned where every pair of spins that are connected is aligned (J_aligned changes for the different β values). This phenomenon corresponds to a strong alignment regime, where the contribution of the interaction term to the Hamiltonian dominates the dynamics of the systems. Therefore, any J > J_aligned has similar distributions over spin configurations, where connected spins are aligned. We test our inference method in two different synthetic data scenarios: one with strong connection strength J_s > J_aligned, and another with weak connection strength J_w < J_aligned.

In Fig. 3, we show the ABC posteriors for the different scenarios, with J = 5 (weak) and J = 25 (strong). We have set two model parameters in the inference: the x axis EF h_x (h_x = 1) and the connectivity bias term θ₀. Regarding h_x, from Eq. 4, we see that the inverse temperature parameter β multiplies the linear EFs h; thus, there is one degree of freedom that we choose to reduce by setting h_x = 1 without violating any constraint. Regarding the connectivity bias term θ₀ in Eq. 2, there is a coupling between the connection strength J and the bias term θ₀ in the Hamiltonian (Eq. 3). This implies that, in some regimes, the same spin configurations can be generated by different combinations of these two factors, i.e., a spin configuration could be a result of a certain combination of low connectivity density (large θ₀) and strong connection strength J and vice versa, high connectivity density (small θ₀) and weak connection strength—this trade-off does not hold when the link density is very low, with almost no connections, or when it is very high, such that it become almost a complete network (see fig. S2). Therefore, as a practical step, we set the connectivity bias term θ₀ = 9 in the inference (such that the average degree is κ ≈ 2, a parameter choice discussed in the next section). For the ABC inference in Fig. 3, we show the ABC marginal posteriors for ≈500 samples under tolerance thresholds of ϵ = 0.03 and ϵ = 0.036 for J = 5 and J = 25, respectively, from a large sampling procedure of over 6M i.i.d (independent and identically distributed random variables) samples. Results show that all inferred parameters are consistent with the original values for both weak and strong connection scenarios. As expected, the posterior of the connection strength for J = 25 accepts all values for J > J_aligned. Considering the connectivity kernel parameters, we show that we can recover posteriors consistent with θ_x and θ_y from one single observation of a spin configuration without using network data.

Fig. 3 Inference allows the recovery of model parameters for synthetic snapshot data.

On the top, synthetic data with a weak connectivity strength spin configuration (J = 5), and on the bottom, a strong connectivity strength spin configuration (J = 25); both for β = 0.3 (see fig. S3) and kernel parameters θ₀ = 9, θ_x = 2, and θ_y = 0.5. There are a total of N = 10,000 spins, with 100 spins on each of the discrete coordinates on the grid where x, y = (0,1, …,9) (for visualization purposes, links are aggregated at the coordinate level). To avoid coupling between certain model parameters, we choose to set h_x = 1 and θ₀ = 9 for the ABC inference (see main text). We use uniform priors for β ∈ [0,2], h_y ∈ [ −1.5,0.5], θ_x ∈ [ −0.5,4.5], θ_y ∈ [ −2.5,2.5], and J ∈ [0,10] in the J = 5 scenario and J ∈ [0,40] in the J = 25 scenario. We show the ABC marginal posterior distributions for ≈500 samples under tolerance thresholds of ϵ = 0.03 and ϵ = 0.036 for J = 5 and J = 25, respectively, from a large sampling procedure of over 6M i.i.d samples. The samples are visualized using histograms in gray and moving averages as solid lines, and vertical lines correspond to the real values used to generate the synthetic spin configuration. On the right, for J = 25, it shows that the ABC inference is not able to distinguish between configurations above given values of J > J_aligned because all spins that are connected are already aligned. The ABC inference algorithm accurately estimates the connectivity kernel parameters without using network data for synthetic systems.

Inferred parameters for MEs and EU referendum are consonant with homophilic tendencies and voting preferences

To demonstrate our model and inference approach beyond synthetic data, we apply it to three electoral datasets in Greater London: 2012 London ME (2012 ME), 2016 ME (2016 ME), and EU (Brexit) referendum in 2016. Our KBI model allows us to compare the different electoral outcomes using readily interpretable parameters, to visualize and compare the social connectivity structures, and to further estimate interventions.

The electoral results are given as aggregated outcomes, where we know the total outcome for a specific area but we do not know the votes of individuals. The smallest areas in spatial resolution that we can get for electoral outcomes are the electoral wards—630 electoral wards in Greater London from which, due to data mismatches, we can only use 608 ward outcomes; for the EU referendum, ward-level data are missing for 18 boroughs, so we use a combination of 280 ward-level outcomes and 18 borough electoral outcome data (see text S1). While census microdata are available at the ward level, we define the Blau space coordinates of each electoral ward as the average value from census data in each Blau space dimension, which are education, age, gender, wards centroid spatial coordinates, and income (see text S1 for details). This coarsening overestimates proximity within wards and could conceal heterogeneities among individuals within the same wards—favoring more homogeneous behavior. However, we note that although we lose information about individuals’ connectivity by using aggregated data instead of individual’s microdata coordinates, we see that average coordinates at the ward level differ appreciably from ward to ward (in fig. S4, we show evidence of heterogeneous distribution of average wards’ coordinates by bootstrapping census microdata for each ward). Using a single Blau space coordinate for members of each ward induces a type of metapopulation structure (one population per ward), although fluctuations of links and spins within each ward are still possible. We finally note that census data are from 2011, and London is a fast-changing city; nonetheless, we consider this 1- to 5-year gap adequate for our illustrative aim.

We now define distances in the Blau space and how we can return reasonable posteriors for real data. We define distance between two wards in the Blau space (Eq. 2) as the absolute difference of their coordinate values for education, age, gender, and income dimensions, and as the distance between centroid coordinates for the spatial distance dimension (see text S1). Before passing the distances to the inference algorithm, we standardize them by subtracting the mean distance and then dividing by twice their standard deviation for each Blau dimension (40). The standardization allows us to compare homophily kernel parameters among them and makes interpretation easier. Last, for the ABC rejection algorithm, we simulate a representative sample of spins in each electoral ward instead of simulating the whole population. Specifically, we keep the relative size of the ward population according to the census data (from a population of N ∼ 8,800,000 individuals in Greater London, we rescale the system to N = 60,683 with an average of 100 spins per ward). The population rescaling affects the bias term θ₀ in Eq. 2, but for sufficiently large samples, it can provide an adequate approximation for the homophily kernel parameters (see text S3). Given the coupling between the connection strength J and the connectivity bias term θ₀, we set θ₀ = 14, which corresponds to a network with an average degree of κ ≈ 2 comparable with real data on the estimated number of ego-confidants (41); see also fig. S2 where we show evidence of insensitivity of dimension-specific kernel parameters to changes in the degree of the network. As per the synthetic data, we fixed one of the EFs h_education to remove the degree of freedom in the Hamiltonian (Eq. 4) between the inverse temperature and the EFs. We choose to set h_education = 0.45 based on the results for a simple multilinear regression (see text S6), where we find that the education linear coefficient has the least variability when comparing values among the three elections. Last, we used uniform priors for all model parameters, because we did not have any other information on them and they are all of similar order of magnitude. We take a three-step approach (see text S7 for details). First, we use preexisting values and fits to the model to establish an approximate value of the parameters: multiple linear regression for the EFs (see text S6), and for the connectivity kernel parameters, we use as reference prior estimates from Hoffmann’s homophilous kernels (15). Then, in our second and third steps, from these preexisting values, we define very wide priors; while using the range of accepted values with a very permissive tolerance ϵ, we yield more specific ranges from which we sample intensely (see caption Fig. 4). There was only one scenario where we found that our posterior had significant mass at the boundary of the prior (this can be an indicator of having priors that are too narrow), and this was for the connectivity strength parameter J. However, in this case, there were clear physical reasons why we could expect to see posteriors with mass at the boundary as we see below. In Fig. 4, we show the ABC marginal posteriors for ≈400 samples for each election from a sampling procedure of over 150M i.i.d samples with tolerance thresholds being ϵ = 0.088 for 2012 ME, ϵ = 0.086 for 2016 ME, and ϵ = 0.050 for the EU referendum (see text S8 for details on how larger tolerance thresholds have no effect on the ABC marginal posteriors other than having very slightly wider posterior distributions).

Fig. 4 ABC marginal posteriors for London MEs 2012 and 2016 and EU (Brexit) referendum are consistent with known homophilic and political preferences.

We show ABC marginal posteriors for London MEs 2012 and 2016 for 608 electoral wards (see ABC marginal posteriors for MEs 2012 and 2016 for 280 electoral wards and 18 boroughs in fig. S6). We show estimates for parameters: inverse temperature β in red; connectivity strength J in yellow; EF for age, gender, and income, h_i; i = (age, gender, income); and connectivity kernel parameters θ_i; i = (education, age, gender, distance, income). h_education and θ₀ as fixed (see main text). We use uniform priors for β ∈ [0,4], J ∈ [0,40], h_age ∈ [ −3,0.15], h_gender ∈ [ −0.3,3], h_income ∈ [ −1.6,0.7], θ_education ∈ [ −7,12], θ_age ∈ [ −5,12], θ_gender ∈ [ −6,12], θ_distance ∈ [ −7,11], and θ_income ∈ [ −5,12]. The ABC marginal posterior distributions are shown for ≈400 samples under tolerance thresholds of ϵ = 0.088 for 2012 ME, ϵ = 0.086 for 2016 ME, and ϵ = 0.050 for EU referendum, from a large sampling procedure of over 150M i.i.d samples (see text S8). We show the histograms of the ABC marginal posteriors in gray, as a solid line the moving averages of the histograms, and the vertical lines corresponding to 0 value. The parameter estimates show that the connectivity kernel parameters of the two MEs are similar but considerably different from EU referendum connectivity kernel. Unlike the MEs, the EU referendum does not show homophilic signal for age, gender, and income but only for distance and education, although the EU referendum took place a month after ME 2016.

Figure 4 shows that the marginal posteriors for the two London MEs are qualitatively similar (except possibly the level of noise, indicated by β), with the Conservative party winning the 2012 ME, while the Labour party won the 2016 ME (see fig. S9 for the detailed distribution of outcomes for the three elections). However, the EU referendum ABC marginal posteriors present some differences. In terms of the parameters of the model, the temperatures for the three elections are such that the spin states present magnetic order (see fig. S3). Regarding the connection strength J, for the three elections, the value of J is large enough that all spins connected are aligned and the inference cannot distinguish J values larger than J_aligned as in the strong connection scenario in Fig. 3 (our choice of θ₀ is partly determining our inferred J). For the EFs, the three elections show the same sign for the linear coefficients in the different dimensions, with the difference that EU referendum EFs are closer to zero than for the two MEs. Notice that h_education is set to 0.45 so that more educated people tend to vote Labour/remain (see text S6). The observed EFs are in agreement with traditional two-party partisan voting sociodemographic tendencies in the United Kingdom: h_age is negative, meaning that older voters prefer Conservative/leave; h_gender is positive, meaning that men vote more Conservative/leave than women; and h_income is negative, meaning that higher income voters prefer Conservative rather than Labour, although for the EU referendum income EF is peaked around zero.

We do not seek an identity claim between our inferred model (or samples from it) and the true social network: Although microscopically interpretable, our model is clearly a substantial simplification; nonetheless, it is meaningful to consider the parameters of the network model we infer and the homophilic preferences they imply. The inferred connectivity kernels are nonnegative for the three electoral datasets, which is in agreement with the homophilous tendency of social relations (21, 42, 43). The connectivity kernel parameters for the two MEs are similar but differ from EU referendum kernel parameters. Regarding the similarities, distance homophily is persistently the strongest homophily signal in the three electoral outcomes, consistent with other work (15, 22) (a more detailed comparison can be found in text S10). Apart from spatial distance homophily, MEs’ kernels show positive signal (homophily) for age and income dimensions, while for the EU referendum age and income ABC marginal posteriors are peaked around zero, but the education kernel parameter shows a positive signal that is not present in the MEs’ kernels. Notably, the 2016 ME was held on 5 May 2016, only 49 days before the EU referendum on 23 June. Therefore, the changes in the social kernels we infer are not due to temporary evolution of the social connectivity structure but rather indicate that different social ties were at play for the EU referendum compared to MEs.

The differences in the connectivity kernels between MEs and the EU referendum indicate that different aspects of network structure were at play in the MEs versus at the EU referendum (see fig. S7 for maps of KBI electoral outcomes and inferred connectivity networks of the three elections). We also computed the median distance for each election using average ward-ward connections generated from parameter sets in Fig. 4. We find that the median distance between notionally connected individuals is similar for the three elections—5.75 km for 2012 ME, 4.90 km for 2016 ME, and 6.31 km for EU referendum—where the median borough diameter is 6.22 km (median ward diameter is 1.38 km); this is consonant with spatial homophily observed by others (15, 21). Therefore, most of the social connectivities we infer are inside the borough and to first neighbors at the borough level.

The KBI model accurately predicts unobserved voting outcomes

The distance measure between generated and real electoral outcomes η(S′, S) in Eq. 6 for the three electoral datasets gives us a measure of how accurately we can reproduce electoral outcomes. In the previous section, we showed that the KBI is able to accurately reproduce the electoral outcomes for the three elections, in particular with a weighted mean absolute percent error (WMAPE) below 8.8% for MEs and below 5% for the EU referendum. In addition to these general results, we measure the predictive power of our approach.

Motivated by the fact that we have missing ward data for the EU referendum, we define as training data the 280 ward outcome data available for the three elections and as the test data for the MEs as the 328 ward outcomes that are missing for the EU referendum, which correspond to 53.94% of overall wards (the training data are thus smaller than the test data). Because the EU referendum outcomes are not available at the ward level for the test wards, we thus evaluate the prediction on the corresponding 18 borough outcomes. Instead of using just the single best parameterization, we perform the predictions with the T = 100 parameter sets with lowest distance in the training data such that our results are not excessively sensitive to a single choice, and evaluate the prediction performance in terms of the average (over 100) distance on the test data $〈\mathrm{\eta }({\mathbf{S}}_{\text{test}}^{\prime },{\mathbf{S}}_{\text{test}})〉=\frac{1}{T}{\sum }_t^T\frac{{\sum }_{c\in \text{test}}{n}_c\mid S_c^{\prime t}-S_c\mid }{{\sum }_{c\in \text{test}}{n}_c}$, where S_c and $S_c^{\prime }$ are the real and predicted outcomes of c ward/borough, and n_c is the number of spins in c. We compare the predictions of our KBI model (J > 0) with the predictions of a model with only EFs and without social connectivity kernel (J = 0, only EFs) (see results of ABC marginal posteriors of the model parameters with J = 0 for the three elections in figs. S8 and S9). The top 100 accepted simulations had an error of η(S′, S) < 0.078 (J > 0) versus η(S′, S) < 0.083 (J = 0) in the MEs and η(S′, S) < 0.062 (J > 0) versus η(S′, S) < 0.067 (J = 0) in the EU referendum; we thus find support favoring the richer KBI model for both types of votes. We also compared the predictions with a baseline null model that assigns the same prediction for all outcomes in the test, which is the weighted average outcome on the training data $S_{\text{pred}}=\frac{{\sum }_{c\in \text{training}}{n}_c{S}_c}{{\sum }_{c\in \text{training}}{n}_c}$.

Results in Fig. 5 show that the KBI model outperforms predictions with only EFs in all the three training tests. In particular, we observe larger improvements for MEs than for the EU referendum, where the relative advantage when considering the connectivity kernel is smaller. We believe that this is due to differences in the ward polarization of the electoral outcomes, where we define polarization as the tendency of a distribution of ward-level vote shares to have separated peaks (44). In fig. S10, we show that MEs have larger ward outcome polarization than the EU referendum. According to our experiments also in fig. S10, for the same model parameters by removing the connectivity kernel, the ME outcome distribution markedly increases their polarization, while for EU referendum outcome distribution remains significantly less affected. Therefore, this suggests that for Brexit, the kernel adds less new information above the EFs compared to the MEs, as we would expect with outcomes that do not have clearly defined niches in the Blau space (14). Overall, we demonstrate that the model can successfully predict missing electoral data.

Fig. 5 KBI models, which include the connectivity kernel, outperform those using only EFs in the three elections.

We measure prediction on 2012 and 2016 MEs and EU referendum, where we train the models with 280 observed wards’ outcomes and make the predictions on 328 test wards’ outcomes (corresponding to 18 boroughs in EU referendum; see text S1). Each bar represents the average distance $[\mathrm{\eta }({\mathbf{S}}_{\text{pred}}^{\prime },{\mathbf{S}}_{\text{test}})]$ between predicted wards’ (boroughs’) outcomes and test wards’ (boroughs’) outcomes over 100 predictions from those parameters sets with the lowest distance in the training data. The error bars show the error of the mean. We show the predictions for the KBI in blue, for the model only using EFs (without social kernel) in green, and for a null model that predicts for all wards (boroughs) the weighted average computed from the training data in gray. KBI accurately predicts unobserved outcomes in the three elections, with the relative effect of social connections being lower in the EU referendum.

Reducing homophilic tendencies and social inequality can reduce polarization in silico

The interpretability of our model parameters allows us to explore different notional scenarios for public intervention while illuminating the role that the different elements of the model play in producing social outcomes. In this section, we illustrate how possible interventions might reduce electoral polarization. This is, of course, an in silico exercise, which markedly supposes the microscopic and causal relevance of the model we fit. We define electoral ward outcome polarization as the tendency of the distribution of ward outcomes S_ward (as the fraction of votes to one of the two options) to be peaked toward the extremes S_ward = 0 and S_ward = 1 of the distribution as $P(\mathbf{S})=\frac{1}{N_L}{\sum }_{(i,j)\in L}\mid S_i-S_j\mid$, where S_i is the outcomes of ward i, and L and N_L are all pairs and the number of pairs of electoral wards, respectively. In Fig. 6, we use the ward outcome distribution only for 2016 London ME for simplicity, although the observed effects in Fig. 6 should be qualitatively similar for 2012 ME and the EU referendum elections, given that they also present homophilous kernels and similar thermal noise and connection strengths. As a starting point, in Fig. 6 gray histograms showing the observed data, we see that far from a Gaussian distribution, the ward outcome distribution is polarized, with a group of electoral wards voting by majority Labour, then a decrease in the number of wards voting 50/50, and again a higher number of wards voting by majority Conservatives (see fig. S10 for the probability distributions of S_ward for the three elections and their polarization). In what follows, we show that social outcome polarization can be reduced in silico following very different strategies: by reducing inequality (changing the Blau space coordinates of individuals) (Fig. 6A), by reducing homophily (e.g., changing the connectivity kernel) (Fig. 6, B and G) ,by increasing thermal noise (Fig. 6E), by shifting the EFs (Fig. 6F), or by shifting single/multiple ward outcomes (directly altering the configuration of the spins) (Fig. 6H).

Fig. 6 Model polarization can be reduced by reducing inequalities and encouraging social mixing.

(A to H) For simplicity, we only show results for the 2016 London ME. On the x axis, S_ward is the fraction of Conservative spins in the wards, being S_ward = 0 all votes for Labour and S_ward = 1 all votes for Conservatives. We show in gray the histogram of the real electoral outcomes in the 608 electoral wards and in dark red the original Gaussian kernel density of electoral outcomes from multivariate Gaussian of ABC marginal posteriors in Fig. 4. In solid lines, the different Gaussian kernel density estimates for the different interventions in the system are shown.

Figure 6A shows how redistribution of income—changes in the coordinates of wards in the Blau space—for those wards with lower and higher income reduces polarization. Selected wards’ income are set to their weighted average so that the total income is conserved. Only redistribution of income of the 30 wards with the lowest income and the 30 wards with the highest income in Greater London (corresponding to the 5% lowest and 5% highest income wards) results in a marked drop in polarization. In silico results indicate that even small efforts reducing inequality can have a big impact in terms of social outcomes. In Fig. 6B, we eliminate homophily in the different Blau space dimensions—effectively eliminating social preference based on these features. While the EFs alone (without considering network effects) are strong predictors of voting outcomes (Fig. 5), we find that modulating homophily can also significantly shift outcomes in the model. As could be expected, the distributions are less polarized compared to the original, for age, distance, and income, which are the dimensions with stronger homophilous signal (original distribution polarization, in dark red, is of P = 0.227, and then removing homophily in the different dimension from less polarized to more polarized: removing homophily in age P = 0.190, income P = 0.197, distance P = 0.203, and then gender and education P = 0.223). In Fig. 6C, we also show the changes in the 2016 ME outcomes when changing link density and keeping the homophilous kernel parameters. What we see is that a small decrease of the bias term θ₀ (5 to 10% reduction) results in a network where connectivity is high enough that almost all spins align toward Labour vote. On the other hand, when links’ density decreased, the mixing effect of the network is reduced, resulting in a more polarized scenario. We observe a similar effect in Fig. 6D for decreasing link strength. Reducing the network effect results in a decrease of the social mixing of outcomes, giving rise to more polarized outcomes. Therefore, although the connectivity network is homophilous, and reducing homophily decreases polarization, the network also serves to mix population voting behavior, and thus, weakening the network increases polarization. Modulating thermal noise in Fig. 6E has a strong effect on the outcomes. Increasing thermal noise (reducing inverse temperature β) decreases polarization, and, the other way around, cooling down the system increases polarization. As might be anticipated from conventional social science models, we observe big changes when manipulating the linear EFs in Fig. 6F. The changes in the EFs shifted the outcome distribution toward more negative or more positive outcomes while reducing polarization. In Fig. 6G, we reduce homophily by randomizing links. The randomization of a homophilous network increases the mixing of outcomes and reduces polarization. Last, we can also change polarization by shifting opinions locally. In Fig. 6H, we fix the alignment of increasing fractions of spins in the borough of Lambeth, a traditionally Labour borough (72% vote to Labour) toward Conservative vote, and measure the effect on the other ward outcomes (Lambeth borough has 21 wards, corresponding to ∼4% of all spins in the system). For the outcome distribution in Fig. 6H, we remove outcomes from Lambeth borough wards; thus, we only measure the changes on the remaining wards. The changes in the ward outcome distributions are only due to the fact that wards are connected. We see that polarization decreases and the outcomes are shifted toward more Conservative outcomes.

DISCUSSION

We presented the KBI model that allows us to accurately reproduce population-level behavior and known homophilic tendencies only using snapshot population behavioral data, without using network data. By effectively inferring the metric for behaviorally relevant social connections in the Blau space, we are able to improve not only our understanding of the behavioral process (and its links to inequalities and social preferences) but also predictability of unobserved social outcomes.

Our KBI model exploits the spatial character of homophilic preferences to reduce the number of parameters needed, thus allowing us to perform the inference from snapshot data and to avoid needing time-series data as in (17, 18, 38). Our efforts have much in common with other recent works that seek to merge the notion of behavior in Blau space with social networks through social network survey data (14, 15). In our case, we avoid using any social network survey data, instead recovering a network model tuned to each behavior type. The model is designed to avoid confounding of homophily and behavior (45) by making strong model assumptions about the form of the EFs and their interplay with social connections. Investigating its appropriate generalizations is for further work.

Our illustrative results on voting data in Greater London corroborate known homophilic tendencies for social ties as regards distance, age, income, and education (21, 42, 43). Spatial distance is consistently the most homophilic dimension for the formation of social ties for the three votes, which is in agreement with previous studies (15, 22), and further, the spatial length scales we infer are consonant with spatial homophily observed by others (14, 15). We found large similarities between the inferred network structures for 2012 and 2016 London MEs but a different social structure for the EU (Brexit) referendum. This is consistent with the observation that traditional left-right politics do not help explain the Brexit referendum vote (46–48), perhaps suggesting that people discussed Brexit with a different type of person from the ones with whom they discussed the MEs (10). Regarding the apparent differences between votes, the EU referendum fit (unlike the MEs) shows educational homophily: the models that were selected suppressed inter-educational communication. Moreover, we do not infer the significant age or income homophily that we observe for both MEs. Education has been particularly highlighted as a significant explanatory variable (though treated as an EF) in other studies (49, 50). We also demonstrate that the model can successfully predict missing electoral data. The relative improvement when considering the connectivity kernel is significant for MEs but less relevant for the EU referendum. We believe that this is due to less clearly defined niches in the Blau space for Brexit compared to MEs (14).

Because the model and its parameters are interpretable, it enables us to explore in silico different intervention strategies in a novel framework. Beyond observing that an in silico reduction in income inequality reduces polarization, we also find unexpected strategies: In the model of the 2016 ME, we achieved a larger depolarizing effect by allowing more intergenerational connectivity—eliminating age homophily—than by eliminating income or distance homophily. This hypothesis is suggestive, because reducing age homophily might be less contentious than other social interventions. We found that, although the inferred network is homophilous, it nonetheless helps to mix population outcomes: Weakening the network effect—by decreasing connectivity density or connection strength—results in a more polarized scenario.

Given its simplicity and interpretability, we believe that the KBI model will be useful in a wide variety of behavioral/attitudinal processes, where social connections appear to have an effect, with special focus on health risk behaviors such as smoking, alcohol consumption, or vaccine refusal. We also believe that the KBI model is relevant because it makes explicit, in a simple and interpretable manner, how social inequalities (from income to educational inequities) interplay with our social preferences to shape social network structure and then how, in turn, our social network structure and social tendencies (EFs) shape our behaviors.

Adblock test (Why?)

"network" - Google News
June 05, 2021 at 12:58AM
https://ift.tt/3fXziXf

Inference and influence of network structure using snapshot social behavior without network data - Science Advances
"network" - Google News
https://ift.tt/2v9ojEM
Shoes Man Tutorial
Pos News Update
Meme Update
Korean Entertainment News
Japan News Update