Hitting Time Theorems for Random Matrices

DOI10.1017/S0963548314000285zbMath1310.15068arXiv1304.1779MaRDI QIDQ3191194

Louigi Addario-Berry, Laura Eslava

Publication date: 24 September 2014

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.1779

zbMATH Keywords

random matricesrandom graphsdeterminants, permanents, other special matrix functions

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Determinants, permanents, traces, other special matrix functions (15A15) Random matrices (algebraic aspects) (15B52)

Related Items (5)

Singularity of sparse random matrices: simple proofs ⋮ Singularity of the \(k\)-core of a random graph ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ Sharp transition of the invertibility of the adjacency matrices of sparse random graphs ⋮ Recent progress in combinatorial random matrix theory

Cites Work

• Hamilton cycles in random geometric graphs
• Random symmetric matrices are almost surely nonsingular.
• On singular values of matrices with independent rows
• On the singularity probability of discrete random matrices
• The longest edge of the random minimal spanning tree
• Bilinear and quadratic variants on the Littlewood-Offord problem
• Hitting time results for Maker-Breaker games
• On the Rank of Random Sparse Matrices
• The rank of random graphs
• Positional games on random graphs
• Invertibility of symmetric random matrices

This page was built for publication: Hitting Time Theorems for Random Matrices