arXiv subjects

Mason A. Porter

Publications and source records attributed to Mason A. Porter.

At least 109 records · Page 6Linked to original sources

arXiv2019

Forecasting failure locations in two-dimensional disordered lattices

Forecasting fracture locations in a progressively failing disordered structure is of paramount importance when considering structural materials. We explore this issue for gradual deterioration via beam breakage of two-dimensional disordered lattices, which we represent as networks, for various values of mean degree. We study experimental samples with geometric structures that we construct based on observed contact networks in 2D granular media. We calculate geodesic edge betweenness centrality, which helps quantify which edges are on many shortest paths in a network, to forecast the failure locations. We demonstrate for the tested samples that, for a variety of failure behaviors, failures occur predominantly at locations that have larger geodesic edge betweenness values than the mean one in the structure. Because only a small fraction of edges have values above the mean, this is a relevant diagnostic to assess failure locations. Our results demonstrate that one can consider only specific parts of a system as likely failure locations and that, with reasonable success, one can assess possible failure locations of a structure without needing to study its detailed energetic states.

cond-mat.soft↗

arXiv2019

Stochastic Block Models are a Discrete Surface Tension

Networks, which represent agents and interactions between them, arise in myriad applications throughout the sciences, engineering, and even the humanities. To understand large-scale structure in a network, a common task is to cluster a network's nodes into sets called "communities", such that there are dense connections within communities but sparse connections between them. A popular and statistically principled method to perform such clustering is to use a family of generative models known as stochastic block models (SBMs). In this paper, we show that maximum likelihood estimation in an SBM is a network analog of a well-known continuum surface-tension problem that arises from an application in metallurgy. To illustrate the utility of this relationship, we implement network analogs of three surface-tension algorithms, with which we successfully recover planted community structure in synthetic networks and which yield fascinating insights on empirical networks that we construct from hyperspectral videos.

cs.SI↗

arXiv2019

Log-minor distributions and an application to estimating mean subsystem entropy

A common task in physics, information theory, and other fields is the analysis of properties of subsystems of a given system. Given the covariance matrix $M$ of a system of $n$ coupled variables, the covariance matrices of the subsystems are principal submatrices of $M$. The rapid growth with $n$ of the set of principal submatrices makes it impractical to exhaustively study each submatrix for even modestly-sized systems. It is therefore of great interest to derive methods for approximating the distributions of important submatrix properties for a given matrix. Motivated by the importance of differential entropy as a systemic measure of disorder, we study the distribution of log-determinants of principal $k\times k$ submatrices when the covariance matrix has bounded condition number. We derive upper bounds for the right tail and the variance of the distribution of minors, and we use these in turn to derive upper bounds on the standard error of the sample mean of subsystem entropy. Our results demonstrate that, despite the rapid growth of the set of subsystems with $n$, the number of samples that are needed to bound the sampling error is asymptotically independent of $n$. Instead, it is sufficient to increase the number of samples in linear proportion to $k$ to achieve a desired sampling accuracy.

math.PR↗

arXiv2018

Relating modularity maximization and stochastic block models in multilayer networks

Characterizing large-scale organization in networks, including multilayer networks, is one of the most prominent topics in network science and is important for many applications. One type of mesoscale feature is community structure, in which sets of nodes are densely connected internally but sparsely connected to other dense sets of nodes. Two of the most popular approaches for community detection are to maximize an objective function called "modularity" and to perform statistical inference using stochastic block models. Generalizing work by Newman on monolayer networks (Physical Review E 94, 052315), we show in multilayer networks that maximizing modularity is equivalent, under certain conditions, to maximizing the posterior probability of community assignments under a suitably chosen stochastic block model. We derive versions of this equivalence for various types of multilayer structure, including temporal, multiplex, and multilevel networks. We consider cases in which the key parameters are constant, as well as ones in which they vary across layers; in the latter case, this yields a novel, layer-weighted version of the modularity function. Our results also help address a longstanding difficulty of multilayer modularity-maximization algorithms, which require the specification of two sets of tuning parameters that have been difficult to choose in practice. We show how to perform this parameter selection in a statistically-grounded way, and we demonstrate the effectiveness of our approach on both synthetic and empirical networks.

cs.SI↗

arXiv2018

Hipsters on Networks: How a Small Group of Individuals Can Lead to an Anti-Establishment Majority

