arXiv subjects

Nicholas W. Landry

Publications and source records attributed to Nicholas W. Landry.

15 recordsLinked to original sources

arXiv2026

Emergent contagion complexity: Disentangling mechanistic complexity from correlated heterogeneity

Simple and complex contagions differ mechanistically; multiple exposures act synergistically in the latter but independently in the former. Yet correlated mixtures of simple contagions may appear complex when inferring global contagion rules, a phenomenon we call "emergent complexity." We present a measure of contagion complexity and an inferential framework for estimating mixtures of nonparametric contagion rules from time-series data. Our work reframes past studies on complex contagion by offering heterogeneous mixtures of simple contagions as an alternative explanation.

physics.soc-ph↗

arXiv2026

The nestedness of higher-order networks

In contrast to dyadic interactions, higher-order interactions may contain one another, with subgroups naturally embedded within larger groups. These containment patterns arise empirically in ecology, sociology, computer science and the science of science, and have been studied under the names nestedness, simpliciality, encapsulation, and inclusion. In this chapter, we review each of these measures and unify them through a mathematical object known as the encapsulation directed acyclic graph, formulating each measure as a function of its properties. We demonstrate that nested structure is prevalent in social systems across several domains, show that different measures capture complementary aspects of this structure, and find that the absence of nestedness can itself be a powerful indicator of the mesoscale organization of a system.

physics.soc-ph↗

arXiv2026

The interplay of network structure and correlated infectious traits in epidemic models

Individual contributions to the spread of an epidemic vary widely due to an individual's location in a social network and their intrinsic ability to spread or contract diseases. While the effect of heterogeneous population structure and infection rates is well-understood, less studied is the impact of population-level covariance between susceptibility and transmissibility, despite empirical evidence showing that both susceptibility and transmission vary across individuals. We introduce a mathematical modeling framework incorporating population subgroups, each with its own joint distribution of susceptibility and transmissibility. We apply this framework to the susceptible-infected-recovered (SIR) model to examine the effect of community structure and degree heterogeneity. We derive analytical expressions for the basic reproduction number, which, when reduced, corroborates prior results and validate these results with numerical simulations. We pair these estimates with simulations exploring first, the temporal dynamics of this model with the homogeneous SIR model, and second, implications for effective social intervention. This analysis provides a foundation for future studies exploring the interplay between structural and dynamical heterogeneity in infectious disease transmission.

q-bio.PE↗

arXiv2026

Higher-order interactions at scientific conferences influence team formation

Cooperation enables teams to solve complex problems that one individual alone cannot address. In science, collaborative teams have become the predominant way through which progress is achieved. These scientific collaborations arise though various mechanisms, among which interactions at conferences. The Scialog conferences, which comprise a series of small, interdisciplinary scientific workshops held over several years, are an ideal laboratory to study the network mechanisms leading to team formation. Building on existing work studying team formation from a pairwise perspective, we present a higher-order network perspective generalizing this framework. We provide a formalization for the notion of group interaction over time by defining a taxonomy of synchronous and asynchronous group interactions. We apply this framework to the Scialog case study using a stepwise selection logistic model and find evidence that all interaction types described in our taxonomy are highly significant for team formation. This higher-order network perspective provides a new framework for the study of collective behavior and group formation.

physics.soc-ph↗

arXiv2026

A Blue Start: A large-scale pairwise and higher-order social network dataset

Large-scale networks have been instrumental in shaping how we think about social systems, and have undergirded many foundational results in mathematical epidemiology, computational social science, and biology. However, many of the social systems through which diseases spread, information disseminates, and individuals interact are inherently mediated through groups, known as higher-order interactions. A gap exists between higher-order models of group formation and spreading processes and the data necessary to validate these mechanisms. Similarly, few datasets bridge the gap between pairwise and higher-order network data. The Bluesky social media platform is an ideal laboratory for observing social ties at scale through its open API. Not only does Bluesky contain pairwise following relationships, but it also contains higher-order social ties known as "starter packs" which are user-curated lists designed to promote social network growth. We introduce "A Blue Start", a large-scale network dataset comprising 39.7M user accounts, 2.4B pairwise following relationships, and 365.8K groups representing starter packs. This dataset will be an essential resource for the study of higher-order networks.

physics.soc-ph↗

arXiv2026

HIF: The hypergraph interchange format for higher-order networks

