Ranks of Random Matrices and Graphs
72 pages· 2007· ISBN 9780549708407
About
Other results concern the case where Qn is sparse (each entry is 0 with high probability), and in particular on the adjacency matrix of sparse random graphs. In this case, we show that if the matrix is not too sparse than with high probability any dependency among the rows of Qn will come from a dependency involving very few rows.
Discuss Ranks of Random Matrices and Graphs with other readers
Join or start a book club for Ranks of Random Matrices and Graphs on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.
Frequently asked questions
How do I join a book club for Ranks of Random Matrices and Graphs?
Sign up free on Readfeed, then browse public clubs or start your own club with Ranks of Random Matrices and Graphs as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.
Can I discuss Ranks of Random Matrices and Graphs with other readers online?
Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Ranks of Random Matrices and Graphs with readers worldwide — whether your club is virtual, in-person, or hybrid.
Is Readfeed free?
Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.