K. Bogerd

activity

20182023

most citedCliques in rank-1 random graphs: the role of inhomogeneity

11 citations · 14 across the 4 of their papers we have counts for

collaborators

Showing 2020Show all

2 papers · 1 filter

math.PR2020

Quasi-cliques in inhomogeneous random graphs

Kay Bogerd

Given a graph $G$ and a constant $γ \in [0, 1]$ , let $ω^{(γ)} (G)$ be the largest integer $r$ such that there exists an $r$ -vertex subgraph of $G$ containing at least $γ (2 r)$ …

math.ST2020

Detecting a botnet in a network

Gianmarco Bet, Kay Bogerd, Rui M. Castro +1

We formalize the problem of detecting the presence of a botnet in a network as an hypothesis testing problem where we observe a single instance of a graph. The null hypothesis, cor…