2 papers
cs.DS2026
Robust Algorithms for Finding Cliques in Random Intersection Graphs via Sum-of-Squares
Andreas Göbel, Janosch Ruff, Leon Schiller
We study efficient algorithms for recovering cliques in dense random intersection graphs (RIGs). In this model, cliques of size approximately are randomly plant…
math.PR2026
Information-Theoretic Thresholds for Bipartite Latent-Space Graphs under Noisy Observations
Andreas Göbel, Marcus Pappik, Leon Schiller
We study information-theoretic phase transitions for the detectability of latent geometry in bipartite random geometric graphs RGGs with Gaussian d-dimensional latent vectors while…