Distribution of subgraphs of random regular graphs

49 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Tail inequalities for sums of random matrices that depend on the intrinsic dimension (2012, background): “Later, it was demonstrated that the same technique could be adapted to yield analogues of other tail bounds such as Azuma’s and Bernstein’s inequalities (Cristofides and Markström, 2008; Gross et al., 2010; Recht, 2009; Gross, 2011; Oliveira, 2010a,b).”
Time-uniform Chernoff bounds via nonnegative supermartingales (2018, methodology): “The method was refined by Christofides and Markström (2007), Oliveira (2010a,b) and then by Tropp (2011, 2012), whose influential treatment synthesized and improved upon past work, generalizing many scalar exponential inequalities to operator-norm inequalities for matrix martingales.”
Concentration of the adjacency matrix and of the Laplacian in random graphs with independent edges (2009, methodology): “Christofides and Markström [21] used the same method to obtain a version of Hoeffding’s inequality for matrix martingales.”
Recovering Low-Rank Matrices From Few Coefficients in Any Basis (2009, background): “Note added: After the pre-print version of this paper was published, the author was made aware of a related matrixvalued martingale bound in [35].”
User-Friendly Tail Bounds for Sums of Random Matrices (2010, background): “Christofides and Markström establish a matrix version of the Azuma and Hoeffding inequalities [10].”