Before revision:  Identifying critical higher-order interactions is a significant research problem with a wide range of applications, such as information propagation, market advertising, and rumor controlling. This paper proposes two new Laplacians that allow redefining classical graph centrality measures for higher-order interactions.
After revision:  Identifying critical higher-order interactions. This report presents a novel method to identify critical higher-order interactions. We propose two new Laplacians that allow redefining classical graph centrality measures for higher-order interactions.