"Long-Time and Short-Time Dynamics in a Weighted-Median Opinion Model on Networks"

One of my papers was published in final form late last month. Here are some details.

Title: Long-Time and Short-Time Dynamics in a Weighted-Median Opinion Model on Networks

Authors: Lasse Mohr, Poul G. Hjorth, and Mason A. Porter

Abstract: Social interactions influence people's opinions. In some situations, these interactions eventually yield a consensus opinion; in others, they can lead to opinion fragmentation and the formation of different opinion groups in the form of "echo chambers". Consider a social network of individuals with continuous-valued scalar opinions, and suppose that they can change their opinions when they interact with each other. In many models of the opinion dynamics of individuals in a network, it is common for opinion updates to depend on the mean opinion of interacting individuals. As an alternative, which may be more realistic in some situations, we study an opinion model with an opinion-update rule that depends on the weighted median of the opinions of interacting individuals. Through numerical simulations of our median-update opinion model, we investigate how the final opinion distribution depends on network structure. For configuration-model networks, we derive a mean-field approximation of the asymptotic dynamics of the opinion distribution when there are infinitely many individuals. We numerically investigate its accuracy for short-time opinion dynamics on various networks.

What Happens in Boston Stays in Boston

I am off to Boston to speak in the satellite conference on Physical Networks at the 2026 NetSci conference. (It's my triumphant return to NetSci!) As usual, I also helped organize the satellite conference on Network Science in Education (NetSciEd 2026).

"Clustering-Induced Localization of Quantum Walks on Networks"

One of my papers came out in published form today. Here are some details.

Title: Clustering-Induced Localization of Quantum Walks on Networks

Authors: Lucas Böttcher and Mason A. Porter

"Bounded-Confidence Models of Opinion Dynamics with Neighborhood Effects"

One of my papers just came out in final form. Here are some details.

"Dynamical Processes on Metric Networks"

A paper of mine was just published in final form. Here are some details.

Title: Dynamical Processes on Metric Networks

Authors: Lucas Böttcher and Mason A. Porter

"Oscillatory and Excitable Dynamics in an Opinion Model with Group Opinions"

The published version of one of my papers just came out today. Here are some details.

Title: Oscillatory and Excitable Dynamics in an Opinion Model with Group Opinions

Authors: Corbit R. Sampson, Juan G. Restrepo, and Mason A. Porter

Abstract:

"Dynamical Importance and Network Perturbations"

One of my papers was just published in final form. Here are some details.

Title: Dynamical Importance and Network Perturbations

Authors: Ethan Young and Mason A. Porter

Abstract: The leading eigenvalue λ of the adjacency matrix of a graph exerts much influence on the behavior of dynamical processes on that graph. It is thus relevant to relate notions of importance of network structures to λ and its associated eigenvectors. We study a previously derived measure of edge importance known as “dynamical importance,” which estimates how much λ changes when one removes an edge from a graph or adds an edge to it. We examine the accuracy of this estimate for several undirected network structures and compare it to the relative change in λ after an edge removal or edge addition. We then derive a first-order approximation of the change in the leading eigenvector. We also consider the effects of edge additions on Kuramoto dynamics on networks, and we express the Kuramoto order parameter in terms of dynamical importance. Through our analysis and computational experiments, we find that studying dynamical importance can improve understanding of the relationship between network perturbations and dynamical processes on networks.

"Oscillatory Networks: Insights from Piecewise-Linear Modeling"

Another of my papers just appeared in final form. Here are some details.

Title: Oscillatory Networks: Insights from Piecewise-Linear Modeling

Authors: Stephen Coombes, Mustafa Şayli, Rüdiger Thul, Rachel Nicks, Mason A. Porter, and Yi Ming Lai

Dedication: We dedicate this paper to the memory of our dear friend and colleague Yi Ming Lai. Although he began with us on the journey to write this paper, which in part reviews some of his research activity in recent years, sadly he did not end that journey with us. RIP Yi Ming Lai 1988–2022.

Abstract: There is enormous interest—both mathematically and in diverse applications—in understanding the dynamics of coupled-oscillator networks. The real-world motivation of such networks arises from studies of the brain, the heart, ecology, and more. It is common to describe the rich emergent behavior in these systems in terms of complex patterns of network activity that reflect both the connectivity and the nonlinear dynamics of the network components. Such behavior is often organized around phase-locked periodic states and their instabilities. However, the explicit calculation of periodic orbits in nonlinear systems (even in low dimensions) is notoriously hard, so network-level insights often require the numerical construction of some underlying periodic component. In this paper, we review powerful techniques for studying coupled-oscillator networks. We discuss phase reductions, phase–amplitude reductions, and the master stability function for smooth dynamical systems. We then focus, in particular, on the augmentation of these methods to analyze piecewise-linear systems, for which one can readily construct periodic orbits. This yields useful insights into network behavior, but the cost is that one needs to study nonsmooth dynamical systems. The study of nonsmooth systems is well developed when focusing on the interacting units (i.e., at the node level) of a system, and we give a detailed presentation of how to use saltation operators, which can treat the propagation of perturbations through switching manifolds, to understand dynamics and bifurcations at the network level. We illustrate this merger of tools and techniques from network science and nonsmooth dynamical systems with applications to neural systems, cardiac systems, networks of electromechanical oscillators, and cooperation in cattle herds.

What Happens in Seoul Stays in Seoul (2024 Edition)

I am off to Seoul to speak in a workshop on Theoretical Challenges in Network Science! I really enjoy visiting Seoul, and I am very happy to have another chance to visit.

"Adapting InfoMap to Absorbing Random Walks Using Absorption-Scaled Graphs"

One of my papers just came out in final published form. Here are some details.

Title: Adapting InfoMap to Absorbing Random Walks Using Absorption-Scaled Graphs

Authors: Esteban Vargas Bernal, Mason A. Porter, and Joseph H. Tien

Abstract: InfoMap is a popular approach to detect densely connected "communities" of nodes in networks. To detect such communities, InfoMap uses random walks and ideas from information theory. Motivated by the dynamics of disease spread on networks, whose nodes can have heterogeneous disease-removal rates, we adapt InfoMap to absorbing random walks. To do this, we use absorption-scaled graphs (in which edge weights are scaled according to absorption rates) and Markov time sweeping. One of our adaptations of InfoMap converges to the standard version of InfoMap in the limit in which the node-absorption rates approach 0. We demonstrate that the community structure that one obtains using our adaptations of InfoMap can differ markedly from the community structure that one detects using methods that do not account for node-absorption rates. We also illustrate that the community structure that is induced by heterogeneous absorption rates can have important implications for susceptible–infected–recovered (SIR) dynamics on ring-lattice networks. For example, in some situations, the outbreak duration is maximized when a moderate number of nodes have large node-absorption rates.

What Happens in Frankfurt Stays in Frankfurt

I am going to be in Frankfurt for a few days for a workshop on metric networks that I coorganized.

"Inference of Interaction Kernels in Mean-Field Models of Opinion Dynamics"

A paper of mine just came out in final form. Here are some details about it.

Title: Inference of Interaction Kernels in Mean-Field Models of Opinion Dynamics

Authors: Weiqi Chu, Qin Li, and Mason A. Porter

Abstract: In models of opinion dynamics, many parameters — either in the form of constants or in the form of functions — play a critical role in describing, calibrating, and forecasting how opinions change with time. When examining a model of opinion dynamics, it is beneficial to infer its parameters using empirical data. In this paper, we study an example of such an inference problem. We consider a mean-field bounded-confidence model with an unknown interaction kernel between individuals. This interaction kernel encodes how individuals with different opinions interact and affect each other's opinions. Because it is often difficult to quantitatively measure opinions as empirical data from observations or experiments, we assume that the available data takes the form of partial observations of a cumulative distribution function of opinions. We prove that certain measurements guarantee a precise and unique inference of the interaction kernel and propose a numerical method to reconstruct an interaction kernel from a limited number of data points. Our numerical results suggest that the error of the inferred interaction kernel decays exponentially as we strategically enlarge the data set.

"Complex Networks with Complex Weights"

The published version of one of my papers came out today. Its title is one of my favorites among all of the papers that I've ever written. Here are some details about the paper.

Title: Complex Networks with Complex Weights

Authors: Lucas Böttcher and Mason A. Porter

Abstract: In many studies, it is common to use binary (i.e., unweighted) edges to examine networks of entities that are either adjacent or not adjacent. Researchers have generalized such binary networks to incorporate edge weights, which allow one to encode node–node interactions with heterogeneous intensities or frequencies (e.g., in transportation networks, supply chains, and social networks). Most such studies have considered real-valued weights, despite the fact that networks with complex weights arise in fields as diverse as quantum information, quantum chemistry, electrodynamics, rheology, and machine learning. Many of the standard network-science approaches in the study of classical systems rely on the real-valued nature of edge weights, so it is necessary to generalize them if one seeks to use them to analyze networks with complex edge weights. In this paper, we examine how standard network-analysis methods fail to capture structural features of networks with complex edge weights. We then generalize several network measures to the complex domain and show that random-walk centralities provide a useful approach to examine node importances in networks with complex weights.

"Learning Low-Rank Latent Mesoscale Structures in Networks"

One of my papers came out in final form today. Here are some details.

Title: Learning Low-Rank Latent Mesoscale Structures in Networks

Authors: Hanbaek Lyu, Yacoub H. Kureh, Joshua Vendrow, and Mason A. Porter

Abstract: Researchers in many fields use networks to represent interactions between entities in complex systems. To study the large-scale behavior of complex systems, it is useful to examine mesoscale structures in networks as building blocks that influence such behavior. In this paper, we present an approach to describe low-rank mesoscale structures in networks. We find that many real-world networks possess a small set of latent motifs that effectively approximate most subgraphs at a fixed mesoscale. Such low-rank mesoscale structures allow one to reconstruct networks by approximating subgraphs of a network using combinations of latent motifs. Employing subgraph sampling and nonnegative matrix factorization enables the discovery of these latent motifs. The ability to encode and reconstruct networks using a small set of latent motifs has many applications in network analysis, including network comparison, network denoising, and edge inference.

"Minimizing Congestion in Single-Source, Single-Sink Queuing Networks"

Another of my papers has appeared in final form. Here are some details about it.

Title: Minimizing Congestion in Single-Source, Single-Sink Queuing Networks

Authors: Fabian Ying, Alisdair O. G. Wallis, Mason A. Porter, Sam D. Howison, and Mariano Beguerisse-Díaz

Abstract: Motivated by the modeling of customer mobility and congestion in supermarkets, we study queueing networks with a single source and a single sink. We assume that walkers traverse a network according to an unbiased random walk, and we analyze how network topology affects the total mean queue size Q, which we use to measure congestion. We examine network topologies that minimize Q and provide proofs of optimality for some cases and numerical evidence of optimality for others. Finally, we present greedy algorithms that add edges to and delete edges from a network to reduce Q, and we apply these algorithms to a network that we construct using a supermarket store layout. We find that these greedy algorithms, which typically tend to add edges to the sink node, are able to significantly reduce Q. Our work helps improve understanding of how to design networks with low congestion and how to amend networks to reduce congestion.

"Bounded-Confidence Model of Opinion Dynamics with Heterogeneous Node-Activity Levels"

One of my papers came out in final form today. Here are some details.

Title: Bounded-Confidence Model of Opinion Dynamics with Heterogeneous Node-Activity Levels

Authors: Grace J. Li and Mason A. Porter

Abstract: Agent-based models of opinion dynamics allow one to examine the spread of opinions between entities and to study phenomena such as consensus, polarization, and fragmentation. By studying models of opinion dynamics on social networks, one can explore the effects of network structure on these phenomena. In social networks, some individuals share their ideas and opinions more frequently than others. These disparities can arise from heterogeneous sociabilities, heterogeneous activity levels, different prevalences to share opinions when engaging in a social-media platform, or something else. To examine the impact of such heterogeneities on opinion dynamics, we generalize the Deffuant-Weisbuch (DW) bounded-confidence model (BCM) of opinion dynamics by incorporating node weights. The node weights allow us to model agents with different probabilities of interacting. Using numerical simulations, we systematically investigate (using a variety of network structures and node-weight distributions) the effects of node weights, which we assign uniformly at random to the nodes. We demonstrate that introducing heterogeneous node weights results in longer convergence times and more opinion fragmentation than in a baseline DW model. The node weights in our BCM allow one to consider a variety of sociological scenarios in which agents have heterogeneous probabilities of interacting with other agents.

"Networks of Necessity: Simulating COVID-19 Mitigation Strategies for Disabled People and Their Caregivers"

One of my papers just came out in final form. Here are some details.

Title: Networks of Necessity: Simulating COVID-19 Mitigation Strategies for Disabled People and Their Caregivers

Authors: Thomas E. Valles, Hannah Shoenhard, Joseph Zinski, Sarah Trick, Mason A. Porter, and Michael R. Lindstrom

Abstract: A major strategy to prevent the spread of COVID-19 is the limiting of in-person contacts. However, limiting contacts is impractical or impossible for the many disabled people who do not live in care facilities but still require caregivers to assist them with activities of daily living. We seek to determine which interventions can best prevent infections of disabled people and their caregivers. To accomplish this, we simulate COVID-19 transmission with a compartmental model that includes susceptible, exposed, asymptomatic, symptomatically ill, hospitalized, and removed/recovered individuals. The networks on which we simulate disease spread incorporate heterogeneity in the risk levels of different types of interactions, time-dependent lockdown and reopening measures, and interaction distributions for four different groups (caregivers, disabled people, essential workers, and the general population). Of these groups, we find that the probability of becoming infected is largest for caregivers and second largest for disabled people. Consistent with this finding, our analysis of network structure illustrates that caregivers have the largest modal eigenvector centrality of the four groups. We find that two interventions—contact-limiting by all groups and mask-wearing by disabled people and caregivers—most reduce the number of infections in disabled and caregiver populations. We also test which group of people spreads COVID-19 most readily by seeding infections in a subset of each group and comparing the total number of infections as the disease spreads. We find that caregivers are the most potent spreaders of COVID-19, particularly to other caregivers and to disabled people. We test where to use limited infection-blocking vaccine doses most effectively and find that (1) vaccinating caregivers better protects disabled people from infection than vaccinating the general population or essential workers and that (2) vaccinating caregivers protects disabled people from infection about as effectively as vaccinating disabled people themselves. Our results highlight the potential effectiveness of mask-wearing, contact-limiting throughout society, and strategic vaccination for limiting the exposure of disabled people and their caregivers to COVID-19.

"In-Degree Centrality in a Social Network is Linked to Coordinated Neural Activity"

Another paper of mine was just published in final form. Here are some details.

Title: In-Degree Centrality in a Social Network is Linked to Coordinated Neural Activity

Authors: Elisa C. Baek, Ryan Hyon, Karina López, Emily S. Finn, Mason A. Porter, and Carolyn Parkinson

Abstract: Convergent processing of the world may be a factor that contributes to social connectedness. We use neuroimaging and network analysis to investigate the association between the social-network position (as measured by in-degree centrality) of first-year university students and their neural similarity while watching naturalistic audio-visual stimuli (specifically, videos). There were 119 students in the social-network study; 63 of them participated in the neuroimaging study. We show that more central individuals had similar neural responses to their peers and to each other in brain regions that are associated with high-level interpretations and social cognition (e.g., in the default mode network), whereas less-central individuals exhibited more variable responses. Self-reported enjoyment of and interest in stimuli followed a similar pattern, but accounting for these data did not change our main results. These findings show that neural processing of external stimuli is similar in highly-central individuals but is idiosyncratic in less-central individuals.

"A Bounded-Confidence Model of Opinion Dynamics on Hypergraphs"

A new paper of mine just came out in final form. Here are some details about it.

Title: A Bounded-Confidence Model of Opinion Dynamics on Hypergraphs

Authors: Abigail Hickok, Yacoub Kureh, Heather Z. Brooks, Michelle Feng, and Mason A. Porter

Abstract: People's opinions evolve with time as they interact with their friends, family, colleagues, and others. In the study of opinion dynamics on networks, one often encodes interactions between people in the form of dyadic relationships, but many social interactions in real life are polyadic (i.e., they involve three or more people). In this paper, we extend an asynchronous bounded-confidence model (BCM) on graphs, in which nodes are connected pairwise by edges, to an asynchronous BCM on hypergraphs, in which arbitrarily many nodes can be connected by a single hyperedge. We show that our hypergraph BCM converges to consensus for a wide range of initial conditions for the opinions of the nodes, including for nonuniform and asymmetric initial opinion distributions. We also show that, under suitable conditions, echo chambers can form on hypergraphs with community structure. We demonstrate that the opinions of nodes can sometimes jump from one opinion cluster to another in a single time step; this phenomenon (which we call ``opinion jumping") is not possible in standard dyadic BCMs. Additionally, we observe a phase transition in the convergence time of our BCM on a complete hypergraph when the variance $\sigma^2$ of the initial opinion distribution equals the confidence bound $c$. We prove that the convergence time grows at least exponentially fast with the number of nodes when $\sigma^2 > c$ and the initial opinions are normally distributed. Therefore, to determine the convergence properties of our hypergraph BCM when the variance and the number of hyperedges are both large, it is necessary to use analytical methods instead of relying only on Monte Carlo simulations.

"Epidemic Thresholds of Infectious Diseases on Tie-Decay Networks"

Another paper of mine has just been published in final form. (Technically, one could say that it's almost in final form; the issue number has been determined, but its stamp is not yet on the .pdf file as I write this blog entry because some other articles from the same issue haven't yet been published.) Here are some details.

Title: "Epidemic Thresholds of Infectious Diseases on Tie-Decay Networks"

Authors: Qinyi Chen and Mason A. Porter

Abstract: In the study of infectious diseases on networks, researchers calculate epidemic thresholds to help forecast whether or not a disease will eventually infect a large fraction of a population. Because network structure typically changes with time, which fundamentally influences the dynamics of spreading processes and in turn affects epidemic thresholds for disease propagation, it is important to examine epidemic thresholds in models of disease spread on temporal networks. Most existing studies of epidemic thresholds in temporal networks have focused on models in discrete time, but most real-world networked systems evolve continuously with time. In our work, we encode the continuous time-dependence of networks in the evaluation of the epidemic threshold of a susceptible–infected–susceptible (SIS) process by studying an SIS model on tie-decay networks. We derive the epidemic-threshold condition of this model, and we perform numerical experiments to verify it. We also examine how different factors—the decay coefficients of the tie strengths in a network, the frequency of the interactions between the nodes in the network, and the sparsity of the underlying social network on which interactions occur—lead to decreases or increases of the critical values of the threshold and hence contribute to facilitating or impeding the spread of a disease. We thereby demonstrate how the features of tie-decay networks alter the outcome of disease spread.