The spread of opinions, memes, diseases, and "alternative facts" in a population depends both on the details of the spreading process and on the structure of the social and communication networks on which they spread. In this paper, we explore how \textit{anti-establishment} nodes (e.g., \textit{hipsters}) influence the spreading dynamics of two competing products. We consider a model in which spreading follows a deterministic rule for updating node states (which describe which product has been adopted) in which an adjustable fraction $p_{\rm Hip}$ of the nodes in a network are hipsters, who choose to adopt the product that they believe is the less popular of the two. The remaining nodes are conformists, who choose which product to adopt by considering which products their immediate neighbors have adopted. We simulate our model on both synthetic and real networks, and we show that the hipsters have a major effect on the final fraction of people who adopt each product: even when only one of the two products exists at the beginning of the simulations, a very small fraction of hipsters in a network can still cause the other product to eventually become the more popular one. To account for this behavior, we construct an approximation for the steady-state adoption fraction on $k$-regular trees in the limit of few hipsters. Additionally, our simulations demonstrate that a time delay $τ$ in the knowledge of the product distribution in a population, as compared to immediate knowledge of product adoption among nearest neighbors, can have a large effect on the final distribution of product adoptions. Our simple model and analysis may help shed light on the road to success for anti-establishment choices in elections, as such success can arise rather generically in our model from a small number of anti-establishment individuals and ordinary processes of social influence on normal individuals.

physics.soc-ph↗

arXiv2018

The use of multilayer network analysis in animal behaviour

Network analysis has driven key developments in research on animal behaviour by providing quantitative methods to study the social structures of animal groups and populations. A recent formalism, known as \emph{multilayer network analysis}, has advanced the study of multifaceted networked systems in many disciplines. It offers novel ways to study and quantify animal behaviour as connected 'layers' of interactions. In this article, we review common questions in animal behaviour that can be studied using a multilayer approach, and we link these questions to specific analyses. We outline the types of behavioural data and questions that may be suitable to study using multilayer network analysis. We detail several multilayer methods, which can provide new insights into questions about animal sociality at individual, group, population, and evolutionary levels of organisation. We give examples for how to implement multilayer methods to demonstrate how taking a multilayer approach can alter inferences about social structure and the positions of individuals within such a structure. Finally, we discuss caveats to undertaking multilayer network analysis in the study of animal social networks, and we call attention to methodological challenges for the application of these approaches. Our aim is to instigate the study of new questions about animal sociality using the new toolbox of multilayer network analysis.

q-bio.PE↗

arXiv2018

Multivariate Spatiotemporal Hawkes Processes and Network Reconstruction

There is often latent network structure in spatial and temporal data and the tools of network analysis can yield fascinating insights into such data. In this paper, we develop a nonparametric method for network reconstruction from spatiotemporal data sets using multivariate Hawkes processes. In contrast to prior work on network reconstruction with point-process models, which has often focused on exclusively temporal information, our approach uses both temporal and spatial information and does not assume a specific parametric form of network dynamics. This leads to an effective way of recovering an underlying network. We illustrate our approach using both synthetic networks and networks constructed from real-world data sets (a location-based social media network, a narrative of crime events, and violent gang crimes). Our results demonstrate that, in comparison to using only temporal data, our spatiotemporal approach yields improved network reconstruction, providing a basis for meaningful subsequent analysis --- such as community structure and motif analysis --- of the reconstructed networks.

cs.SI↗

arXiv2018

Nanoptera in a Period-2 Toda Chain

