Showing math.PRShow all
2 papers · 1 filter
math.PR2020
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 …
math.PR2018
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…