arXiv subjects

Peter J. Mucha

Publications and source records attributed to Peter J. Mucha.

At least 55 records · Page 3Linked to original sources

arXiv2016

Eigenvector-Based Centrality Measures for Temporal Networks

Numerous centrality measures have been developed to quantify the importances of nodes in time-independent networks, and many of them can be expressed as the leading eigenvector of some matrix. With the increasing availability of network data that changes in time, it is important to extend such eigenvector-based centrality measures to time-dependent networks. In this paper, we introduce a principled generalization of network centrality measures that is valid for any eigenvector-based centrality. We consider a temporal network with N nodes as a sequence of T layers that describe the network during different time windows, and we couple centrality matrices for the layers into a supra-centrality matrix of size NTxNT whose dominant eigenvector gives the centrality of each node i at each time t. We refer to this eigenvector and its components as a joint centrality, as it reflects the importances of both the node i and the time layer t. We also introduce the concepts of marginal and conditional centralities, which facilitate the study of centrality trajectories over time. We find that the strength of coupling between layers is important for determining multiscale properties of centrality, such as localization phenomena and the time scale of centrality changes. In the strong-coupling regime, we derive expressions for time-averaged centralities, which are given by the zeroth-order terms of a singular perturbation expansion. We also study first-order terms to obtain first-order-mover scores, which concisely describe the magnitude of nodes' centrality changes over time. As examples, we apply our method to three empirical temporal networks: the United States Ph.D. exchange in mathematics, costarring relationships among top-billed actors during the Golden Age of Hollywood, and citations of decisions from the United States Supreme Court.

physics.soc-ph↗

arXiv2016

Transitivity reinforcement in the coevolving voter model

One of the fundamental structural properties of many networks is triangle closure. Whereas the influence of this transitivity on a variety of contagion dynamics has been previously explored, existing models of coevolving or adaptive network systems use rewiring rules that randomize away this important property. In contrast, we study here a modified coevolving voter model dynamics that explicitly reinforces and maintains such clustering. Employing extensive numerical simulations, we establish that the transitions and dynamical states observed in coevolving voter model networks without clustering are altered by reinforcing transitivity in the model. We then use a semi-analytical framework in terms of approximate master equations to predict the dynamical behaviors of the model for a variety of parameter settings.

nlin.AO↗

arXiv2016

A Local Perspective on Community Structure in Multilayer Networks

The analysis of multilayer networks is among the most active areas of network science, and there are now several methods to detect dense "communities" of nodes in multilayer networks. One way to define a community is as a set of nodes that trap a diffusion-like dynamical process (usually a random walk) for a long time. In this view, communities are sets of nodes that create bottlenecks to the spreading of a dynamical process on a network. We analyze the local behavior of different random walks on multiplex networks (which are multilayer networks in which different layers correspond to different types of edges) and show that they have very different bottlenecks that hence correspond to rather different notions of what it means for a set of nodes to be a good community. This has direct implications for the behavior of community-detection methods that are based on these random walks.

cs.SI↗

arXiv2016

Enhanced detectability of community structure in multilayer networks through layer aggregation

Many systems are naturally represented by a multilayer network in which edges exist in multiple layers that encode different, but potentially related, types of interactions, and it is important to understand limitations on the detectability of community structure in these networks. Using random matrix theory, we analyze detectability limitations for multilayer (specifically, multiplex) stochastic block models (SBMs) in which L layers are derived from a common SBM. We study the effect of layer aggregation on detectability for several aggregation methods, including summation of the layers' adjacency matrices for which we show the detectability limit vanishes as O(L^{-1/2}) with increasing number of layers, L. Importantly, we find a similar scaling behavior when the summation is thresholded at an optimal value, providing insight into the common - but not well understood - practice of thresholding pairwise-interaction data to obtain sparse network representations.

physics.soc-ph↗

arXiv2015

Network Structure and Biased Variance Estimation in Respondent Driven Sampling

This paper explores bias in the estimation of sampling variance in Respondent Driven Sampling (RDS). Prior methodological work on RDS has focused on its problematic assumptions and the biases and inefficiencies of its estimators of the population mean. Nonetheless, researchers have given only slight attention to the topic of estimating sampling variance in RDS, despite the importance of variance estimation for the construction of confidence intervals and hypothesis tests. In this paper, we show that the estimators of RDS sampling variance rely on a critical assumption that the network is First Order Markov (FOM) with respect to the dependent variable of interest. We demonstrate, through intuitive examples, mathematical generalizations, and computational experiments that current RDS variance estimators will always underestimate the population sampling variance of RDS in empirical networks that do not conform to the FOM assumption. Analysis of 215 observed university and school networks from Facebook and Add Health indicates that the FOM assumption is violated in every empirical network we analyze, and that these violations lead to substantially biased RDS estimators of sampling variance. We propose and test two alternative variance estimators that show some promise for reducing biases, but which also illustrate the limits of estimating sampling variance with only partial information on the underlying population social network.

stat.AP↗

arXiv2015

Clustering Network Layers With the Strata Multilayer Stochastic Block Model

