arXiv subjects

Mason A. Porter

Publications and source records attributed to Mason A. Porter.

At least 163 records · Page 9Linked to original sources

arXiv2015

Null Models for Community Detection in Spatially-Embedded, Temporal Networks

In the study of networks, it is often insightful to use algorithms to determine mesoscale features such as "community structure", in which densely connected sets of nodes constitute "communities" that have sparse connections to other communities. The most popular way of detecting communities algorithmically is to optimize the quality function known as modularity. When optimizing modularity, one compares the actual connections in a (static or time-dependent) network to the connections obtained from a random-graph ensemble that acts as a null model. The communities are then the sets of nodes that are connected to each other densely relative to what is expected from the null model. Clearly, the process of community detection depends fundamentally on the choice of null model, so it is important to develop and analyze novel null models that take into account appropriate features of the system under study. In this paper, we investigate the effects of using null models that take incorporate spatial information, and we propose a novel null model based on the radiation model of population spread. We also develop novel synthetic spatial benchmark networks in which the connections between entities are based on distance or flux between nodes, and we compare the performance of both static and time-dependent radiation null models to the standard ("Newman-Girvan") null model for modularity optimization and a recently-proposed gravity null model. In our comparisons, we use both the above synthetic benchmarks and time-dependent correlation networks that we construct using countrywide dengue fever incidence data for Peru. We also evaluate a recently-proposed correlation null model, which was developed specifically for correlation networks that are constructed from time series, on the epidemic-correlation data.

physics.soc-ph↗

arXiv2014

Matchmaker, Matchmaker, Make Me a Match: Migration of Populations via Marriages in the Past

The study of human mobility is both of fundamental importance and of great potential value. For example, it can be leveraged to facilitate efficient city planning and improve prevention strategies when faced with epidemics. The newfound wealth of rich sources of data---including banknote flows, mobile phone records, and transportation data---has led to an explosion of attempts to characterize modern human mobility. Unfortunately, the dearth of comparable historical data makes it much more difficult to study human mobility patterns from the past. In this paper, we present an analysis of long-term human migration, which is important for processes such as urbanization and the spread of ideas. We demonstrate that the data record from Korean family books (called "jokbo") can be used to estimate migration patterns via marriages from the past 750 years. We apply two generative models of long-term human mobility to quantify the relevance of geographical information to human marriage records in the data, and we find that the wide variety in the geographical distributions of the clans poses interesting challenges for the direct application of these models. Using the different geographical distributions of clans, we quantify the "ergodicity" of clans in terms of how widely and uniformly they have spread across Korea, and we compare these results to those obtained using surname data from the Czech Republic. To examine population flow in more detail, we also construct and examine a population-flow network between regions. Based on the correlation between ergodicity and migration in Korea, we identify two different types of migration patterns: diffusive and convective. We expect the analysis of diffusive versus convective effects in population flows to be widely applicable to the study of mobility and migration patterns across different cultures.

physics.soc-ph↗

arXiv2014

Think Locally, Act Locally: The Detection of Small, Medium-Sized, and Large Communities in Large Networks

It is common in the study of networks to investigate meso-scale features to try to gain an understanding of network structure and function. For example, numerous algorithms have been developed to try to identify "communities," which are typically construed as sets of nodes with denser connections internally than with the remainder of a network. In this paper, we adopt a complementary perspective that "communities" are associated with bottlenecks of locally-biased dynamical processes that begin at seed sets of nodes, and we employ several different community-identification procedures (using diffusion-based and geodesic-based dynamics) to investigate community quality as a function of community size. Using several empirical and synthetic networks, we identify several distinct scenarios for ``size-resolved community structure'' that can arise in real (and realistic) networks. Depending on which scenario holds, one may or may not be able to successfully identify ``good'' communities in a given network, the manner in which different small communities fit together to form meso-scale network structures can be very different, and processes such as viral propagation and information diffusion can exhibit very different dynamics.In addition, our results suggest that, for many large realistic networks, the output of locally-biased methods that focus on communities that are centered around a given seed node might have better conceptual grounding and greater practical utility than the output of global community-detection methods. They also illustrate subtler structural properties that are important to consider in the development of better benchmark networks to test methods for community detection. [Note: Because of space limitations in the arXiv's abstract field, this is an abridged version of the paper's abstract.]

cs.SI↗

arXiv2014

Cross-Linked Structure of Network Evolution

