Exploiting Phase Transitions for the Efficient Sampling of the Fixed Degree Sequence Model

Brugger, Christian; Chinazzo, André Lucas; John, Alexandre Flores; Schryver, Christian De; Wehn, Norbert; Spitz, Andreas; Zweig, Katharina Anna

doi:10.1145/2808797.2809388

Cited by 3 publications

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Increasing the Sampling Efficiency for the Link Assessment Problem

Chinazzo

Schryver

Zweig

et al. 2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Complex graphs are at the heart of today’s big data challenges like recommendation systems, customer behavior modeling, or incident detection systems. One reoccurring task in these fields is the extraction of network motifs, which are subgraphs that are reoccurring and statistically significant. To assess the statistical significance of their occurrence, the observed values in the real network need to be compared to their expected value in a random graph model.In this chapter, we focus on the so-called Link Assessment (LA) problem, in particular for bipartite networks. Lacking closed-form solutions, we require stochastic Monte Carlo approaches that raise the challenge of finding appropriate metrics for quantifying the quality of results (QoR) together with suitable heuristics that stop the computation process if no further increase in quality is expected. We provide investigation results for three quality metrics and show that observing the right metrics reveals so-called phase transitions that can be used as a reliable basis for such heuristics. Finally, we propose a heuristic that has been evaluated with real-word datasets, providing a speedup of $$15.4\times $$ 15.4 × over previous approaches.

show abstract