Many empirical systems contain complex interactions of arbitrary size, representing, for example, chemical reactions, social groups, co-authorship relationships, and ecological dependencies. These interactions are known as higher-order interactions and the collection of these interactions comprise a higher-order network, or hypergraph. Hypergraphs have established themselves as a popular and versatile mathematical representation of such systems and a number of software packages written in various programming languages have been designed to analyze these networks. However, the ecosystem of higher-order network analysis software is fragmented due to specialization of each software's programming interface and compatible data representations. To enable seamless data exchange between higher-order network analysis software packages, we introduce the Hypergraph Interchange Format (HIF), a standardized format for storing higher-order network data. HIF supports multiple types of higher-order networks, including undirected hypergraphs, directed hypergraphs, and abstract simplicial complexes, while actively exploring extensions to represent multiplex hypergraphs, temporal hypergraphs, and ordered hypergraphs. To accommodate the wide variety of metadata used in different contexts, HIF also includes support for attributes associated with nodes, edges, and incidences. This initiative is a collaborative effort involving authors, maintainers, and contributors from prominent hypergraph software packages. This project introduces a JSON schema with corresponding documentation and unit tests, example HIF-compliant datasets, and tutorials demonstrating the use of HIF with several popular higher-order network analysis software packages.

physics.soc-ph↗

arXiv2025

The simpliciality of higher-order networks

Higher-order networks are widely used to describe complex systems in which interactions can involve more than two entities at once. In this paper, we focus on inclusion within higher-order networks, referring to situations where specific entities participate in an interaction, and subsets of those entities also interact with each other. Traditional modeling approaches to higher-order networks tend to either not consider inclusion at all (e.g., hypergraph models) or explicitly assume perfect and complete inclusion (e.g., simplicial complex models). To allow for a more nuanced assessment of inclusion in higher-order networks, we introduce the concept of "simpliciality" and several corresponding measures. Contrary to current modeling practice, we show that empirically observed systems rarely lie at either end of the simpliciality spectrum. In addition, we show that generative models fitted to these datasets struggle to capture their inclusion structure. These findings suggest new modeling directions for the field of higher-order network science.

physics.soc-ph↗

arXiv2025

Governance as a complex, networked, democratic, satisfiability problem

Democratic governments comprise a subset of a population whose goal is to produce coherent decisions, solving societal challenges while respecting the will of the people. New governance frameworks represent this as a social network rather than as a hierarchical pyramid with centralized authority. But how should this network be structured? We model the decisions a population must make as a satisfiability problem and the structure of information flow involved in decision-making as a social hypergraph. This framework allows to consider different governance structures, from dictatorships to direct democracy. Between these extremes, we find a regime of effective governance where small overlapping decision groups make specific decisions and share information. Effective governance allows even incoherent or polarized populations to make coherent decisions at low coordination costs. Beyond simulations, our conceptual framework can explore a wide range of governance strategies and their ability to tackle decision problems that challenge standard governments.

physics.soc-ph↗

arXiv2024

Reconstructing networks from simple and complex contagions

Network scientists often use complex dynamic processes to describe network contagions, but tools for fitting contagion models typically assume simple dynamics. Here, we address this gap by developing a nonparametric method to reconstruct a network and dynamics from a series of node states, using a model that breaks the dichotomy between simple pairwise and complex neighborhood-based contagions. We then show that a network is more easily reconstructed when observed through the lens of complex contagions if it is dense or the dynamic saturates, and that simple contagions are better otherwise.

cs.SI↗

arXiv2024

A theoretical framework for reservoir computing on networks of organic electrochemical transistors

Efficient and accurate prediction of physical systems is important even when the rules of those systems cannot be easily learned. Reservoir computing, a type of recurrent neural network with fixed nonlinear units, is one such prediction method and is valued for its ease of training. Organic electrochemical transistors (OECTs) are physical devices with nonlinear transient properties that can be used as the nonlinear units of a reservoir computer. We present a theoretical framework for simulating reservoir computers using OECTs as the non-linear units as a test bed for designing physical reservoir computers. We present a proof of concept demonstrating that such an implementation can accurately predict the Lorenz attractor with comparable performance to standard reservoir computer implementations. We explore the effect of operating parameters and find that the prediction performance strongly depends on the pinch-off voltage of the OECTs.

cs.NE↗

arXiv2024

Stochastic diffusion using mean-field limits to approximate master equations