We study the temporal co-variation of network co-evolution via the cross-link structure of networks, for which we take advantage of the formalism of hypergraphs to map cross-link structures back to network nodes. We investigate two sets of temporal network data in detail. In a network of coupled nonlinear oscillators, hyperedges that consist of network edges with temporally co-varying weights uncover the driving co-evolution patterns of edge weight dynamics both within and between oscillator communities. In the human brain, networks that represent temporal changes in brain activity during learning exhibit early co-evolution that then settles down with practice, and subsequent decreases in hyperedge size are consistent with emergence of an autonomous subgraph whose dynamics no longer depends on other parts of the network. Our results on real and synthetic networks give a poignant demonstration of the ability of cross-link structure to uncover unexpected co-evolution attributes in both real and synthetic dynamical systems. This, in turn, illustrates the utility of analyzing cross-links for investigating the structure of temporal networks.

cond-mat.dis-nn↗

arXiv2014

A Simple Generative Model of Collective Online Behaviour

Human activities increasingly take place in online environments, providing novel opportunities for relating individual behaviours to population-level outcomes. In this paper, we introduce a simple generative model for the collective behaviour of millions of social networking site users who are deciding between different software applications. Our model incorporates two distinct components: one is associated with recent decisions of users, and the other reflects the cumulative popularity of each application. Importantly, although various combinations of the two mechanisms yield long-time behaviour that is consistent with data, the only models that reproduce the observed temporal dynamics are those that strongly emphasize the recent popularity of applications over their cumulative popularity. This demonstrates---even when using purely observational data without experimental design---that temporal data-driven modelling can effectively distinguish between competing microscopic mechanisms, allowing us to uncover new aspects of collective online behaviour.

physics.soc-ph↗

arXiv2014

Convergence Time Towards Periodic Orbits in Discrete Dynamical Systems

We investigate the convergence towards periodic orbits in discrete dynamical systems. We examine the probability that a randomly chosen point converges to a particular neighborhood of a periodic orbit in a fixed number of iterations, and we use linearized equations to examine the evolution near that neighborhood. The underlying idea is that points of stable periodic orbit are associated with intervals. We state and prove a theorem that details what regions of phase space are mapped into these intervals (once they are known) and how many iterations are required to get there. We also construct algorithms that allow our theoretical results to be implemented successfully in practice.

math.DS↗

arXiv2014

Density-based and transport-based core-periphery structures in networks

Networks often possess mesoscale structures, and studying them can yield insights into both structure and function. It is most common to study community structure, but numerous other types of mesoscale structures also exist. In this paper, we examine core-periphery structures based on both density and transport. In such structures, core network components are well-connected both among themselves and to peripheral components, which are not well-connected to anything. We examine core-periphery structures in a wide range of examples of transportation, social, and financial networks---including road networks in large urban areas, a rabbit warren, a dolphin social network, a European interbank network, and a migration network between counties in the United States. We illustrate that a recently developed transport-based notion of node coreness is very useful for characterizing transportation networks. We also generalize this notion to examine core versus peripheral edges, and we show that the resulting diagnostic is also useful for transportation networks. To examine the properties of transportation networks further, we develop a family of generative models of roadlike networks. We illustrate the effect of the dimensionality of the embedding space on transportation networks, and we demonstrate that the correlations between different measures of coreness can be very different for different types of networks.

physics.soc-ph↗

arXiv2014

Multilayer Networks

In most natural and engineered systems, a set of entities interact with each other in complicated patterns that can encompass multiple types of relationships, change in time, and include other types of complications. Such systems include multiple subsystems and layers of connectivity, and it is important to take such "multilayer" features into account to try to improve our understanding of complex systems. Consequently, it is necessary to generalize "traditional" network theory by developing (and validating) a framework and associated tools to study multilayer systems in a comprehensive fashion. The origins of such efforts date back several decades and arose in multiple disciplines, and now the study of multilayer networks has become one of the most important directions in network science. In this paper, we discuss the history of multilayer networks (and related concepts) and review the exploding body of work on such networks. To unify the disparate terminology in the large body of recent work, we discuss a general framework for multilayer networks, construct a dictionary of terminology to relate the numerous existing concepts to each other, and provide a thorough discussion that compares, contrasts, and translates between related notions such as multilayer networks, multiplex networks, interdependent networks, networks of networks, and many others. We also survey and discuss existing data sets that can be represented as multilayer networks. We review attempts to generalize single-layer-network diagnostics to multilayer networks. We also discuss the rapidly expanding research on multilayer-network models and notions like community structure, connected components, tensor decompositions, and various types of dynamical processes on multilayer networks. We conclude with a summary and an outlook.

physics.soc-ph↗

arXiv2014

Dynamics on Modular Networks with Heterogeneous Correlations

