Are informative DWPCs greater than permuted DWPCs?

[dhimmel]

We've had the thesis that DWPCs that measure truly connected nodes will be higher than P-DWPCs (mean permuted DWPCs). However, @zietzm and I were looking at P-DWPC and Z-DWPC distributions yesterday of the real network and a permuted network (permuted compared to permuted) and the distributions looked incredibly similar.

Some discussions from Project Rephetio that may have wisdom from the past:

• Transforming DWPCs for hetnet edge prediction (first comment with distributions)
• Introducing the Residual Degree Weighted Path Count (R-DWPC)

One issue is that we don't have a great understanding of DWPCs and permuted DWPCs. I think we should start by exploring DWPCs and how they compare to permuted DWPCs. In whats ways are DWPCs from a permuted network different than from the unmodified network?

[zietzm]

Will post things for future reference: paths that we think contain information do not necessarily appear to have increased DWPC distributions above their permutations. In the following two graphs, I utilized the standard method (arcsinh, mean permutation, mean DWPC scaling). Note that for the time being, I am not utilizing degree-grouped permutations.