Expected values of parameters associated with the minimum rank of a graph
Tracy Hall, Leslie Hogben, Ryan R. Martin, Bryan Shader

TL;DR
This paper studies the expected values of graph parameters related to minimum rank in Erdős-Rényi random graphs, providing bounds that inform about average behaviors of these parameters across all labeled graphs.
Contribution
It introduces bounds for the expected minimum rank, maximum nullity, and related parameters in Erdős-Rényi graphs, advancing understanding of their average properties.
Findings
Bounds for expected minimum rank and nullity in G(v,p)
Analysis of average values over all labeled graphs
Insights into parameters related to graph rank
Abstract
We investigate the expected value of various graph parameters associated with the minimum rank of a graph, including minimum rank/maximum nullity and related Colin de Verdi\`ere-type parameters. Let denote the usual Erd\H{o}s-R\'enyi random graph on vertices with edge probability . We obtain bounds for the expected value of the random variables , , and , which yield bounds on the average values of these parameters over all labeled graphs of order .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