We develop a new ensemble of modular random graphs in which degree-degree correlations can be different in each module and the inter-module connections are defined by the joint degree-degree distribution of nodes for each pair of modules. We present an analytical approach that allows one to analyze several types of binary dynamics operating on such networks, and we illustrate our approach using bond percolation, site percolation, and the Watts threshold model. The new network ensemble generalizes existing models (e.g., the well-known configuration model and LFR networks) by allowing a heterogeneous distribution of degree-degree correlations across modules, which is important for the consideration of nonidentical interacting networks.

physics.soc-ph↗

arXiv2013

Task-Based Core-Periphery Organisation of Human Brain Dynamics

As a person learns a new skill, distinct synapses, brain regions, and circuits are engaged and change over time. In this paper, we develop methods to examine patterns of correlated activity across a large set of brain regions. Our goal is to identify properties that enable robust learning of a motor skill. We measure brain activity during motor sequencing and characterize network properties based on coherent activity between brain regions. Using recently developed algorithms to detect time-evolving communities, we find that the complex reconfiguration patterns of the brain's putative functional modules that control learning can be described parsimoniously by the combined presence of a relatively stiff temporal core that is composed primarily of sensorimotor and visual regions whose connectivity changes little in time and a flexible temporal periphery that is composed primarily of multimodal association regions whose connectivity changes frequently. The separation between temporal core and periphery changes over the course of training and, importantly, is a good predictor of individual differences in learning success. The core of dynamically stiff regions exhibits dense connectivity, which is consistent with notions of core-periphery organization established previously in social networks. Our results demonstrate that core-periphery organization provides an insightful way to understand how putative functional modules are linked. This, in turn, enables the prediction of fundamental human capacities, including the production of complex goal-directed behavior.

q-bio.NC↗

arXiv2013

Solitary Matter Waves in Combined Linear and Nonlinear Potentials: Detection, Stability, and Dynamics

We study statically homogeneous Bose-Einstein condensates with spatially inhomogeneous interactions and outline an experimental realization of compensating linear and nonlinear potentials that can yield constant-density solutions. We illustrate how the presence of a step in the nonlinearity coefficient can only be revealed dynamically and consider, in particular, how to reveal it by exploiting the inhomogeneity of the sound speed with a defect-dragging experiment. We conduct computational experiments and observe the spontaneous emergence of dark solitary waves. We use effective-potential theory to perform a detailed analytical investigation of the existence and stability of solitary waves in this setting, and we corroborate these results computationally using a Bogoliubov-de Gennes linear stability analysis. We find that dark solitary waves are unstable for all step widths, whereas bright solitary waves can become stable through a symmetry-breaking bifurcation as one varies the step width. Using phase-plane analysis, we illustrate the scenarios that permit this bifurcation and explore the dynamical outcomes of the interaction between the solitary wave and the step.

nlin.PS↗

arXiv2013

Noise-Induced Synchronization, Desynchronization, and Clustering in Globally Coupled Nonidentical Oscillators

We study ensembles of globally coupled, nonidentical phase oscillators subject to correlated noise, and we identify several important factors that cause noise and coupling to synchronize or desychronize a system. By introducing noise in various ways, we find a novel estimate for the onset of synchrony of a system in terms of the coupling strength, noise strength, and width of the frequency distribution of its natural oscillations. We also demonstrate that noise alone is sufficient to synchronize nonidentical oscillators. However, this synchrony depends on the first Fourier mode of a phase-sensitivity function, through which we introduce common noise into the system. We show that higher Fourier modes can cause desychronization due to clustering effects, and that this can reinforce clustering caused by different forms of coupling. Finally, we discuss the effects of noise on an ensemble in which antiferromagnetic coupling causes oscillators to form two clusters in the absence of noise.

nlin.AO↗

arXiv2013

Decentralized Routing on Spatial Networks with Stochastic Edge Weights

We investigate algorithms to find short paths in spatial networks with stochastic edge weights. Our formulation of the problem of finding short paths differs from traditional formulations because we specifically do not make two of the usual simplifying assumptions: (1) we allow edge weights to be stochastic rather than deterministic; and (2) we do not assume that global knowledge of a network is available. We develop a decentralized routing algorithm that provides en route guidance for travelers on a spatial network with stochastic edge weights without the need to rely on global knowledge about the network. To guide a traveler, our algorithm uses an estimation function that evaluates cumulative arrival probability distributions based on distances between pairs of nodes. The estimation function carries a notion of proximity between nodes and thereby enables routing without global knowledge. In testing our decentralized algorithm, we define a criterion that allows one to discriminate among arrival probability distributions, and we test our algorithm and this criterion using both synthetic and real networks.

