We study a random graph model for small-world networks which are ubiquitous in social and biological sciences. In this model, a dense cycle of expected bandwidth $n τ$, representing the hidden one-dimensional geometry of vertices, is planted in an ambient random graph on $n$ vertices. For both detection and recovery of the planted dense cycle, we characterize the information-theoretic thresholds in terms of $n$, $τ$, and an edge-wise signal-to-noise ratio $λ$. In particular, the information-theoretic thresholds differ from the computational thresholds established in a recent work for low-degree polynomial algorithms, thereby justifying the existence of statistical-to-computational gaps for this problem.
Northwestern University(西北大学);École Polytechnique Fédérale de Lausanne(洛桑联邦理工学院);Duke University, The Fuqua School of Business(杜克大学福夸商学院);Cornell University, Department of Statistics and Data Science(康奈尔大学统计与数据科学系)
The stochastic block model has the overlap graph property for modularity
University of North Carolina, Chapel Hill(北卡罗来纳大学教堂山分校);MIT Sloan School of Management(麻省理工学院斯隆管理学院);Eindhoven University of Technology(埃因霍温理工大学);Toronto Metropolitan University(多伦多都会大学);Uppsala University(乌普萨拉大学)