activity
20062026
most citedAn Integrated Programming and Development Environment for Adiabatic Quantum Optimization

27 citations · 100 across the 31 of their papers we have counts for

collaborators
Showing cs.SIShow all

7 papers · 1 filter

cs.SI2022

Reducing Access Disparities in Networks using Edge Augmentation

Ashkan Bashardoust, Sorelle A. Friedler, Carlos E. Scheidegger +2

In social networks, a node's position is a form of \it{social capital}. Better-positioned members not only benefit from (faster) access to diverse information, but innately have mo…

cs.SI2020

Information access representations and social capital in networks

Ashkan Bashardoust, Hannah C. Beilinson, Sorelle A. Friedler +6

Social network position confers power and social capital. In the setting of online social networks that have massive reach, creating mathematical representations of social capital…

cs.SI2018

Subgraph centrality and walk-regularity

Eric Horton, Kyle Kloster, Blair D. Sullivan

Matrix-based centrality measures have enjoyed significant popularity in network analysis, in no small part due to our ability to rigorously analyze their behavior as parameters var…

cs.SI2016

Asymptotic Analysis of Equivalences and Core-Structures in Kronecker-Style Graph Models

Alex J. Chin, Timothy D. Goodrich, Michael P. O'Brien +3

Growing interest in modeling large, complex networks has spurred significant research into generative graph models. Kronecker-style models (SKG and R-MAT) are often used due to the…

cs.SI2014★ 8 cited

Locally Estimating Core Numbers

Michael P. O'Brien, Blair D. Sullivan

Graphs are a powerful way to model interactions and relationships in data from a wide variety of application domains. In this setting, entities represented by vertices at the "cent…

cs.SI2014

Multi-Level Anomaly Detection on Time-Varying Graph Data

Robert A. Bridges, John Collins, Erik M. Ferragut +2

This work presents a novel modeling and analysis framework for graph sequences which addresses the challenge of detecting and contextualizing anomalies in labelled, streaming graph…

cs.SI2014

Structural Sparsity of Complex Networks: Bounded Expansion in Random Models and Real-World Graphs

Erik D. Demaine, Felix Reidl, Peter Rossmanith +3

This research establishes that many real-world networks exhibit bounded expansion, a strong notion of structural sparsity, and demonstrates that it can be leveraged to design effic…