  In this work, we consider the problem of influence maximization on a
hypergraph. We first extend the Independent Cascade (IC) model to hypergraphs,
and prove that the traditional influence maximization problem remains
submodular. We then present a variant of the influence maximization problem
(HEMI) where one seeks to maximize the number of hyperedges, a majority of
whose nodes are influenced. We prove that HEMI is non-submodular under the
diffusion model proposed.
