Search

It is common to use networks to encode the architecture of interactions between entities in complex systems in the physical, biological, social, and information sciences. 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. We present a new approach for describing low-rank mesoscale structures in networks, and we illustrate our approach using several synthetic network models and empirical friendship, collaboration, and protein--protein interaction (PPI) networks. We find that these networks possess a relatively small number of `latent motifs' that together can successfully approximate most subgraphs of a network at a fixed mesoscale. We use an algorithm for `network dictionary learning' (NDL), which combines a network-sampling method and nonnegative matrix factorization, to learn the latent motifs of a given network. The ability to encode a network using a set of latent motifs has a wide variety of applications to network-analysis tasks, such as comparison, denoising, and edge inference. Additionally, using a new network denoising and reconstruction (NDR) algorithm, we demonstrate how to denoise a corrupted network by using only the latent motifs that one learns directly from the corrupted network., Comment: 82 pages, 25 figures, 2 tables

The COVID-19 pandemic has led to significant changes in how people are currently living their lives. To determine how to best reduce the effects of the pandemic and start reopening societies, governments have drawn insights from mathematical models of the spread of infectious diseases. In this article, we give an introduction to a family of mathematical models (called "compartmental models") and discuss how the results of analyzing these models influence government policies and human behavior, such as encouraging mask wearing and physical distancing to help slow the spread of the disease., Comment: This article is for young readers (e.g., ages 12 and up)

Scientists use a mathematical subject called 'topology' to study the shapes of objects. An important part of topology is counting the numbers of pieces and holes in objects, and people use this information to group objects into different types. For example, a doughnut has the same number of holes and the same number of pieces as a teacup with one handle, but it is different from a ball. In studies that resemble activities like "connect the dots", scientists use ideas from topology to study the shape of data. Data can take many possible forms: a picture made of dots, a large collection of numbers from a scientific experiment, or something else. The approach in these studies is called 'topological data analysis', and it has been used to study the branching structures of veins in leaves, how people vote in elections, flight patterns in models of bird flocking, and more. Scientists can take data on the way veins branch on leaves and use topological data analysis to divide the leaves into different groups and discover patterns that may otherwise be hard to find., Comment: This article, which is under review in Frontiers for Young Minds, to introduce young readers (of ages roughly 12--14) to topological data analysis. We would appreciate receiving feedback from you and your children

We investigate a nonlinear version of coevolving voter models, in which node states and network structure update as a coupled stochastic dynamical process. Most prior work on coevolving voter models has focused on linear update rules with fixed and homogeneous rewiring and adopting probabilities. By contrast, in our nonlinear version, the probability that a node rewires or adopts is a function of how well it "fits in" within its neighborhood. To explore this idea, we incorporate a parameter $\sigma$ that represents the fraction of neighbors of an updating node that share its opinion state. In an update, with probability $\sigma^q$ (for some nonlinearity parameter $q$), the updating node rewires; with complementary probability $1-\sigma^q$, the updating node adopts a new opinion state. We study this mechanism using three rewiring schemes: after an updating node deletes a discordant edge, it then either (1) "rewires-to-random" by choosing a new neighbor in a random process; (2) "rewires-to-same" by choosing a new neighbor in a random process from nodes that share its state; or (3) "rewires-to-none" by not rewiring at all (akin to "unfriending" on social media). We compare our nonlinear coevolving model to several existing linear models, and we find in our model that initial network topology plays a larger role in the dynamics and the choice of rewiring mechanism plays a smaller role. A particularly interesting feature of our model is that, under certain conditions, the opinion state that is held initially by a minority of the nodes can effectively spread to almost every node in a network if the minority nodes view themselves as the majority. In light of this observation, we relate our results to recent work on the majority illusion in social networks.