activity
20122015
most citedBinary Black Hole Mergers from Globular Clusters: Implications for Advanced LIGO

411 citations · 1.1k across the 7 of their papers we have counts for

collaborators

7 papers

astro-ph.IM2015★ 15 cited

A New Hybrid Technique for Modeling Dense Star Clusters

Carl L. Rodriguez, Bharath Pattabiraman, Sourav Chatterjee +4

The "gravitational million-body problem," to model the dynamical evolution of a self-gravitating, collisional N-body system with ~10^6 particles over many relaxation times, remains…

astro-ph.GA2015★ 228 cited

Black hole mergers and blue stragglers from hierarchical triples formed in globular clusters

Fabio Antonini, Sourav Chatterjee, Carl L. Rodriguez +4

Hierarchical triple-star systems are expected to form frequently via close binary-binary encounters in the dense cores of globular clusters. In a sufficiently inclined triple, grav…

astro-ph.HE2015★ 411 cited

Binary Black Hole Mergers from Globular Clusters: Implications for Advanced LIGO

Carl L. Rodriguez, Meagan Morscher, Bharath Pattabiraman +3

The predicted rate of binary black hole mergers from galactic fields can vary over several orders of magnitude and is extremely sensitive to the assumptions of stellar evolution. B…

cs.DS2014★ 59 cited

Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection

Bharath Pattabiraman, Md. Mostofa Ali Patwary, Assefaw H. Gebremedhin +2

The maximum clique problem is a well known NP-Hard problem with applications in data mining, network analysis, information retrieval and many other areas related to the World Wide…

astro-ph.GA2014★ 284 cited

The Dynamical Evolution of Stellar Black Holes in Globular Clusters

Meagan Morscher, Bharath Pattabiraman, Carl Rodriguez +2

Our current understanding of the stellar initial mass function and massive star evolution suggests that young globular clusters may have formed hundreds to thousands of stellar-mas…

cs.DS2012★ 12 cited

Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs

Bharath Pattabiraman, Md. Mostofa Ali Patwary, Assefaw H. Gebremedhin +2

The maximum clique problem is a well known NP-Hard problem with applications in data mining, network analysis, informatics, and many other areas. Although there exist several algor…

astro-ph.IM2012★ 95 cited

A Parallel Monte Carlo Code for Simulating Collisional N-body Systems

Bharath Pattabiraman, Stefan Umbreit, Wei-Keng Liao +4

We present a new parallel code for computing the dynamical evolution of collisional N-body systems with up to N~10^7 particles. Our code is based on the the Henon Monte Carlo metho…