Sharp detection and triangle likelihood limits for quadratic spherical kernel graphs
arXiv:2610.24759v1 Announce Type: cross Abstract: We study whether quadratic spherical geometry can be detected from a single observed graph. Latent positions are independent and uniform on $\mathbb S^{d-1}$; conditional on them, edges are independent with connection probability $K_{d,\beta}(t)=[1+\beta(dt^2-1)/(d-1)]/2$, where $0