2 citations · 2 across the 2 of their papers we have counts for
3 papers
cs.SI2019
Centrality in dynamic competition networks
Anthony Bonato, Nicole Eikmeier, David F. Gleich +1
Competition networks are formed via adversarial interactions between actors. The Dynamic Competition Hypothesis predicts that influential actors in competition networks should have…
cs.SI2019
Triangle Preferential Attachment Has Power-law Degrees and Eigenvalues; Eigenvalues Are More Stable to Network Sampling
Nicole Eikmeier, David F. Gleich
Preferential attachment models are a common class of graph models which have been used to explain why power-law distributions appear in the degree sequences of real network data. O…
cs.SI2017★ 2 cited
Coin-flipping, ball-dropping, and grass-hopping for generating random graphs from matrices of edge probabilities
Arjun S. Ramani, Nicole Eikmeier, David F. Gleich
Common models for random graphs, such as Erdős-Rényi and Kronecker graphs, correspond to generating random adjacency matrices where each entry is non-zero based on a large matrix o…