We develop a framework for edge-wise inference in graphon-based random networks. The proposed leave-one-out neighborhood procedure excludes the target vertex when selecting neighbors, then averages the selected vertices' edges to that target. Conditional on the latent probabilities and selected neighborhood, these edges are independent. This structure yields finite-sample concentration inequalities and a Berry--Esseen bound for fluctuations about the selected-neighborhood mean. Under blockwise graphon regularity, quantitative two-hop identifiability, and across-block separation, we control the smoothing bias uniformly over latent positions, including positions near block boundaries. Together with an observable variance estimator, this gives Gaussian confidence intervals for individual edge probabilities with asymptotically correct pointwise coverage. We also establish finite-sample empirical Bernstein coverage for the selected-neighborhood mean, Gaussian inference under weaker bandwidth conditions on identical-profile blocks, and inference for target pairs chosen measurably from the latent positions. Finally, we derive an expected-risk identity for leave-one-out cross-validation at each fixed neighborhood size. Simulations assess interval coverage, variance estimation, and estimation error.
翻译:暂无翻译