Search Results for author:
Found 3 papers, 2 papers with code
Nonbacktracking spectral clustering of nonuniform hypergraphs
Spectral methods offer a tractable, global framework for clustering in graphs via eigenvector computations on graph matrices.
On Large-Scale Dynamic Topic Modeling with Nonnegative CP Tensor Decomposition
There is currently an unprecedented demand for large-scale temporal data analysis due to the explosive growth of data.
Coin-flipping, ball-dropping, and grass-hopping for generating random graphs from matrices of edge probabilities
Common models for random graphs, such as Erd\H{o}s-R\'{e}nyi and Kronecker graphs, correspond to generating random adjacency matrices where each entry is non-zero based on a large matrix of probabilities.
Social and Information Networks Discrete Mathematics Combinatorics
