Before revision:  Statistical inference of the model generalizes the Newman's modularity to the case of stochastic networks with hidden linear memory. 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:  On the basis of this new model we modify the non-backtracking walks on the corresponding polymer graph, which responds to the maximum entropy principle.