11 citations · 14 across the 4 of their papers we have counts for
6 papers
Detecting a late changepoint in the preferential attachment model
Gianmarco Bet, Kay Bogerd, Rui M. Castro +1
Motivated by the problem of detecting a change in the evolution of a network, we consider the preferential attachment random graph model with a time-dependent attachment function.…
First-order asymptotics for the structure of the inhomogeneous random graph
Gianmarco Bet, Kay Bogerd, Vanessa Jacquier
In the inhomogeneous random graph model, each vertex is assigned a weight , and an edge between any two vertices is present with…
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…