Stochastic diffusion is the noisy and uncertain process through which dynamics like epidemics, or agents like animal species, disperse over a larger area. Understanding these processes is becoming increasingly important as we attempt to better prepare for potential pandemics and as species ranges shift in response to climate change. Unfortunately, modeling of stochastic diffusion is mostly done through inaccurate deterministic tools that fail to capture the random nature of dispersal or else through expensive computational simulations. In particular, standard tools fail to fully capture the heterogeneity of the area over which this diffusion occurs. Rural areas with low population density require different epidemic models than urban areas; likewise, the edges of a species range require us to explicitly track low integer numbers of individuals rather than vague averages. In this work, we introduce a series of new tools called "mean-FLAME" models that track stochastic dispersion using approximate master equations that explicitly follow the probability distribution of an area of interest over all of its possible states, up to states that are active enough to be approximated using a mean-field model. In one limit, this approach is locally exact if we explicitly track enough states, and in the other limit collapses back to traditional deterministic models if we track no state explicitly. Applying this approach, we show how deterministic tools fail to capture the uncertainty around the speed of nonlinear dynamical processes. This is especially true for marginal areas that are close to unsuitable for diffusion, like the edge of a species range or epidemics in small populations. Capturing the uncertainty in such areas is key to producing accurate forecasts and guiding potential interventions.

q-bio.PE↗

arXiv2023

Filtering higher-order datasets

Many complex systems often contain interactions between more than two nodes, known as higher-order interactions, which can change the structure of these systems in significant ways. Researchers often assume that all interactions paint a consistent picture of a higher-order dataset's structure. In contrast, the connection patterns of individuals or entities in empirical systems are often stratified by interaction size. Ignoring this fact can aggregate connection patterns that exist only at certain scales of interaction. To isolate these scale-dependent patterns, we present an approach for analyzing higher-order datasets by filtering interactions by their size. We apply this framework to several empirical datasets from three domains to demonstrate that data practitioners can gain valuable information from this approach.

physics.soc-ph↗

arXiv2023

Opinion disparity in hypergraphs with community structure

The division of a social group into subgroups with opposing opinions, which we refer to as opinion disparity, is a prevalent phenomenon in society. This phenomenon has been modeled by including mechanisms such as opinion homophily, bounded confidence interactions, and social reinforcement mechanisms. In this paper we study a complementary mechanism for the formation of opinion disparity based on higher-order interactions, i.e., simultaneous interactions between multiple agents. We present an extension of the planted partition model for uniform hypergraphs as a simple model of community structure and consider the hypergraph SIS model on a hypergraph with two communities where the binary ideology can spread via links (pairwise interactions) and triangles (three-way interactions). We approximate this contagion process with a mean-field model and find that for strong enough community structure, the two communities can hold very different average opinions. We determine the regimes of structural and infectious parameters for which this opinion disparity can exist and find that the existence of these disparities is much more sensitive to the triangle community structure than to the link community structure. We show that the existence and type of opinion disparities are extremely sensitive to differences in the sizes of the two communities.

physics.soc-ph↗

arXiv2023

On limitations of uniplex networks for modeling multiplex contagion

Many network contagion processes are inherently multiplex in nature, yet are often reduced to processes on uniplex networks in analytic practice. We therefore examine how data modeling choices can affect the predictions of contagion processes. We demonstrate that multiplex contagion processes are not simply the union of contagion processes over their constituent uniplex networks. We use multiplex network data from two different contexts -- (1) a behavioral network to represent their potential for infectious disease transmission using a "simple" epidemiological model, and (2) users from online social network sites to represent their potential for information spread using a threshold-based "complex" contagion process. Our results show that contagion on multiplex data is not captured accurately in models developed from the uniplex networks even when they are combined, and that the nature of the differences between the (combined) uniplex and multiplex results depends on the specific spreading process over these networks.

physics.soc-ph↗

arXiv2022

Hypergraph assortativity: a dynamical systems perspective

The largest eigenvalue of the matrix describing a network's contact structure is often important in predicting the behavior of dynamical processes. We extend this notion to hypergraphs and motivate the importance of an analogous eigenvalue, the expansion eigenvalue, for hypergraph dynamical processes. Using a mean-field approach, we derive an approximation to the expansion eigenvalue in terms of the degree sequence for uncorrelated hypergraphs. We introduce a generative model for hypergraphs that includes degree assortativity, and use a perturbation approach to derive an approximation to the expansion eigenvalue for assortative hypergraphs. We define the dynamical assortativity, a dynamically sensible definition of assortativity for uniform hypergraphs, and describe how reducing the dynamical assortativity of hypergraphs through preferential rewiring can extinguish epidemics. We validate our results with both synthetic and empirical datasets.

physics.soc-ph↗