Autori: Gabriel Istrate, Cosmin Bonchis, Mircea Marin
Editorial: 10th International Workshop on Developments in Computational Models (DCM'14), 2014.
We study hypergraph analogues of interacting particle systems and random walks, notably generalizations of coalescing and annihilating random walks. Their definition is motivated by the problem of analyzing the expected running time of a local search procedure for the k-XOR SAT problem, as well as a certain constrained triad dynamics in the theory of social balance.
Cuvinte cheie: interactive particle systems, XOR-SAT, social balance