Network Science

Cross-Domain Bridges

Bridge Stellar nucleosynthesis proceeds through a reaction network of hundreds of isotopes connected by nuclear reactions, and the relative abundances of elements produced can be computed by solving the same maximum-flow and steady-state flux equations used in metabolic network analysis and chemical engineering yield problems

Fields: Astrophysics, Nuclear Physics, Network Science

The abundance evolution of nuclides in a stellar burning zone is governed by a coupled ODE network dY_i/dt = sum_j lambda_{ji} Y_j - Y_i sum_k lambda_{ik}, where Y_i are molar abundances and lambda ar...

Bridge Scale-free networks x Metabolic networks - power-law hubs as metabolic bottlenecks

Fields: Biology, Mathematics, Network_Science, Systems_Biology

Metabolic networks in all organisms exhibit scale-free topology (power-law degree distribution P(k) ~ k^-gamma with gamma ~ 2.2) because highly-connected metabolites (ATP, NADH, pyruvate, glutamate) w...

Bridge The human protein-protein interaction network is scale-free, making it robust to random protein loss but fragile to targeted hub removal — the same robustness-fragility tradeoff that governs all scale-free networks.

Fields: Biology, Network Science, Medicine

The human protein-protein interaction (PPI) network has degree distribution P(k) ∝ k^(−γ) with γ ≈ 2.4, the signature of a scale-free network grown by preferential attachment. Essential proteins (thos...

Bridge Kauffman's NK random Boolean network model predicts the number of stable cell types as sqrt(N) attractors in a genome-scale regulatory network of N genes with K inputs per gene; attractor states in the dynamical network correspond one-to-one with stable cell fates, providing a physics-of-complexity explanation for the Hayflick limit on differentiation state number

Fields: Theoretical Biology, Cell Biology, Complex Systems, Network Science

In Kauffman's NK random Boolean network model (N genes, K=2 inputs per gene), the number of dynamical attractors scales as sqrt(N) ≈ 2^(N/2) for large sparse networks, which correctly predicts that a ...

Bridge Algorithmic game theory analyses internet protocols, ad auctions, and platform economics as games with strategic self-interested agents — computing Nash equilibria for BGP routing, quantifying the price of anarchy for selfish routing, and implementing Vickrey-Clarke-Groves mechanisms at planetary scale in sponsored search auctions.

Fields: Computer Science, Economics, Game Theory, Network Science, Mechanism Design

CLASSICAL PROBLEM: Internet protocols (BGP routing, TCP congestion control) are designed for cooperative agents, but actual Internet is composed of self-interested autonomous systems (ASes) that may d...

Bridge Social Network Centrality x Eigenvector Methods — PageRank as Katz centrality

Fields: Computer_Science, Mathematics, Network Science

Social network centrality measures (PageRank, Katz centrality, eigenvector centrality, HITS) are all variants of the dominant eigenvector of the adjacency or transition matrix; the attenuation factor ...

Bridge Landscape ecology's analysis of habitat connectivity maps directly onto weighted graph theory, enabling circuit-theoretic gene flow prediction, least-cost corridor design, and percolation-theoretic thresholds for landscape connectivity collapse.

Fields: Landscape Ecology, Graph Theory, Conservation Biology, Spatial Statistics, Network Science

Landscape ecology studies how spatial heterogeneity affects ecological processes. Habitat patches become graph nodes; dispersal corridors become weighted edges where weights represent dispersal resist...

Bridge Ecological food webs as directed networks — trophic cascade dynamics as network percolation

Fields: Ecology, Network Science, Graph Theory, Conservation Biology, Complexity Science

Ecological food webs are directed weighted networks where nodes are species and edges represent trophic interactions (energy flow from prey to predator). Network structural properties predict ecosyste...

Bridge Kelp forest trophic cascades — where sea otter removal triggers urchin population explosions that overgraze kelp — are network-theoretic cascade failures with amplification coefficients predictable from the interaction network's eigenvalue structure, making marine trophic dynamics a natural experiment in structured network fragility.

Fields: Ecology, Network Science, Complex Systems

The classical kelp forest trophic cascade (Paine 1969; Estes & Palmisano 1974) demonstrates that removing a keystone predator (sea otter) can cause catastrophic regime shifts through indirect effects:...

Bridge Mutualistic ecological networks (plant-pollinator, plant-seed disperser) exhibit nested architecture—where specialists interact only with subsets of generalists' partners—and this nestedness maximizes robustness to species extinction, quantified by the nestedness temperature T = 100*(1 - NODF/100) and linked to network connectivity through spectral theory

Fields: Ecology, Network Science, Mathematics

Nestedness in mutualistic networks arises from a core-periphery structure where the adjacency matrix A approaches a triangular/packed form; the nestedness metric NODF (Nestedness based on Overlap and ...

Bridge Plant-pollinator and plant-seed disperser mutualistic networks exhibit characteristic nested architecture where specialists interact with subsets of generalist partners; this nestedness property, quantified identically in ecology and economic complexity networks, predicts robustness to extinction cascades and emerges from maximum entropy constraints on bipartite graphs.

Fields: Ecology, Network Science, Economics, Mathematics

Plant-pollinator and plant-seed disperser networks are bipartite mutualistic networks with characteristic nested structure: specialists interact with subsets of what generalists interact with. Nestedn...

Bridge Habitat connectivity in fragmented landscapes undergoes a percolation transition where a critical fragmentation threshold determines whether species can disperse across the entire landscape or are confined to isolated patches — the same universality class as bond percolation on a two-dimensional lattice.

Fields: Ecology, Network Science, Statistical Physics, Conservation Biology

Landscape ecology studies how habitat fragmentation affects species persistence and dispersal. Statistical physics provides the exact framework: a binary habitat map (habitat / non-habitat pixels) is ...

Bridge Soil food webs — multi-trophic networks of bacteria, fungi, nematodes, mites, and larger invertebrates — obey the same network-theoretic trophic level, connectance, and stability rules as above-ground food webs, but the prevalence of omnivory and detrital energy channels creates a distinct structural signature predictable by network flow analysis

Fields: Ecology, Network Science, Soil Science

Soil food web structure can be quantified using the same adjacency-matrix formalism as aquatic and terrestrial webs: Lotka-Volterra community matrices, Lindeman trophic efficiency, and May's connectan...

Bridge Trophic cascades in food webs are structurally predicted by the prevalence of tri-trophic chain and apparent competition network motifs: ecosystems with high frequencies of cascade-amplifying motifs exhibit stronger top-down regulation of primary production

Fields: Ecology, Network Science

Network motif analysis reveals that trophic cascade strength is not merely a function of predator biomass but of the topological prevalence of specific three- and four-node interaction patterns (tri-t...

Bridge Fractal vascular network geometry ↔ ¾-power metabolic scaling law — West-Brown-Enquist theory

Fields: Ecology, Evolutionary Biology, Physics, Network Science, Fractal Geometry

West, Brown & Enquist (1997) derived Kleiber's empirical ¾-power metabolic scaling law B ∝ M^(3/4) from first principles using the fractal geometry of biological distribution networks (vascular, bronc...

Bridge Supply-chain risk analysts model firm–supplier edges failing under correlated shocks — resembling bond percolation on industrial networks where operational continuity requires giant connected components — enabling import of percolation thresholds, reliability polynomials, and network resilience metrics from discrete mathematics into operations research practice when modeling multi-tier disruptions.

Fields: Economics, Operations Research, Network Science

Bond percolation retains edges with probability p — giant component emergence near p_c parallels systemic failure cascades when supplier edges drop below sustaining densities — stylized fact models tr...

Bridge The Leontief input-output model of inter-industry production is a weighted directed network whose spectral properties determine how supply shocks propagate across the global economy, making network percolation theory the natural language for systemic trade risk and macroeconomic fragility.

Fields: Economics, Network Science

The Leontief model represents the economy as a matrix A where A_ij = purchases by industry i from industry j per unit output. Total output vector x satisfies x = Ax + d (final demand d), solved as x =...

Bridge Epidemic models on networks — thresholds for global spread driven by connectivity and transmissibility — reappear in models of financial contagion where defaults propagate via exposures and liquidity shocks.

Fields: Economics, Epidemiology, Network Science, Physics

Compartmental and network SIR-style models emphasize a reproduction number–like threshold: below critical connectivity or shock transmission probability, disturbances die out locally; above it, cascad...

Bridge Buldyrev's interdependent network model predicts catastrophic discontinuous phase transitions in coupled infrastructure systems (power-grid/internet) — unlike single networks which fail gradually — proven by the 2003 Northeast Blackout (256 plants, 55M people) and formalised as NP-hard minimum-cost resilience recovery.

Fields: Engineering, Social Science, Network Science, Physics, Complexity Science

Single-network percolation theory: a random graph with mean degree ⟨k⟩ has a giant connected component above a critical fraction p_c of remaining nodes — removal of (1−p_c) nodes causes gradual degrad...

Bridge Next-generation-matrix epidemiology provides a control-oriented state-space abstraction for adaptive intervention policies targeting dominant transmission modes.

Fields: Epidemiology, Control Engineering, Network Science, Public Health

The next-generation matrix (NGM) decomposes compartmental transmission into mode-specific reproduction gains. This maps naturally to control concepts: interventions act as structured gain reductions t...

Bridge The epidemic threshold R₀ = 1 in the SIR model is mathematically identical to the bond-percolation threshold on the contact network: an epidemic spreads to a macroscopic fraction of the population if and only if the transmission bond-occupation probability exceeds the percolation critical point p_c, and the final epidemic size equals the size of the giant percolation cluster.

Fields: Epidemiology, Network Science, Statistical Physics, Mathematics

In an SIR epidemic on a contact network, each edge (i,j) is independently occupied with probability T = 1 − exp(−βτ) (transmission probability × infectious period). The expected outbreak size from a s...

Bridge Epidemic spread on contact networks is mathematically equivalent to bond percolation, where infection probability plays the role of bond occupation probability and the epidemic threshold corresponds to the percolation transition — enabling network topology to predict outbreak potential before any pathogen-specific parameters are measured.

Fields: Epidemiology, Network Science, Statistical Physics, Public Health

Huang et al. (2020, 51 k citations) documented the clinical features of SARS-CoV-2, revealing explosive network-mediated spread through close-contact clusters. Network science and statistical physics ...

Bridge Percolation thresholds can connect habitat-fragmentation mathematics to antimicrobial combination network design.

Fields: Epidemiology, Network Science, Statistical Physics

Speculative analogy: Percolation thresholds can connect habitat-fragmentation mathematics to antimicrobial combination network design....

Bridge The SIR epidemic model is bond percolation on a contact network — the epidemic threshold 1/R₀ equals the percolation threshold p_c, and herd immunity is the destruction of the giant connected component of susceptible individuals.

Fields: Epidemiology, Network Science, Statistical Physics, Mathematical Biology

The classic SIR (Susceptible-Infected-Recovered) compartmental epidemic model maps exactly onto bond percolation on the underlying contact network. Each person is a node; each potentially infectious c...

Bridge Jerne's immune network theory (1974) — antibodies recognising other antibodies (idiotypes) form a self-regulating scale-free network whose attractor dynamics implement immune memory and self-tolerance — is formally equivalent to a Hopfield associative memory network; immunological disorders correspond to network bifurcations.

Fields: Immunology, Network Science, Computational Biology, Nonlinear Dynamics, Systems Biology

Jerne (1974) proposed that the immune system is a network: antibodies (idiotypes) can be recognised by other antibodies (anti-idiotypes) as if they were foreign antigens. This creates a network of mut...

Bridge Scientific knowledge overload is a channel-capacity problem: the rate of cross-domain insight generation is limited not by the volume of published results but by the bandwidth of the translation layer between domain vocabularies — structured cross-domain bridges function as a lossless codec reducing mutual information distance without destroying signal.

Fields: Information Theory, Epistemology, Network Science, Cognitive Science, Library Science, Science Of Science

Shannon's channel capacity theorem (C = B log₂(1 + S/N)) provides a formal framework for the scientific knowledge overload problem. Consider each scientific domain as a transmitter and each researcher...

Bridge Protein-protein interaction networks are scale-free graphs (P(k) ∝ k^{-γ}, γ ≈ 2.5) whose hub proteins are essential (lethal when deleted), whose modules correspond to functional complexes detectable by the Louvain algorithm, and whose bridging proteins (high betweenness centrality) are preferential drug targets — directly translating graph-theoretic concepts into biological and pharmacological predictions.

Fields: Mathematics, Biology, Network Science, Graph Theory, Systems Biology

The yeast interactome (~6,000 proteins, ~80,000 interactions, Jeong et al. 2001) follows a scale-free degree distribution P(k) ∝ k^{-γ} with γ ≈ 2.5 — identical mathematically to the WWW, citation net...

Bridge Bond/site percolation thresholds on graphs ↔ lateral movement probability and blast-radius growth in enterprise networks (probability ↔ cybersecurity)

Fields: Mathematics, Computer Science, Cybersecurity, Network Science

Lateral movement after initial compromise is often modeled as random or attacker-chosen hops on a graph of hosts, accounts, and trust relationships. Bond percolation (edges open with probability p) an...

Bridge Hyperbolic geometry provides exponentially more room in a ball of fixed radius than Euclidean space, making it a natural host geometry for embeddings of trees and scale-free hierarchical networks.

Fields: Mathematics, Computer Science, Network Science, Geometry

Trees embed with low distortion in hyperbolic space because distances grow like logs of branching depth, matching the volume growth of hyperbolic balls. Poincaré and Lorentz models therefore yield com...

Bridge Mycelial transport networks of wood-decay fungi grow to topologies that approximate minimum spanning trees (MST) connecting nutrient sources while also maintaining fault-tolerant looping edges, exhibiting the same trade-off between cost and resilience that optimal network design theory predicts and that is observed in slime mold and mammalian vascular networks

Fields: Mycology, Mathematics, Network Science

Mycelial networks are self-organized physical graphs connecting resource nodes; their Steiner-tree-like minimization of total hyphal length subject to transport efficiency constraints produces topolog...

Bridge Percolation theory — the second-order phase transition from isolated clusters to a giant connected component at threshold p_c = 1/⟨k⟩ on Erdős-Rényi graphs — quantifies network robustness: scale-free networks (Barabási-Albert, P(k)∝k^{-γ}) are robust to random failures but fragile to targeted hub attacks, with p_c→0 as N→∞, transforming network resilience engineering into a percolation problem.

Fields: Mathematics, Statistical Physics, Network Science, Computer Science, Epidemiology

Percolation theory, originally developed for porous media and ferromagnetism, describes the emergence of large-scale connectivity in random structures. Site percolation on a network: each node is "occ...

Bridge Information Cascades and Herding — Bikhchandani's rational cascade model explains bank runs, market crashes, fashion, and social media virality as informationally inefficient equilibria

Fields: Economics, Mathematics, Social Science, Behavioural Economics, Network Science

An information cascade (Bikhchandani, Hirshleifer & Welch 1992) arises when individuals, making decisions sequentially, rationally choose to ignore their own private information and copy the observed ...

Bridge Strategic network formation (Jackson-Wolinsky pairwise stability) connects graph theory to social science: agents form links based on cost-benefit calculations, generating small-world and scale-free topologies from rational decisions, with efficient networks provably different from stable networks due to the tension between individual incentives and social welfare.

Fields: Mathematics, Graph Theory, Economics, Social Science, Network Science

STRATEGIC NETWORK FORMATION (Jackson & Wolinsky 1996): Agents form links g_ij ∈ {0,1} by mutual consent. Payoff to agent i: u_i(g) = Σⱼ δ^d(i,j) - Σⱼ: g_ij=1 c where δ ∈ (0,1) = decay factor with ...

Bridge Graph convolution bridges relational representation learning and pathogen transmission-network inference from sparse contact data.

Fields: Network Science, Infectious Disease, Machine Learning

Speculative analogy (to be empirically validated): graph convolutional message passing can infer latent transmission linkage structure by integrating mobility, genomic, and contact-network signals und...

Bridge Neural circuit diversity and ecosystem stability — May's random matrix stability criterion governs both heterogeneous neural populations and biodiverse food webs

Fields: Neuroscience, Ecology, Mathematics, Network Science, Statistical Physics

The diversity-stability relationship in ecology (May 1972) maps precisely onto neural circuit diversity: heterogeneous neural populations are more robust to perturbation than homogeneous ones, just as...

Bridge Connectome topology encodes functional brain states via graph Laplacian eigenspectra: the spectral gap predicts synchronization capacity and network segregation

Fields: Neuroscience, Mathematics, Network Science

The connectome—the complete wiring diagram of neural connections—is a weighted undirected graph G=(V,E,W) whose Laplacian L=D-W has eigenvalues 0=λ₁≤λ₂≤...≤λₙ. The algebraic connectivity λ₂ (Fiedler v...

Bridge Supply chain resilience is determined by network topology in the same way as infrastructure robustness in complex systems theory, with the Barabasi-Albert scale-free network model predicting that targeted hub disruption causes cascading failures while random disruption is absorbed.

Fields: Operations Research, Complex Systems, Network Science

Supply chain networks mapped as directed graphs (nodes = firms, edges = supplier-buyer relationships) exhibit scale-free degree distributions with a small number of high-degree hub suppliers; Barabasi...

Bridge Habitat fragmentation is a percolation phase transition — species extinction risk collapses discontinuously when connected habitat falls below the percolation threshold, and finite-size scaling predicts exactly how this threshold shifts in landscapes of finite total area.

Fields: Statistical Physics, Conservation Biology, Landscape Ecology, Network Science

In bond/site percolation on a lattice, a giant connected cluster (spanning the system) disappears abruptly below a critical occupancy p_c. In fragmented landscapes, habitat patches connected by disper...

Bridge Network percolation theory and epidemic threshold theory are the same mathematical object — the epidemic threshold R_0=1 is a percolation phase transition, and importing finite-size scaling from condensed-matter physics would transform how outbreak risk is estimated in finite populations.

Fields: Statistical Physics, Epidemiology, Network Science, Public Health

In bond percolation on a network, a giant connected component emerges at a critical bond probability p_c — below p_c the outbreak is finite; above it a macroscopic fraction of nodes is infected. The e...

Bridge Barabási-Albert preferential attachment ↔ criticality ↔ brain connectome ↔ internet topology

Fields: Network Science, Statistical Physics, Neuroscience, Computer Science

Barabási & Albert (1999) showed that networks grown by preferential attachment — where new nodes connect preferentially to high-degree nodes ("rich get richer") — produce scale-free degree distributio...

Bridge Tumor vascular network fragmentation under adaptive therapy maps directly onto percolation-threshold transitions studied in statistical physics.

Fields: Oncology, Statistical Physics, Network Science

When a tumor's blood-supply network is disrupted below its percolation threshold, large-scale connectivity collapses and nutrient delivery fails — the same phase transition that physicists use to mode...

Bridge Network Epidemiology and Herd Immunity — SIR dynamics on heterogeneous contact networks, scale-free epidemic thresholds, and superspreader percolation

Fields: Physics, Epidemiology, Network Science, Public Health, Social Science

The SIR (Susceptible–Infected–Recovered) model on networks assigns each node a state and allows transmission along edges at rate β with recovery at rate γ. In homogeneous networks the basic reproducti...

Bridge Rumour and misinformation spreading on social networks maps exactly onto bond percolation on the contact network via the SIR epidemic model — with the percolation threshold p_c → 0 for scale-free networks, meaning any viral meme can reach the giant component of social attention regardless of initial conditions.

Fields: Physics, Social Science, Network Science, Epidemiology, Information Theory

SIR RUMOUR MODEL (Daley & Kendall 1965): Individuals are Susceptible (haven't heard), Infected (spreading), Recovered (heard but no longer spreading). Rate equations: dS/dt = -βSI dI/dt = βSI - γ...

Bridge Urban scaling laws — city GDP, patents, and crime scaling superlinearly (β ≈ 1.15) while infrastructure scales sublinearly (β ≈ 0.85) with population — emerge from statistical physics of social interaction networks with fractal road geometry, analogous to critical phenomena with universal exponents independent of city-specific cultural or geographic details.

Fields: Physics, Social Science, Urban Science, Complex Systems, Network Science, Economics

Bettencourt et al. (2007) showed that urban properties Y scale as power laws Y ∝ N^β with population N for cities across countries and continents. Superlinear scaling (β ≈ 1.15): GDP, patents, R&D emp...

Bridge Political polarisation dynamics in networked populations are mathematically equivalent to the Ising model ferromagnetic phase transition, with partisan identity as spin, echo chambers as ferromagnetic domains, and social influence strength as inverse temperature.

Fields: Political Science, Statistical Physics, Network Science, Social Science

The Ising model describes how local alignment interactions between magnetic spins produce global ordered phases (ferromagnetism) or disordered phases (paramagnetism) depending on temperature. Politica...

Bridge The spread of social behaviours (innovation adoption, social movements, voting) requires exposure to multiple independent contacts (complex contagion) unlike disease spread (simple contagion), described by threshold models where adoption occurs when the fraction of adopting neighbours exceeds an individual-specific threshold φ — a fundamentally different dynamic than standard SIR epidemics.

Fields: Social Science, Epidemiology, Network Science, Sociology

Granovetter (1978) showed that riot or protest participation depends on threshold distributions in populations; the cascade dynamics depend critically on the shape of the threshold distribution φ_i. C...

Bridge Network centrality measures — degree, betweenness, eigenvector, and Katz centrality — derived from spectral properties of the adjacency matrix, provide a unified mathematical framework quantifying social influence, predicting epidemiological superspreaders, economic wage inequality in oligopoly, and information diffusion in social networks.

Fields: Social Science, Mathematics, Network Science, Economics, Epidemiology, Sociology

Social influence in a network G = (V, E) with adjacency matrix A is captured by multiple centrality measures, all derivable from A's spectral decomposition. Degree centrality: k_i = Σⱼ Aᵢⱼ (direct con...

Bridge Granovetter's "strength of weak ties" and Burt's structural holes in social capital theory are precisely identified with bridge edges and high-betweenness-centrality nodes in graph theory: social capital reduces to computable network topology, and the Erdős-Rényi giant component transition predicts the critical network density for information to spread society-wide.

Fields: Social Science, Sociology, Graph Theory, Network Science, Economics

Social capital theory (Granovetter 1973, Burt 1992, Coleman 1988) asserts that an individual's social position determines their access to information, resources, and opportunities. Network science pro...

Bridge Burt's structural holes bridge social science and mathematics: brokers who span disconnected network clusters gain information and control advantages quantified by the constraint measure C_i ΓÇö formalizing Granovetter's weak tie strength and Coleman's social capital closure in a unified network theory.

Fields: Social Science, Mathematics, Network Science, Sociology, Organizational Behavior

Structural hole theory (Burt 1992) provides a mathematical theory of brokerage advantage. A structural hole exists between two groups when there is no direct connection between them ΓÇö the broker who...

Bridge The voter model (Clifford & Sudbury 1973) — each agent copies a random neighbor's opinion — maps opinion dynamics onto random walk theory: consensus in d≤2 dimensions, persistent diversity in d>2, T∝N·lnN in 2D, and echo-chamber polarization as network-structured metastable trapping.

Fields: Social Science, Mathematics, Statistical Physics, Network Science

The voter model is the simplest model of social influence and opinion dynamics, yet it reduces exactly to classical problems in probability theory and statistical physics. 1. Voter model definition. N...

Bridge Social network homophily — the tendency for similar individuals to form ties — is quantified as assortativity mixing in network science, and the configuration model provides a null distribution against which observed homophily can be tested, revealing whether similarity clustering is driven by choice, opportunity, or network structure.

Fields: Social Science, Network Science, Statistics, Sociology

"Birds of a feather flock together" — homophily is one of the most robust findings in social science (McPherson et al. 2001). Network science formalises this as assortativity: the Pearson correlation ...

Bridge Homophily and structural segregation — the tendency of similar individuals to connect produces modular networks that are the mathematical basis of filter bubbles and information siloing

Fields: Social Science, Network Science, Sociology, Mathematics, Information Theory

Homophily — the tendency of similar individuals to form ties ("birds of a feather flock together") — is the dominant structural force shaping social networks. Measured by the assortativity coefficient...

Bridge Bourdieu's social capital — resources available through social networks — maps precisely onto network centrality measures: betweenness centrality captures brokerage capital (Burt's structural holes), eigenvector centrality captures prestige capital, and the Gini coefficient of the degree distribution measures inequality in social capital access.

Fields: Sociology, Network Science, Social Science, Graph Theory, Economics

Bourdieu (1986) defined social capital as "the aggregate of the actual or potential resources which are linked to possession of a durable network of more or less institutionalized relationships of mut...

Bridge Interdependent network theory (Buldyrev et al. 2010) shows that mutual dependencies between coupled infrastructure networks (power grid ↔ communication network) convert continuous second-order percolation transitions into abrupt first-order cascades, with direct application to the 2003 Italy blackout and financial systemic risk.

Fields: Social Science, Infrastructure Systems, Physics, Network Science, Percolation Theory

Standard percolation theory predicts that as nodes fail in a random network, the giant connected component shrinks continuously (second-order phase transition) with a critical threshold p_c = 1/ fo...

Bridge Complexity and Emergence in Social Systems — self-organised criticality, power laws, and the edge of chaos describe cities, economies, and civilisations as complex adaptive systems

Fields: Physics, Social Science, Economics, Complex Systems, Network Science

Cities, economies, and civilisations exhibit emergent order arising from local interactions without central control — hallmarks of complex adaptive systems (CAS). The edge of chaos (Kauffman 1993; Lan...

Bridge Opinion dynamics models (Voter, Sznajd, Deffuant) are instances of Ising-like spin dynamics on social networks: political polarisation is a ferromagnetic phase transition, echo chambers are ferromagnetic domains, and the critical temperature T_c predicts the consensus-to- fragmentation transition.

Fields: Social Science, Political Science, Statistical Physics, Complexity Science, Network Science

The Ising model describes interacting binary spins σ_i ∈ {-1, +1} on a lattice with Hamiltonian H = -J Σ_{ij} σ_i σ_j - h Σ_i σ_i. The ferromagnetic phase transition at T_c separates two phases: - T <...

Network Science

Cross-Domain Bridges

Open Unknowns (4)

Active Hypotheses