Normalized adjacency operator of a bipartite graph (source code)

= Normalized adjacency operator of a bipartite graph
{title2=$(\theta_Gv)(x)=\mathbb E_yG(x,y)v(y)$}

Equip the function spaces of the two nonempty parts of a <bipartite graph> with uniform <inner products>. Its normalized adjacency operator is $(\theta_Gv)(x)=\mathbb E_yG(x,y)v(y)$. In orthonormal coordinate <bases>, its matrix is $G/\sqrt{|X||Y|}$, not the unscaled adjacency matrix. For a <biregular graph> of <edge density of a bipartite graph> $\gamma$, constant functions give a largest <singular value> $\gamma$, and the remaining <singular values> belong to the centered kernel $G-\gamma$.