Work

Computing maximal cliques in link streams

Year: 2015

Type: preprint

Abstract: A link stream is a collection of triplets $(t, u, v)$ indicating that an interaction occurred between u and v at time t. We generalize the classical notion of cliques in graphs to such link streams: for a given $Δ$, a $Δ$-clique is a set of nodes and a time interval such that all pairs of nodes in this set interact at least once during each sub-interval of duration $Δ$. We propose an algorithm to enumerate all maximal (in terms of nodes or time interval) cliques of a link stream, and illustrate its practical relevance on a real-world contact trace.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1502.00993

Authors: Viard, Tiphaine, Latapy, Matthieu, Magnien, Clémence

Institutions: Centre National de la Recherche Scientifique, Sorbonne Université, LIP6, Université Pierre-et-Marie-Curie

Language: English

Topic: Complex Network Analysis Techniques

Subfield: Statistical and Nonlinear Physics

Field: Physics and Astronomy

Domain: Physical Sciences

Open Access status: green

Funder: Agence Nationale de la Recherche

Award: Evolving communities, diffusion and events detection

OpenAlex ID: W2952563166

Cites: 10

Cited by: 3

Related to: 20