Multilayer networks are a useful data structure for simultaneously capturing multiple types of relationships between a set of nodes. In such networks, each relational definition gives rise to a layer. While each layer provides its own set of information, community structure across layers can be collectively utilized to discover and quantify underlying relational patterns between nodes. To concisely extract information from a multilayer network, we propose to identify and combine sets of layers with meaningful similarities in community structure. In this paper, we describe the "strata multilayer stochastic block model'' (sMLSBM), a probabilistic model for multilayer community structure. The central extension of the model is that there exist groups of layers, called "strata'', which are defined such that all layers in a given stratum have community structure described by a common stochastic block model (SBM). That is, layers in a stratum exhibit similar node-to-community assignments and SBM probability parameters. Fitting the sMLSBM to a multilayer network provides a joint clustering that yields node-to-community and layer-to-stratum assignments, which cooperatively aid one another during inference. We describe an algorithm for separating layers into their appropriate strata and an inference technique for estimating the SBM parameters for each stratum. We demonstrate our method using synthetic networks and a multilayer network inferred from data collected in the Human Microbiome Project.

cs.SI↗

arXiv2015

Topological data analysis of contagion maps for examining spreading processes on networks

Social and biological contagions are influenced by the spatial embeddedness of networks. Historically, many epidemics spread as a wave across part of the Earth's surface; however, in modern contagions long-range edges -- for example, due to airline transportation or communication media -- allow clusters of a contagion to appear in distant locations. Here we study the spread of contagions on networks through a methodology grounded in topological data analysis and nonlinear dimension reduction. We construct "contagion maps" that use multiple contagions on a network to map the nodes as a point cloud. By analyzing the topology, geometry, and dimensionality of manifold structure in such point clouds, we reveal insights to aid in the modeling, forecast, and control of spreading processes. Our approach highlights contagion maps also as a viable tool for inferring low-dimensional structure in networks.

nlin.AO↗

arXiv2014

A testing based extraction algorithm for identifying significant communities in networks

A common and important problem arising in the study of networks is how to divide the vertices of a given network into one or more groups, called communities, in such a way that vertices of the same community are more interconnected than vertices belonging to different ones. We propose and investigate a testing based community detection procedure called Extraction of Statistically Significant Communities (ESSC). The ESSC procedure is based on $p$-values for the strength of connection between a single vertex and a set of vertices under a reference distribution derived from a conditional configuration network model. The procedure automatically selects both the number of communities in the network and their size. Moreover, ESSC can handle overlapping communities and, unlike the majority of existing methods, identifies "background" vertices that do not belong to a well-defined community. The method has only one parameter, which controls the stringency of the hypothesis tests. We investigate the performance and potential use of ESSC and compare it with a number of existing methods, through a validation study using four real network data sets. In addition, we carry out a simulation study to assess the effectiveness of ESSC in networks with various types of community structure, including networks with overlapping communities and those with background vertices. These results suggest that ESSC is an effective exploratory tool for the discovery of relevant community structure in complex network systems. Data and software are available at \urlhttp://www.unc.edu/~jameswd/research.html.

cs.SI↗

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

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↗

arXiv2014

Kantian fractionalization predicts the conflict propensity of the international system

The study of complex social and political phenomena with the perspective and methods of network science has proven fruitful in a variety of areas, including applications in political science and more narrowly the field of international relations. We propose a new line of research in the study of international conflict by showing that the multiplex fractionalization of the international system (which we label Kantian fractionalization) is a powerful predictor of the propensity for violent interstate conflict, a key indicator of the system's stability. In so doing, we also demonstrate the first use of multislice modularity for community detection in a multiplex network application. Even after controlling for established system-level conflict indicators, we find that Kantian fractionalization contributes more to model fit for violent interstate conflict than previously established measures. Moreover, evaluating the influence of each of the constituent networks shows that joint democracy plays little, if any, role in predicting system stability, thus challenging a major empirical finding of the international relations literature. Lastly, a series of Granger causal tests shows that the temporal variability of Kantian fractionalization is consistent with a causal relationship with the prevalence of conflict in the international system. This causal relationship has real-world policy implications as changes in Kantian fractionalization could serve as an early warning sign of international instability.

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

Fluctuation of similarity (FLUS) to detect transitions between distinct dynamical regimes in short time series

Recently a method which employs computing of fluctuations in a measure of nonlinear similarity based on local recurrence properties in a univariate time series, was introduced to identify distinct dynamical regimes and transitions between them in a short time series [1]. Here we present the details of the analytical relationships between the newly introduced measure and the well known concepts of attractor dimensions and Lyapunov exponents. We show that the new measure has linear dependence on the effective dimension of the attractor and it measures the variations in the sum of the Lyapunov spectrum. To illustrate the practical usefulness of the method, we employ it to identify various types of dynamical transitions in different nonlinear models. Also, we present testbed examples for the new method's robustness against the presence of noise and missing values in the time series. Furthermore, we use this method to analyze time series from the field of social dynamics, where we present an analysis of the US crime record's time series from the year 1975 to 1993. Using this method, we have found that dynamical complexity in robberies was influenced by the unemployment rate till late 1980's. We have also observed a dynamical transition in homicide and robbery rates in the late 1980's and early 1990's, leading to increase in the dynamical complexity of these rates.