cs.SI↗

arXiv2013

Mathematical Formulation of Multi-Layer Networks

A network representation is useful for describing the structure of a large variety of complex systems. However, most real and engineered systems have multiple subsystems and layers of connectivity, and the data produced by such systems is very rich. Achieving a deep understanding of such systems necessitates generalizing "traditional" network theory, and the newfound deluge of data now makes it possible to test increasingly general frameworks for the study of networks. In particular, although adjacency matrices are useful to describe traditional single-layer networks, such a representation is insufficient for the analysis and description of multiplex and time-dependent networks. One must therefore develop a more general mathematical framework to cope with the challenges posed by multi-layer complex systems. In this paper, we introduce a tensorial framework to study multi-layer networks, and we discuss the generalization of several important network descriptors and dynamical processes --including degree centrality, clustering coefficients, eigenvector centrality, modularity, Von Neumann entropy, and diffusion-- for this framework. We examine the impact of different choices in constructing these generalizations, and we illustrate how to obtain known results for the special cases of single-layer and multiplex networks. Our tensorial approach will be helpful for tackling pressing problems in multi-layer complex systems, such as inferring who is influencing whom (and by which media) in multichannel social networks and developing routing techniques for multimodal transportation systems.

physics.soc-ph↗

arXiv2013

Formation of Dominance Relationships via Strategy Updating in an Asymmetric Hawk-Dove Game

We develop a model to describe the development of dominance relations between social animals as they use past experiences to inform future interactions. Using the game-theoretic framework of a Hawk-Dove game with asymmetric resource-holding potentials (RHPs), we derive a simple model that describes the social interactions of animals that compete for resources. We then consider a game-playing strategy in which animals acquire information about their RHP asymmetry from the results of their previous contests and subsequently use their asymmetry assessment to inform their behavior in future contests. We examine how directly incorporating the fact that animals have incomplete information in their interactions can lead to outcomes that differ from what would be expected if one considers the situation as a static game in which the animals have perfect information about the asymmetry size. We thereby obtain results that are consistent with observations of dominance-hierarchy formation in social animals. We also discuss how increased interactions between animals can speed up the asymmetry assessment process and how this can explain why aggression can sometimes decrease as the number of interactions between animals increases over time.

q-bio.PE↗

arXiv2013

Random Walks on Stochastic Temporal Networks

In the study of dynamical processes on networks, there has been intense focus on network structure -- i.e., the arrangement of edges and their associated weights -- but the effects of the temporal patterns of edges remains poorly understood. In this chapter, we develop a mathematical framework for random walks on temporal networks using an approach that provides a compromise between abstract but unrealistic models and data-driven but non-mathematical approaches. To do this, we introduce a stochastic model for temporal networks in which we summarize the temporal and structural organization of a system using a matrix of waiting-time distributions. We show that random walks on stochastic temporal networks can be described exactly by an integro-differential master equation and derive an analytical expression for its asymptotic steady state. We also discuss how our work might be useful to help build centrality measures for temporal networks.

physics.soc-ph↗

arXiv2013

Discriminating Power of Centrality Measures

The calculation of centrality measures is common practice in the study of networks, as they attempt to quantify the importance of individual vertices, edges, or other components. Different centralities attempt to measure importance in different ways. In this paper, we examine a conjecture posed by E. Estrada regarding the ability of several measures to distinguish the vertices of networks. Estrada conjectured that if all vertices of a graph have the same subgraph centrality, then all vertices must also have the same degree, eigenvector, closeness, and betweenness centralities. We provide a counterexample for the latter two centrality measures and propose a revised conjecture.

cs.SI↗

arXiv2013

A Method Based on Total Variation for Network Modularity Optimization using the MBO Scheme

The study of network structure is pervasive in sociology, biology, computer science, and many other disciplines. One of the most important areas of network science is the algorithmic detection of cohesive groups of nodes called "communities". One popular approach to find communities is to maximize a quality function known as {\em modularity} to achieve some sort of optimal clustering of nodes. In this paper, we interpret the modularity function from a novel perspective: we reformulate modularity optimization as a minimization problem of an energy functional that consists of a total variation term and an $\ell_2$ balance term. By employing numerical techniques from image processing and $\ell_1$ compressive sensing -- such as convex splitting and the Merriman-Bence-Osher (MBO) scheme -- we develop a variational algorithm for the minimization problem. We present our computational results using both synthetic benchmark networks and real data.

cs.SI↗