2 citations · 2 across the 1 of their papers we have counts for
Showing cs.SIShow all
2 papers · 1 filter
cs.SI2018
The HyperKron Graph Model for higher-order features
Nicole Eikmeier, Arjun S. Ramani, David F. Gleich
Graph models have long been used in lieu of real data which can be expensive and hard to come by. A common class of models constructs a matrix of probabilities, and samples an adja…
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…