Search papers, labs, and topics across Lattice.
Univ. Paris-Saclay, INRIA
1
0
0
It is proved that under a condition of automorphism-based transition consistency, the associated Markov chain is strongly aggregable for an arbitrary graph with a non-trivial automorphism group.