文摘
A class of discrete, deterministic diffusion processes on graphs is introduced. The set of attainable population vectors is studied, with focus on its extreme points. Explicit results are obtained for complete graphs, path graphs and cyclic graphs.