We study asymptotic solutions to a singularly-perturbed, period-2 Toda lattice and use exponential asymptotics to examine `nanoptera', which are nonlocal solitary waves with constant-amplitude, exponentially small wave trains. With this approach, we isolate the exponentially small, constant-amplitude waves, and we elucidate the dynamics of these waves in terms of the Stokes phenomenon. We find a simple asymptotic expression for the waves, and we study configurations in which these waves vanish, producing localized solitary-wave solutions. In the limit of small mass ratio, we derive a simple anti-resonance condition for the manifestation these wave-free solutions.

nlin.PS↗

arXiv2018

The Role of Network Analysis in Industrial and Applied Mathematics

Many problems in industry --- and in the social, natural, information, and medical sciences --- involve discrete data and benefit from approaches from subjects such as network science, information theory, optimization, probability, and statistics. The study of networks is concerned explicitly with connectivity between different entities, and it has become very prominent in industrial settings, an importance that has intensified amidst the modern data deluge. In this commentary, we discuss the role of network analysis in industrial and applied mathematics, and we give several examples of network science in industry. We focus, in particular, on discussing a physical-applied-mathematics approach to the study of networks. We also discuss several of our own collaborations with industry on projects in network analysis.

cs.SI↗

arXiv2018

Effect of antipsychotics on community structure in functional brain networks

Schizophrenia, a mental disorder that is characterized by abnormal social behavior and failure to distinguish one's own thoughts and ideas from reality, has been associated with structural abnormalities in the architecture of functional brain networks. Using various methods from network analysis, we examine the effect of two classical therapeutic antipsychotics --- Aripiprazole and Sulpiride --- on the structure of functional brain networks of healthy controls and patients who have been diagnosed with schizophrenia. We compare the community structures of functional brain networks of different individuals using mesoscopic response functions, which measure how community structure changes across different scales of a network. We are able to do a reasonably good job of distinguishing patients from controls, and we are most successful at this task on people who have been treated with Aripiprazole. We demonstrate that this increased separation between patients and controls is related only to a change in the control group, as the functional brain networks of the patient group appear to be predominantly unaffected by this drug. This suggests that Aripiprazole has a significant and measurable effect on community structure in healthy individuals but not in individuals who are diagnosed with schizophrenia. In contrast, we find for individuals are given the drug Sulpiride that it is more difficult to separate the networks of patients from those of controls. Overall, we observe differences in the effects of the drugs (and a placebo) on community structure in patients and controls and also that this effect differs across groups. We thereby demonstrate that different types of antipsychotic drugs selectively affect mesoscale structures of brain networks, providing support that mesoscale structures such as communities are meaningful functional units in the brain.

physics.med-ph↗

arXiv2018

Topological data analysis of continuum percolation with disks

We study continuum percolation with disks, a variant of continuum percolation in two-dimensional Euclidean space, by applying tools from topological data analysis. We interpret each realization of continuum percolation with disks as a topological subspace of $[0,1]^2$ and investigate its topological features across many realizations. We apply persistent homology to investigate topological changes as we vary the number and radius of disks. We observe evidence that the longest persisting invariant is born at or near the percolation transition.

cond-mat.stat-mech↗

arXiv2018

Variability in Fermi--Pasta--Ulam--Tsingou Arrays Prevents Recurrences

In 1955, Fermi, Pasta, Ulam, and Tsingou reported recurrence over time of energy between modes in a one-dimensional array of nonlinear oscillators. Subsequently, there have been myriad numerical experiments using homogenous FPUT arrays, which consist of chains of ideal, nonlinearly-coupled oscillators. However, inherent variations --- e.g., due to manufacturing tolerance --- introduce heterogeneity into the parameters of any physical system. We demonstrate that such tolerances degrade the observance of recurrence, often leading to complete loss in moderately sized arrays. We numerically simulate heterogeneous FPUT systems to investigate the effects of tolerances on dynamics. Our results illustrate that tolerances in real nonlinear oscillator arrays may limit the applicability of results from numerical experiments on them to physical systems, unless appropriate heterogeneities are taken into account.

nlin.PS↗

arXiv2018

Quasiperiodic granular chains and Hofstadter butterflies

We study quasiperiodicity-induced localization of waves in strongly precompressed granular chains. We propose three different setups, inspired by the Aubry--André (AA) model, of quasiperiodic chains; and we use these models to compare the effects of on-site and off-site quasiperiodicity in nonlinear lattices. When there is purely on-site quasiperiodicity, which we implement in two different ways, we show for a chain of spherical particles that there is a localization transition (as in the original AA model). However, we observe no localization transition in a chain of cylindrical particles in which we incorporate quasiperiodicity in the distribution of contact angles between adjacent cylinders by making the angle periodicity incommensurate with that of the chain. For each of our three models, we compute the Hofstadter spectrum and the associated Minkowski--Bouligand fractal dimension, and we demonstrate that the fractal dimension decreases as one approaches the localization transition (when it exists). Finally, in a suite of numerical computations, we demonstrate both localization and that there exist regimes of ballistic, superdiffusive, diffusive, and subdiffusive transport. Our models provide a flexible set of systems to study quasiperiodicity-induced analogs of Anderson phenomena in granular chains that one can tune controllably from weakly to strongly nonlinear regimes.

nlin.PS↗

arXiv2018

Nonlinear Excitations in Magnetic Lattices with Long-Range Interactions

We study - experimentally, theoretically, and numerically - nonlinear excitations in lattices of magnets with long-range interactions. We examine breather solutions, which are spatially localized and periodic in time, in a chain with algebraically-decaying interactions. It was established two decades ago [S. Flach, Phys. Rev. E 58, R4116 (1998)] that lattices with long-range interactions can have breather solutions in which the spatial decay of the tails has a crossover from exponential to algebraic decay. In this Letter, we revisit this problem in the setting of a chain of repelling magnets with a mass defect and verify, both numerically and experimentally, the existence of breathers with such a crossover.

nlin.PS↗

arXiv2017

Community detection in temporal multilayer networks, with an application to correlation networks

Networks are a convenient way to represent complex systems of interacting entities. Many networks contain "communities" of nodes that are more densely connected to each other than to nodes in the rest of the network. In this paper, we investigate the detection of communities in temporal networks represented as multilayer networks. As a focal example, we study time-dependent financial-asset correlation networks. We first argue that the use of the "modularity" quality function---which is defined by comparing edge weights in an observed network to expected edge weights in a "null network"---is application-dependent. We differentiate between "null networks" and "null models" in our discussion of modularity maximization, and we highlight that the same null network can correspond to different null models. We then investigate a multilayer modularity-maximization problem to identify communities in temporal networks. Our multilayer analysis only depends on the form of the maximization problem and not on the specific quality function that one chooses. We introduce a diagnostic to measure \emph{persistence} of community structure in a multilayer network partition. We prove several results that describe how the multilayer maximization problem measures a trade-off between static community structure within layers and larger values of persistence across layers. We also discuss some computational issues that the popular "Louvain" heuristic faces with temporal multilayer networks and suggest ways to mitigate them.

physics.soc-ph↗

arXiv2017

Inferring parameters of prey switching in a plankton 1 predator--2 prey system with a linear preference tradeoff

We construct two ordinary-differential-equation models of a predator feeding adaptively on two prey types, and we evaluate the models' ability to fit data on freshwater plankton. We model the predator's switch from one prey to the other in two different ways: (1) smooth switching using a hyperbolic tangent function; and (2) by incorporating a parameter that changes abruptly across the switching boundary as a system variable that is coupled to the population dynamics. We conduct linear stability analyses, use approximate Bayesian computation (ABC) combined with a population Monte Carlo (PMC) method to fit model parameters, and compare model predictions quantitatively to data for ciliate predators and their two algal prey groups collected from Lake Constance on the German--Swiss--Austrian border. We show that the two models fit the data well when the smooth transition is steep, supporting the simplifying assumption of a discontinuous prey switching behavior for this scenario. We thus conclude that prey switching is a possible mechanistic explanation for the observed ciliate--algae dynamics in Lake Constance in spring, but that these data cannot distinguish between the details of prey switching that are encoded in these different models.

math.DS↗

arXiv2017

Network Analysis of Particles and Grains

The arrangements of particles and forces in granular materials have a complex organization on multiple spatial scales that ranges from local structures to mesoscale and system-wide ones. This multiscale organization can affect how a material responds or reconfigures when exposed to external perturbations or loading. The theoretical study of particle-level, force-chain, domain, and bulk properties requires the development and application of appropriate physical, mathematical, statistical, and computational frameworks. Traditionally, granular materials have been investigated using particulate or continuum models, each of which tends to be implicitly agnostic to multiscale organization. Recently, tools from network science have emerged as powerful approaches for probing and characterizing heterogeneous architectures across different scales in complex systems, and a diverse set of methods have yielded fascinating insights into granular materials. In this paper, we review work on network-based approaches to studying granular matter and explore the potential of such frameworks to provide a useful description of these systems and to enhance understanding of their underlying physics. We also outline a few open questions and highlight particularly promising future directions in the analysis and design of granular matter and other kinds of material networks.

cond-mat.soft↗

arXiv2017

Frequency-based brain networks: From a multiplex framework to a full multilayer description

We explore how to study dynamical interactions between brain regions using functional multilayer networks whose layers represent the different frequency bands at which a brain operates. Specifically, we investigate the consequences of considering the brain as a multilayer network in which all brain regions can interact with each other at different frequency bands, instead of as a multiplex network, in which interactions between different frequency bands are only allowed within each brain region and not between them. We study the second smallest eigenvalue of the combinatorial supra-Laplacian matrix of the multilayer network in detail, and we thereby show that the heterogeneity of interlayer edges and, especially, the fraction of missing edges crucially modify the spectral properties of the multilayer network. We illustrate our results with both synthetic network models and real data sets obtained from resting state magnetoencephalography. Our work demonstrates an important issue in the construction of frequency-based multilayer brain networks.

q-bio.NC↗