11 citations · 16 across the 5 of their papers we have counts for
6 papers
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…
Neural Latent Space Model for Dynamic Networks and Temporal Knowledge Graphs
Tony Gracious, Shubham Gupta, Arun Kanthali +2
Although static networks have been extensively studied in machine learning, data mining, and AI communities for many decades, the study of dynamic networks has recently taken cente…
Equipping SBMs with RBMs: An Explainable Approach for Analysis of Networks with Covariates
Shubham Gupta, Gururaj K., Ambedkar Dukkipati +1
Networks with node covariates offer two advantages to community detection methods, namely, (i) exploit covariates to improve the quality of communities, and more importantly, (ii)…
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…
Consistent Estimation in General Sublinear Preferential Attachment Trees
Fengnan Gao, Aad van der Vaart, Rui Castro +1
We propose an empirical estimator of the preferential attachment function in the setting of general preferential attachment trees. Using a supercritical continuous-time branchi…