4 papers
Quasi-cliques in inhomogeneous random graphs
Kay Bogerd
Given a graph and a constant , let be the largest integer such that there exists an -vertex subgraph of containing at least …
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…
Detecting a planted community in an inhomogeneous random graph
Kay Bogerd, Rui M. Castro, Remco van der Hofstad +1
We study the problem of detecting whether an inhomogeneous random graph contains a planted community. Specifically, we observe a single realization of a graph. Under the null hypot…
Cliques in rank-1 random graphs: the role of inhomogeneity
Kay Bogerd, Rui M. Castro, Remco van der Hofstad
We study the asymptotic behavior of the clique number in rank-1 inhomogeneous random graphs, where edge probabilities between vertices are roughly proportional to the product of th…