For latent position random graphs with infinite-rank or indefinite link kernels, the paper proves refined eigenvector expansions, row-wise central limit theorems, and a rank-adaptive test for equality of latent positions.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.ST 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Eigenvector fluctuations and limit results for random graphs with infinite rank kernels
For latent position random graphs with infinite-rank or indefinite link kernels, the paper proves refined eigenvector expansions, row-wise central limit theorems, and a rank-adaptive test for equality of latent positions.