On the Enumeration of Maximal (Δ, γ)-Cliques of a Temporal Network

Suman Banerjee, Bithika Pal

Abstract: A temporal network is a mathematical way of precisely representing a time-varying relationship among a group of agents. It is an interesting problem to identify different groups of them, which reveal certain communicating patterns. To study this problem, in this paper, we introduce the notion of (Δ, γ)-cliques of a temporal network, where every pair of vertices present in the clique communicates at least γ times in each Δ period within a given time duration. We present an algorithm for enumerating all such maximal cliques present in the network. We also implement the proposed algorithm with three human contact network datasets. Based on the obtained results, we analyze the data set on multiple values of Δ and γ, which helps in finding out the contact groups with different frequencies.