Community detection and stochastic block models: recent developments

E Abbe - Journal of Machine Learning Research, 2018 - jmlr.org
The stochastic block model (SBM) is a random graph model with planted clusters. It is widely
employed as a canonical model to study clustering and community detection, and provides …

Introduction to the non-asymptotic analysis of random matrices

R Vershynin - arxiv preprint arxiv:1011.3027, 2010 - arxiv.org
This is a tutorial on some basic non-asymptotic methods and concepts in random matrix
theory. The reader will learn several tools for the analysis of the extreme singular values of …

[BOOK][B] An introduction to random matrices

GW Anderson, A Guionnet, O Zeitouni - 2010 - books.google.com
The theory of random matrices plays an important role in many areas of pure mathematics
and employs a variety of sophisticated mathematical tools (analytical, probabilistic and …

[BOOK][B] Topics in random matrix theory

T Tao - 2012 - books.google.com
The field of random matrix theory has seen an explosion of activity in recent years, with
connections to many areas of mathematics and physics. However, this makes the current …

[BOOK][B] Introduction to random graphs

A Frieze, M Karoński - 2015 - books.google.com
From social networks such as Facebook, the World Wide Web and the Internet, to the
complex interactions between proteins in the cells of our bodies, we constantly face the …

Expander graphs and their applications

S Hoory, N Linial, A Wigderson - Bulletin of the American Mathematical …, 2006 - ams.org
But, perhaps, we should start with a few words about graphs in general. They are, of course,
one of the prime objects of study in Discrete Mathematics. However, graphs are among the …

Universality of Wigner random matrices: a survey of recent results

L Erdős - Russian Mathematical Surveys, 2011 - iopscience.iop.org
This is a study of the universality of spectral statistics for large random matrices. Considered
are symmetric, Hermitian, or quaternion self-dual random matrices with independent …

Matrix estimation by universal singular value thresholding

S Chatterjee - 2015 - projecteuclid.org
Consider the problem of estimating the entries of a large matrix, when the observed entries
are noisy versions of a small random fraction of the original entries. This problem has …

Spectral sparsification of graphs

DA Spielman, SH Teng - SIAM Journal on Computing, 2011 - SIAM
We introduce a new notion of graph sparsification based on spectral similarity of graph
Laplacians: spectral sparsification requires that the Laplacian quadratic form of the sparsifier …

Observational overfitting in reinforcement learning

X Song, Y Jiang, S Tu, Y Du, B Neyshabur - arxiv preprint arxiv …, 2019 - arxiv.org
A major component of overfitting in model-free reinforcement learning (RL) involves the case
where the agent may mistakenly correlate reward with certain spurious features from the …