--- title: State-Industry Bipartite Network url: https://www.emergentmind.com/topics/state-industry-bipartite-network type: topic --- # State-Industry Bipartite Network A state-industry bipartite network is a two-mode graph where one node set represents geographic or administrative states and the other represents industries, with edges indicating a specified relationship—most commonly the presence of economic activity, investment, or establishment in a given industry by a given state. This structure underlies many empirical studies of economic complexity, industrial diversification, network clustering, and longitudinal influence. The mathematical framework, algorithmic procedures, and inferential techniques for analyzing state-industry bipartite networks draw from optimal blockmodeling, mixed-membership stochastic blockmodels, entropy-based null models, economic complexity indices, longitudinal influence models, and projected network theory. ## 1. Construction and Mathematical Framework A state-industry bipartite network consists of two disjoint node sets: states $S = \{s_1, \ldots, s_n\}$ and industries $I = \{i_1, \ldots, i_m\}$, with the bipartite edge set $E \subseteq S \times I$. The network's biadjacency matrix $B \in \mathbb{R}^{n \times m}$ is defined by $B_{si}=1$ if state $s$ is linked to industry $i$ by a chosen criterion. Empirical specification varies depending on the research context: - Firm-level capital aggregation: $x_{sp}$, the paid-up capital of all firms from state $s$ in industry $p$ [2601.12356]. - Revealed Comparative Advantage (RCA): $RCA_{sp}$ is computed as $x_{sp} / \sum_{p'} x_{sp'}$ divided by $\left(\sum_{s'} x_{s'p}\right) / \sum_{s',p'} x_{s'p'}$, binarized as $M_{sp}=1$ for $RCA_{sp}\ge1$ [2601.12356]. - Time-evolving investment flows, cosponsorship, or other relational quantities may be captured by $Y_t \in \mathbb{R}^{S \times I}$ where $t$ indexes time [1809.03439]. A formal bipartite stochastic block model (BSBM) parametrizes the link probability between state $i$ and industry $j$ according to their latent block memberships, i.e., $A_{ij} \sim \mathrm{Bernoulli}(P_{y_i, z_j})$ for unknown labels $y_i \in \{1, \dots, K\}$, $z_j \in \{1, \dots, L\}$ [1803.06031]. ## 2. Network Metrics: Diversity, Ubiquity, and Complexity Key metrics derived from the binary biadjacency matrix $M_{sp}$ include: - Diversification ($k_{s,0}$): Number of industries where state $s$ is competitive, $k_{s,0} = \sum_p M_{sp}$ [2601.12356]. - Ubiquity ($k_{p,0}$): Number of states active in industry $p$, $k_{p,0} = \sum_s M_{sp}$ [2601.12356]. - Economic Complexity Index (ECI): Obtain similarity matrix $\widetilde M_{ss'} = \sum_p M_{sp} M_{s'p} / (k_{s,0} k_{p,0})$; solve for principal eigenvector $K_s$, and standardize to $ECI_s$ [2601.12356]. - Fitness–Complexity Algorithm: Iteratively, $F_s^{(n)} = \sum_p M_{sp} Q_p^{(n-1)}$ and $Q_p^{(n)} = \left( \sum_s M_{sp} / F_s^{(n-1)} \right)^{-1}$, normalizing after each step [2601.12356]. Empirical findings indicate high complexity correlates strongly with per-capita gross state product [2601.12356]. ## 3. Clustering, Biclustering and Block Models Community detection and latent group inference in state-industry bipartite networks employ: - Spectral Initialization: Compute truncated SVD of $A$ to obtain $\hat U_r$, $\hat V_r$, then apply $K$-means to rows for initial block labels $\tilde y$, $\tilde z$ [1803.06031]. - Pseudo-Likelihood EM Updates: Aggregate block-compressed counts, estimate Poisson means $\hat\Lambda_{k\ell}$, and class priors $\hat\pi_k$, then maximize log pseudo-likelihood for label refinement [1803.06031]. - Sub-block Partitioning: Partition nodes into $2Q \times Q$ sub-blocks for provable independence and distributed implementation [1803.06031]. Optimal bipartite clustering achieves weak consistency—misclassification rate converges to zero under cluster-balance, degree-sparsity, and block-separability conditions. The two-pass PL refinement yields exponential-rate guarantees and is minimax optimal up to logarithmic factors [1803.06031]. Mixed-membership blockmodels (biMMSBM) further capture group overlap and covariate effects; latent membership vectors are parameterized using Dirichlet priors modulated by node-level covariates, while dyad-level covariates modulate edge formation via logistic affinity matrix $B_{gh}$ [2305.05833]. Variational EM and stochastic inference allow for scalable fitting and model selection based on predictive likelihood or ROC-AUC. ## 4. Projected Networks and Structural Properties The one-mode projection compresses the bipartite network onto states: - Unweighted Projection: $A_S = \mathrm{sign}^+(B B^T)$, $a_{u,v}=1$ if states $u, v$ share at least one industry [1707.00912]. - Weighted Projection: $W_{u,v} = \sum_k B_{u,k} B_{v,k}$, the number of shared industries [1707.00912]. Theoretical properties include: - Cliques: If an industry connects to $d_k \geq 2$ states, those states form a clique in $G_S$ [1707.00912]. - Connectedness: G_S can be disconnected if there exist pendant states or industries with degree one [1707.00912]. - Edge Weight Bounds: $1 \leq w_{u,v} \leq |I|$ for $w_{u,v}>0$ [1707.00912]. - Total Weight: $\sum_{u