Austin R. Benson

Contact

arb@cs.cornell.edu
413B Bill & Melinda Gates Hall
@austinbenson
arbenson

Assistant Professor of Computer Science
Field Member of Applied Math
Cornell University

My research develops computational frameworks for analyzing large-scale and complex datasets coming from the Web, social networks, biology, and other scientific domains. This involves a combination of network science, matrix and tensor computations, data mining, machine learning, algorithm design, and high-performance computing.
My research is supported in part by the NSF.
[Curriculum Vitae]

• Fall 2018. CS 2850/INFO 2040/ECON 2040/SOC 2090: Networks.
  Office Hours: Wednesdays, 9:00am–10:00am, Gates 203

Preprints

• A sampling framework for counting temporal motifs.
  Paul Liu, Austin R. Benson, and Moses Charikar.
  arXiv:1810.00980, 2018.
  paper pdf

• Detecting Core-Periphery Structure in Spatial Networks.
  Junteng Jia and Austin R. Benson.
  arXiv:1808.06544, 2018.
  paper pdf code data

• Three hypergraph eigenvector centralities.
  Austin R. Benson.
  arXiv:1807.09644, 2018.
  paper pdf code

• Random Walks on Simplicial Complexes and the normalized Hodge Laplacian.
  Michael T. Schaub, Austin R. Benson, Paul Horn, Gabor Lippner, Ali Jadbabaie.
  arXiv:1807.05044, 2018.
  paper pdf

• Computing tensor Z-eigenvectors with dynamical systems.
  Austin R. Benson and David F. Gleich.
  arXiv:1805.00903, 2018.
  paper pdf code

• Simplicial closure and higher-order link prediction.
  Austin R. Benson, Rediet Abebe, Michael T. Schaub, Ali Jadbabaie, and Jon Kleinberg.
  arXiv:1802.06916, 2018.
  paper pdf code data

Peer-reviewed papers

• Found Graph Data and Planted Vertex Covers.
  Austin R. Benson and Jon Kleinberg.
  To appear in Proceedings of Neural Information Processing Systems (NIPS), 2018.
  paper pdf code data

• Sequences of Sets.
  Austin R. Benson, Ravi Kumar, and Andrew Tomkins.
  Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 2018.
  paper pdf code data poster

• Higher-order clustering in networks.
  Hao Yin, Austin R. Benson, and Jure Leskovec.
  Physical Review E, 2018.
  paper pdf code

• A Discrete Choice Model for Subset Selection.
  Austin R. Benson, Ravi Kumar, and Andrew Tomkins.
  Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM), 2018.
  paper pdf code data poster

• Local higher-order graph clustering.
  Hao Yin, Austin R. Benson, Jure Leskovec, and David F. Gleich.
  Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 2017.
  paper pdf code data

• Motifs in temporal networks.
  Ashwin Paranjape*, Austin R. Benson*, and Jure Leskovec. (*equal contribution)
  Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM), 2017.
  paper pdf code data poster

• The spacey random walk: a stochastic process for higher-order data.
  Austin R. Benson, David F. Gleich, and Lek-Heng Lim.
  SIAM Review, 2017.
  paper pdf code data

• Higher-order organization of complex networks.
  Austin R. Benson, David F. Gleich, and Jure Leskovec.
  Science, 2016.
  paper pdf supplement code data

• General tensor spectral co-clustering for higher-order data.
  Tao Wu, Austin R. Benson, and David F. Gleich.
  Proceedings of Neural Information Processing Systems (NIPS), 2016.
  paper pdf code

• On the relevance of irrelevant alternatives.
  Austin R. Benson, Ravi Kumar, and Andrew Tomkins.
  Proceedings of the International Conference on World Wide Web (WWW), 2016.
  paper pdf

• Modeling user consumption sequences.
  Austin R. Benson, Ravi Kumar, and Andrew Tomkins.
  Proceedings of the International Conference on World Wide Web (WWW), 2016.
  paper pdf

• Improving the numerical stability of fast matrix multiplication.
  Grey Ballard, Austin R. Benson, Alex Druinksy, Benjamin Lipshitz, and Oded Schwartz.
  SIAM Journal on Matrix Analysis and Applications, 2016.
  paper pdf code

• Tensor spectral clustering for partitioning higher-order network structures.
  Austin R. Benson, David F. Gleich, and Jure Leskovec.
  Proceedings of the SIAM International Conference on Data Mining (SDM), 2015.
  paper pdf code

• A framework for practical parallel fast matrix multiplication.
  Austin R. Benson and Grey Ballard.
  Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), 2015.
  paper pdf code

• Scalable methods for nonnegative matrix factorizations of near-separable tall-and-skinny matrices.
  Austin R. Benson, Jason D. Lee, Bartek Rajwa, and David F. Gleich.
  Proceedings of Neural Information Processing Systems (NIPS), 2014.
  Selected for spotlight presentation.
  paper pdf code data poster

• Learning multifractal structure in large networks.
  Austin R. Benson, Carlos Riquelme, and Sven Schmit.
  Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 2014.
  paper pdf supplement

• A parallel directional Fast Multipole Method.
  Austin R. Benson, Jack Poulson, Kenneth Tran, Björn Engquist, and Lexing Ying.
  SIAM Journal on Scientific Computing, 2014.
  paper pdf code

• Silent error detection in numerical time-stepping schemes.
  Austin R. Benson, Sven Schmit, and Robert Schreiber.
  International Journal of High Performance Computing Applications, 2014.
  paper pdf supplement code

• Direct QR factorizations for tall-and-skinny matrices in MapReduce architectures.
  Austin R. Benson, David F. Gleich, and James Demmel.
  Proceedings of the IEEE International Conference on Big Data (IEEE BigData), 2013.
  paper pdf code

Theses

• Tools for higher-order network analysis.
  Austin Reilley Benson.
  Stanford PhD thesis, 2017.
  Stanford ICME Gene Golub Doctoral Dissertation Award winner.
  paper pdf