Before revision: This paper aims at comparing two coupling approaches as basic layers for building clustering criteria, suited for modularizing very large graphs. Although the scientific literature is not sparing with clustering criteria dedicated to graphs and networksdecomposition, we shall nevertheless rework this subject, in this paper, by proposing a new symmetric and dual approach based on coupling functions, allowing to compare and calibrate them. To elaborate those coupling maps, we will briefly use "optimal transport theory" as a starting point, then we will derive two main families of criteria: those based upon "statistical independence" versus those based upon "logical indetermina-tion ".
After revision: This paper aims at comparing two coupling approaches as basic layers for building clustering criteria, suited for modularizing and clustering very large networks. We briefly use "optimal transport theory" as a starting point, then we will derive two main families of criteria: those based upon "statistical independence" versus those based upon "logical indetermina-tion ".