Ryan Gibson

Mr. Ryan Gibson

University of North Carolina, Chapel Hill
orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 August 2017 in Algorithms
Verified
Journal Article
Open access
PDF file
WWWilliam Harrington Weir
William Harrington Weir
SEScott Emmons
Scott Emmons
RGRyan Gibson
Ryan Gibson
Dane TaylorDane Taylor
Dane Taylor
PMPeter Mucha
Peter Mucha
We introduce the Convex Hull of Admissible Modularity Partitions (CHAMP) algorithm to prune and prioritize different network community structures identified across multiple runs of possibly various computational heuristics. Given a set of partitions, CHAMP identifies the domain of modularity optimization for each partition—i.e., the parameter-space domain where it has the largest modularity relative to the input set—discarding partitions with empty domains to obtain the subset of partitions that are “admissible” candidate community structures that remain potentially optimal over indicated parameter domains. Importantly, CHAMP can be used for multi-dimensional parameter spaces, such as those for multilayer networks where one includes a resolution parameter and interlayer coupling. Using the results from CHAMP, a user can more appropriately select robust community structures by observing the sizes of domains of optimization and the pairwise comparisons between partitions in the admissible subset. We demonstrate the utility of CHAMP with several example networks. In these examples, CHAMP focuses attention onto pruned subsets of admissible partitions that are 20-to-1785 times smaller than the sets of unique partitions obtained by community detection heuristics that were input into CHAMP.

20 June 2020 in bioRxiv
Verified
Preprint
Open access
PDF file
TBThomas Bodenheimer
Thomas Bodenheimer
MHMahantesh Halappanavar
Mahantesh Halappanavar
SJStuart Jefferys
Stuart Jefferys
RGRyan Gibson
Ryan Gibson
SLSiyao Liu
Siyao Liu
SSSara R. Selitsky
Sara R. Selitsky
Current single-cell experiments can produce datasets with millions of cells. Unsupervised clustering can be used to identify cell populations in single-cell analysis but often leads to interminable computation time at this scale. This problem has previously been mitigated by subsampling cells, which greatly reduces accuracy. We built on the graph-based algorithm PhenoGraph and developed FastPG which has the same cell assignment accuracy but is on average 27x faster in our tests. FastPG also has higher cell assignment accuracy than two other fast clustering methods, FlowSOM and PARC. Availability: FastPG is available here: https://github.com/sararselitsky/FastPG

10 December 2019 in Physical Review E
Verified
Journal Article
Closed access
PDF file
ELEun Lee
Eun Lee
SEScott Emmons
Scott Emmons
RGRyan Gibson
Ryan Gibson
JMJames Moody
James Moody
PMPeter J. Mucha
Peter J. Mucha
Network properties govern the rate and extent of various spreading processes, from simple contagions to complex cascades. Recently, the analysis of spreading processes has been extended from static networks to temporal networks, where nodes and links appear and disappear. We focus on the effects of accessibility, whether there is a temporally consistent path from one node to another, and reachability, the density of the corresponding accessibility graph representation of the temporal network. The level of reachability thus inherently limits the possible extent of any spreading process on the temporal network. We study reachability in terms of the overall levels of temporal concurrency between edges and the structural cohesion of the network agglomerating over all edges. We use simulation results and develop heterogeneous mean-field model predictions for random networks to better quantify how the properties of the underlying temporal network regulate reachability.

13 April 2022 in Research Square
Verified
Preprint
Open access
PDF file
RGRyan Gibson
Ryan Gibson
PMPeter Mucha
Peter Mucha
Partitioning networks into communities of densely connected nodes is an important tool used widely across different applications, with numerous methods and software packages available for community detection. Modularity-based methods require parameters to be selected (or assume defaults) to control the resolution and, in multilayer networks, interlayer coupling. Meanwhile, most useful algorithms are heuristics yielding different near-optimal results upon repeated runs (even at the same parameters). To address these difficulties, we combine recent developments into a simpler framework for pruning a set of partitions to a subset that are self-consistent by an equivalence with stochastic block model (SBM) inference. The pruning typically highlights only a small number of “stable” partitions in our examples. We also derive resolution parameter upper bounds for fitting a constrained SBM of K blocks and demonstrate that these bounds hold in practice, further guiding parameter space regions to consider. With publicly available code (http://github.com/ragibson/ModularityPruning), our pruning procedure provides a new baseline for using modularity-based community detection in practice.