Boolean function analysis on random graphs?

140 Views Asked by At

Random graphs have some properties that are determined in some random way such as edge probabilities in the interval $[0,1]$.

Ryan O'Donnell's book "Analysis of Boolean Functions" (2014) has analysis on boolean functions, an example 11.73 on graphs. I want to understand boolean function analysis on graphs such as expected values on connectivity function and conditional expected values with symmetric differences on having a vertex and not a having a vertex.

Where can you find books, references on boolean function analysis on graphs with things such as expected values?