nlin.CD↗

arXiv2013

Percolation-induced exponential scaling in the large current tails of random resistor networks

There is a renewed surge in percolation-induced transport properties of diverse nano-particle composites (cf. RSC Nanoscience & Nanotechnology Series, Paul O'Brien Editor-in-Chief). We note in particular a broad interest in nano-composites exhibiting sharp electrical property gains at and above percolation threshold, which motivated us to revisit the classical setting of percolation in random resistor networks but from a multiscale perspective. For each realization of random resistor networks above threshold, we use network graph representations and associated algorithms to identify and restrict to the percolating component, thereby preconditioning the network both in size and accuracy by filtering {\it a priori} zero current-carrying bonds. We then simulate many realizations per bond density and analyze scaling behavior of the complete current distribution supported on the percolating component. We first confirm the celebrated power-law distribution of small currents at the percolation threshold, and second we confirm results on scaling of the maximum current in the network that is associated with the backbone of the percolating cluster. These properties are then placed in context with global features of the current distribution, and in particular the dominant role of the large current tail that is most relevant for material science applications. We identify a robust, exponential large current tail that: 1. persists above threshold; 2. expands broadly over and dominates the current distribution at the expense of the vanishing power law scaling in the small current tail; and 3. by taking second moments, reproduces the experimentally observed power law scaling of bulk conductivity above threshold.

cond-mat.dis-nn↗

arXiv2013

Role of social environment and social clustering in spread of opinions in co-evolving networks

Taking a pragmatic approach to the processes involved in the phenomena of collective opinion formation, we investigate two specific modifications to the co-evolving network voter model of opinion formation, studied by Holme and Newman [1]. First, we replace the rewiring probability parameter by a distribution of probability of accepting or rejecting opinions between individuals, accounting for the asymmetric influences in relationships among individuals in a social group. Second, we modify the rewiring step by a path-length-based preference for rewiring that reinforces local clustering. We have investigated the influences of these modifications on the outcomes of the simulations of this model. We found that varying the shape of the distribution of probability of accepting or rejecting opinions can lead to the emergence of two qualitatively distinct final states, one having several isolated connected components each in internal consensus leading to the existence of diverse set of opinions and the other having one single dominant connected component with each node within it having the same opinion. Furthermore, and more importantly, we found that the initial clustering in network can also induce similar transitions. Our investigation also brings forward that these transitions are governed by a weak and complex dependence on system size. We found that the networks in the final states of the model have rich structural properties including the small world property for some parameter regimes. [1] P. Holme and M. Newman, Phys. Rev. E 74, 056108 (2006).

physics.soc-ph↗

arXiv2013

Resolving structural variability in network models and the brain

Large-scale white matter pathways crisscrossing the cortex create a complex pattern of connectivity that underlies human cognitive function. Generative mechanisms for this architecture have been difficult to identify in part because little is known about mechanistic drivers of structured networks. Here we contrast network properties derived from diffusion spectrum imaging data of the human brain with 13 synthetic network models chosen to probe the roles of physical network embedding and temporal network growth. We characterize both the empirical and synthetic networks using familiar diagnostics presented in statistical form, as scatter plots and distributions, to reveal the full range of variability of each measure across scales in the network. We focus on the degree distribution, degree assortativity, hierarchy, topological Rentian scaling, and topological fractal scaling---in addition to several summary statistics, including the mean clustering coefficient, shortest path length, and network diameter. The models are investigated in a progressive, branching sequence, aimed at capturing different elements thought to be important in the brain, and range from simple random and regular networks, to models that incorporate specific growth rules and constraints. We find that synthetic models that constrain the network nodes to be embedded in anatomical brain regions tend to produce distributions that are similar to those extracted from the brain. We also find that network models hardcoded to display one network property do not in general also display a second, suggesting that multiple neurobiological mechanisms might be at play in the development of human brain network architecture. Together, the network models that we develop and employ provide a potentially useful starting point for the statistical inference of brain network structure from neuroimaging data.

q-bio.NC↗

arXiv2013

Robust Detection of Dynamic Community Structure in Networks

We describe techniques for the robust detection of community structure in some classes of time-dependent networks. Specifically, we consider the use of statistical null models for facilitating the principled identification of structural modules in semi-decomposable systems. Null models play an important role both in the optimization of quality functions such as modularity and in the subsequent assessment of the statistical validity of identified community structure. We examine the sensitivity of such methods to model parameters and show how comparisons to null models can help identify system scales. By considering a large number of optimizations, we quantify the variance of network diagnostics over optimizations (`optimization variance') and over randomizations of network structure (`randomization variance'). Because the modularity quality function typically has a large number of nearly-degenerate local optima for networks constructed using real data, we develop a method to construct representative partitions that uses a null model to correct for statistical noise in sets of partitions. To illustrate our results, we employ ensembles of time-dependent networks extracted from both nonlinear oscillators and empirical neuroscience data.

physics.data-an↗