We define the normalized Laplacian \(L(A)\) of an
\(n \times n\) graph adjacency matrix \(A\) as
$$
L(A)_{ij} = \frac{A_{ij}}{\sqrt{d^{out}_i} \sqrt{d^{in}_j}}
$$
where
$$
d^{out}_i = \sum_{j=1}^n \| A_{ij} \|
$$
and
$$
d^{in}_j = \sum_{i=1}^n \| A_{ij} \|.
$$
When \(A_{ij}\) denotes the present of an edge from node \(i\)
to node \(j\), which is fairly standard notation,
\(d^{out}_i\) denotes the (absolute) out-degree of node
\(i\) and \(d^{in}_j\) denotes the (absolute) in-degree
of node \(j\).
Note that this documentation renders most clearly at
https://rohelab.github.io/invertiforms/.