dane taylor research

Dane Taylor
Postdoctoral Research Associate
Department of Mathematics
University of North Carolina-Chapel Hill

                  email: dane. r. taylor [at] gmail. com                             
                     web: https://sites.google.com/site/danetaylorresearch/
mail: Mathematics Department                
         Phillips Hall, CB#3250, UNC-CH 
Chapel Hill, NC 27599-3250 

Recent Work

Enhanced detectability of community structure in multilayer networks through layer aggregation
D Taylor, S Shai, N Stanley & PJ Mucha, preprint at arXiv:
1511.05271 (2015)

Community detection is a central pursuit for understanding the structure and function of biological, social and technological networks, and it is important to understand the fundamental limitations on detectability. 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. Using random matrix theory for stochastic block models, we analyze detectability limitations for multilayer networks and find that by aggregating together similar layers, it is possible to identify structure that is undetectable in a single layer. We explore this phenomenon for several aggregation methods including summation of the layers' adjacency matrices, for which detectability limit vanishes with increasing number of layers, L, decaying as O(L^{-1/2}). Interestingly, we find a similar scaling behavior when the summation is thresholded at an optimal value, supporting the common--but not well understood--practice of thresholding data matrices to obtain sparse network representations. 



Eigenvector-based centrality measures for temporal networks
D Taylor, SA Myers, A Clauset, MA Porter & PJ Mucha, preprint at 
arXiv:1507.01266 (2015)

In the study of static networks, numerous "centrality" measures have been developed to quantify the importances of nodes in networks, and one can express many of these measures in terms of the leading eigenvector of a matrix. With the increasing availability of network data that changes in time, it is important to extend eigenvector-based centrality measures to time-dependent networks. In this paper, we introduce a principled generalization that is valid for any eigenvector-based centrality measure in terms of matrices of size NTxNT, where the components of the dominant eigenvector of such a matrix describes the centralities of N nodes during T time layers. Our approach relies on coupling centrality values between neighboring time layers with a inter-layer edge, whose weight controls the extent to which centrality trajectories change over time. By studying the limit of strong coupling between layers, 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. Importantly, we compute these quantities by solving linear algebraic equations of dimension N. This is much more computationally efficient than computing the dominant eigenvector of the full NTxNT matrix. 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 Supreme Court of the United States.


Topological data analysis of contagion maps for examining spreading processes on networks
D Taylor, F Klimm, HA Harrington, M Kramar, K Mischaikow, MA Porter & PJ Mucha, 
Nature Communications 6, 7723 (2015)

Social and biological contagions are often strongly influenced by the spatial embeddedness of networks. In some cases, such as in the Black Death, they can spread as a wave through space. In many modern contagions, however, long-range edges—e.g., due to airline transportation or communication media—allow clusters of a contagion to arise in distant locations. We study these competing phenomena for the Watts threshold model (WTM) of complex contagions on empirical and synthetic noisy geometric networks, which are networks that are embedded in a manifold and which consist of both short-range and long-range, "noisy" edges. Our approach involves using the WTM to construct contagion maps that use multiple contagions to map the nodes as a point cloud, which we analyze using tools from high-dimensional data analysis and computational homology. For contagions that predominantly exhibit wavefront propagation, we identify a noisy geometric network's underlying manifold in the point cloud, highlighting our approach as a tool for inferring low-dimensional structure. Our approach makes it possible to obtain insights to aid in the modeling, forecast, and control of spreading processes, and it simultaneously leads to a novel technique for manifold learning in noisy geometric networks. 


Dynamics in hybrid complex systems of switches and oscillators
D Taylor, EJ Fertig & JG Restrepo, Chaos 23, 1033144 (2013)

While considerable progress has been made in the analysis of large systems containing a single type of coupled dynamical component (e.g., coupled oscillators or coupled switches), systems containing diverse components (e.g., both oscillators and switches) have received much less attention. We analyze large, hybrid systems of interconnected Kuramoto oscillators and Hopfield switches with positive feedback. In this system, oscillator synchronization promotes switches to turn on. In turn, when switches turn on they enhance the synchrony of the oscillators to which they are coupled. Depending on the choice of parameters, we find theoretically coexisting stable solutions with either (i) incoherent oscillators and all switches permanently off, (ii) synchronized oscillators and all switches permanently on, or (iii) synchronized oscillators and switches that periodically alternate between the on and off states. Numerical experiments confirm these predictions. We discuss how transitions between these steady state solutions can be onset deterministically through dynamic bifurcations or spontaneously due to finite-size fluctuations.


Social Climber attachment in forming networks produces a phase transition in connectivity
D Taylor & DB Larremore, Physical Review E 86, 031140 (2012)

Formation and fragmentation of networks is typically studied using percolation theory, but most previous research has been restricted to studying a phase transition in cluster size, examining the emergence of a giant component. This approach does not study the effects of evolving network structure on dynamics that occur at the nodes, such as the synchronization of oscillators and the spread of information, epidemics, and neuronal excitations. We introduce and analyze new link-formation rules, called Social Climber (SC) attachment, that may be combined with arbitrary percolation models to produce a previously unstudied phase transition using the largest eigenvalue of the network adjacency matrix as the order parameter. This eigenvalue is significant in the analyses of many network-coupled dynamical systems in which it measures the quality of global coupling and is hence a natural measure of connectivity. We highlight the important self-organized properties of SC attachment and discuss implications for controlling dynamics on networks.