An official website of the United States government
We study core-periphery structure in networks using inference methods based on a flexible network model that allows for traditional onion-like cores within cores, but also for hierarchical tree-like structures and more general non-nested types of structure. We propose an efficient Monte Carlo scheme for fitting the model to observed networks and report results for a selection of real-world data sets. Among other things, we observe an empirical distinction between networks showing traditional core-periphery structure with a dense core weakly connected to a sparse periphery, and an alternative structure in which the core is strongly connected both within itself and to the periphery. Networks vary in whether they are better represented by one type of structure or the other. We also observe structures that are a hybrid between core-periphery structure and community structure, in which networks have a set of non-overlapping cores that correspond roughly to communities, surrounded by a single undifferentiated periphery. Computer code implementing our methods is available.
more »
« less
An Overview+Detail Layout for Visualizing Compound Graphs
Compound graphs are networks in which vertices can be grouped into larger subsets, with these subsets capable of further grouping, resulting in a nesting that can be many levels deep. In several applications, including biological workflows, chemical equations, and computational data flow analysis, these graphs often exhibit a tree-like nesting structure, where sibling clusters are disjoint. Common compound graph layouts prioritize the lowest level of the grouping, down to the individual ungrouped vertices, which can make the higher level grouped structures more difficult to discern, especially in deeply nested networks. Leveraging the additional structure of the tree-like nesting, we contribute an overview+detail layout for this class of compound graphs that preserves the saliency of the higher level network structure when groups are expanded to show internal nested structure. Our layout draws inner structures adjacent to their parents, using a modified tree layout to place substructures. We describe our algorithm and then present case studies demonstrating the layout's utility to a domain expert working on data flow analysis. Finally, we discuss network parameters and analysis situations in which our layout is well suited.
more »
« less
- Award ID(s):
- 2324465
- PAR ID:
- 10608520
- Publisher / Repository:
- IEEE
- Date Published:
- ISBN:
- 979-8-3503-5485-0
- Page Range / eLocation ID:
- 136 to 140
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Synopsis Understanding how the structure of biological systems impacts their resilience (broadly defined) is a recurring question across multiple levels of biological organization. In ecology, considerable effort has been devoted to understanding how the structure of interactions between species in ecological networks is linked to different broad resilience outcomes, especially local stability. Still, nearly all of that work has focused on interaction structure in presence-absence terms and has not investigated quantitative structure, i.e., the arrangement of interaction strengths in ecological networks. We investigated how the interplay between binary and quantitative structure impacts stability in mutualistic interaction networks (those in which species interactions are mutually beneficial), using community matrix approaches. We additionally examined the effects of network complexity and within-guild competition for context. In terms of structure, we focused on understanding the stability impacts of nestedness, a structure in which more-specialized species interact with smaller subsets of the same species that more-generalized species interact with. Most mutualistic networks in nature display binary nestedness, which is puzzling because both binary and quantitative nestedness are known to be destabilizing on their own. We found that quantitative network structure has important consequences for local stability. In more-complex networks, binary-nested structures were the most stable configurations, depending on the quantitative structures, but which quantitative structure was stabilizing depended on network complexity and competitive context. As complexity increases and in the absence of within-guild competition, the most stable configurations have a nested binary structure with a complementary (i.e., anti-nested) quantitative structure. In the presence of within-guild competition, however, the most stable networks are those with a nested binary structure and a nested quantitative structure. In other words, the impact of interaction overlap on community persistence is dependent on the competitive context. These results help to explain the prevalence of binary-nested structures in nature and underscore the need for future empirical work on quantitative structure.more » « less
-
Several variants of the subgraph isomorphism problem, e.g., finding, counting and estimating frequencies of subgraphs in networks arise in a number of real world applications, such as web analysis, disease diffusion prediction and social network analysis. These problems are computationally challenging in having to scale to very large networks with millions of vertices. In this paper, we present SAHAD, a MapReduce algorithm for detecting and counting trees of bounded size using the elegant color coding technique developed by N. Alon et al. SAHAD is a randomized algorithm, and we show rigorous bounds on the approximation quality and the performance of it. SAHAD scales to very large networks comprising of 107-108 edges and tree-like (acyclic) templates with up to 12 vertices. Further, we extend our results by implementing SAHAD in the Harp framework, which is more of a high performance computing environment. The new implementation gives 100x improvement in performance over the standard Hadoop implementation and achieves better performance than state-of-the-art MPI solutions on larger graphs.more » « less
-
Abstract Dynamic or temporal networks enable representation of time-varying edges between nodes. Conventional adjacency-based data structures used for storing networks such as adjacency lists were designed without incorporating time and can thus quickly retrieve all edges between two sets of nodes (anode-based slice) but cannot quickly retrieve all edges that occur within a given time interval (atime-based slice). We propose a hybrid data structure for storing temporal networks that stores edges in both an adjacency dictionary, enabling rapid node-based slices, and an interval tree, enabling rapid time-based slices. Our hybrid structure also enablescompound slices, where one needs to slice both over nodes and time, either by slicing first over nodes or slicing first over time. We further propose an approach for predictive compound slicing, which attempts to predict whether a node-based or time-based compound slice is more efficient. We evaluate our hybrid data structure on many real temporal network data sets and find that they achieve much faster slice times than existing data structures with only a modest increase in creation time and memory usage.more » « less
-
Graph clustering is a fundamental problem in social network analysis, the goal of which is to group vertices of a graph into a series of densely knitted clusters with each cluster well separated from all the others. Classical graph clustering methods take advantage of the graph topology to model and quantify vertex proximity. With the proliferation of rich graph contents, such as user profiles in social networks, and gene annotations in protein interaction networks, it is essential to consider both the structure and content information of graphs for high-quality graph clustering. In this paper, we propose a graph embedding approach to clustering content-enriched graphs. The key idea is to embed each vertex of a graph into a continuous vector space where the localized structural and attributive information of vertices can be encoded in a unified, latent representation. Specifically, we quantify vertex-wise attribute proximity into edge weights, and employ truncated, attribute-aware random walks to learn the latent representations for vertices. We evaluate our attribute-aware graph embedding method in real-world attributed graphs, and the results demonstrate its effectiveness in comparison with state-of-the-art algorithms.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- https://doi.org/10.1109/VIS55277.2024.00035
