Before revision:  In single cell chromatin interaction networks the optimal partition can be inferred from localization of the non-backtracking walks on the corresponding polymer graph, which responds to the maximum entropy principle.
After revision:  In single cell chromatin interaction networks the optimal partition can be inferred from localization of the non-backtracking flow operator and suggest the first protocol for annotation of compartmental domains in sparse single cell Hi-C matrices. In particular, we prove that our approach corresponds to the maximum entropy principle.