88 citations · 109 across the 8 of their papers we have counts for
12 papers
Towards Distributed 2-Approximation Steiner Minimal Trees in Billion-edge Graphs
Tahsin Reza, Geoffrey Sanders, Roger Pearce
Given an edge-weighted graph and a set of known seed vertices, a network scientist often desires to understand the graph relationships to explain connections between the seed verti…
TriPoll: Computing Surveys of Triangles in Massive-Scale Temporal Graphs with Metadata
Trevor Steil, Tahsin Reza, Keita Iwabuchi +3
Understanding the higher-order interactions within network data is a key objective of network science. Surveys of metadata triangles (or patterned 3-cycles in metadata-enriched gra…
Scaling Graph Clustering with Distributed Sketches
Benjamin W. Priest, Alec Dunton, Geoffrey Sanders
The unsupervised learning of community structure, in particular the partitioning vertices into clusters or communities, is a canonical and well-studied problem in exploratory graph…
Stability Analysis of Inline ZFP Compression for Floating-Point Data in Iterative Methods
Alyson Fox, James Diffenderfer, Jeffrey Hittinger +2
Currently, the dominating constraint in many high performance computing applications is data capacity and bandwidth, in both inter-node communications and even more-so in on-node d…
Scalable Pattern Matching in Metadata Graphs via Constraint Checking
Tahsin Reza, Hassan Halawa, Matei Ripeanu +2
Pattern matching is a fundamental tool for answering complex graph queries. Unfortunately, existing solutions have limited capabilities: they do not scale to process large graphs a…
Rounding Error Analysis of Mixed Precision Block Householder QR Algorithms
L. Minah Yang, Alyson Fox, Geoffrey Sanders
Although mixed precision arithmetic has recently garnered interest for training dense neural networks, many other applications could benefit from the speed-ups and lower storage co…
Error Analysis of ZFP Compression for Floating-Point Data
James Diffenderfer, Alyson Fox, Jeffrey Hittinger +2
Compression of floating-point data will play an important role in high-performance computing as data bandwidth and storage become dominant costs. Lossy compression of floating-poin…
On Large-Scale Graph Generation with Validation of Diverse Triangle Statistics at Edges and Vertices
Geoffrey Sanders, Roger Pearce, Timothy La Fond +1
Researchers developing implementations of distributed graph analytic algorithms require graph generators that yield graphs sharing the challenging characteristics of real-world gra…
Design, Generation, and Validation of Extreme Scale Power-Law Graphs
Jeremy Kepner, Siddharth Samsi, William Arcand +18
Massive power-law graphs drive many fields: metagenomics, brain mapping, Internet-of-things, cybersecurity, and sparse machine learning. The development of novel algorithms and sys…
An Ensemble Framework for Detecting Community Changes in Dynamic Networks
Timothy La Fond, Geoffrey Sanders, Christine Klymko +1
Dynamic networks, especially those representing social networks, undergo constant evolution of their community structure over time. Nodes can migrate between different communities,…
Detecting highly cyclic structure with complex eigenpairs
Christine Klymko, Geoffrey Sanders
Many large, real-world complex networks have rich community structure that a network scientist seeks to understand. These communities may overlap or have intricate internal structu…
Spectral Partitioning with Blends of Eigenvectors
James P. Fairbanks, Geoffrey D. Sanders, David A. Bader
Many common methods for data analysis rely on linear algebra. We provide new results connecting data analysis error to numerical accuracy, which leads to the first meaningful stopp…