惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

IT之家
IT之家
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
大猫的无限游戏
大猫的无限游戏
美团技术团队
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
博客园_首页
MyScale Blog
MyScale Blog
N
Netflix TechBlog - Medium
I
InfoQ
Jina AI
Jina AI
Martin Fowler
Martin Fowler
Recent Announcements
Recent Announcements
量子位
月光博客
月光博客
罗磊的独立博客
雷峰网
雷峰网
The Cloudflare Blog
V
V2EX
小众软件
小众软件
人人都是产品经理
人人都是产品经理
博客园 - Franky
T
Tailwind CSS Blog
有赞技术团队
有赞技术团队
S
SegmentFault 最新的问题

math.ST updates on arXiv.org

What is Learnable in Valiant's Theory of the Learnable? Learning Perturbations to Extrapolate Your LLM Byzantine-Robust Distributed Sparse Learning Revisited The Sample Complexity of Multiple Change Point Identification under Bandit Feedback A proximal gradient algorithm for composite log-concave sampling Model-based Bootstrap of Controlled Markov Chains Approximation of Maximally Monotone Operators : A Graph Convergence Perspective Posterior Contraction Rates for Sparse Kolmogorov-Arnold Networks in Anisotropic Besov Spaces MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound A Spectral Framework for Closed-Form Relative Density Estimation Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability Higher-Order Equilibrium Tracking for EM-Compressible Online Estimation Scaling Limits of Long-Context Transformers A Note on Non-Negative $L_1$-Approximating Polynomials Susceptibilities and Patterning: A Primer on Linear Response in Bayesian Learning Linear Response Estimators for Singular Statistical Models Statistical inference with belief functions: A survey Robust stochastic first order methods in heavy-tailed noise via medoid mini-batch gradient sampling Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity Adaptive auditing of AI systems with anytime-valid guarantees Locally Near Optimal Piecewise Linear Regression in High Dimensions via Difference of Max-Affine Functions Risk-Controlled Post-Processing of Decision Policies Covariate Balancing and Riesz Regression Should Be Guided by the Neyman Orthogonal Score in Debiased Machine Learning A Unified Pair-GRPO Family: From Implicit to Explicit Preference Constraints for Stable and General RL Alignment Time-Inhomogeneous Preconditioned Langevin Dynamics A Fine-Grained Understanding of Uniform Convergence for Halfspaces CITE: Anytime-Valid Statistical Inference in LLM Self-Consistency Ratio-based Loss Functions Optimal Confidence Band for Kernel Gradient Flow Estimator A renormalization-group inspired lattice-based framework for piecewise generalized linear models
Testing degree heterogeneity in directed networks
Lu Pan, Qiuping Wang, Ting Yan · 2025-02-14 · via math.ST updates on arXiv.org

In this study, we focus on the likelihood ratio tests in the $p_0$ model for testing degree heterogeneity in directed networks, which is an exponential family distribution on directed graphs with the bi-degree sequence as the naturally sufficient statistic. For testing the homogeneous null hypotheses $H_0: α_1 = \cdots = α_r$, we establish Wilks-type results in both increasing-dimensional and fixed-dimensional settings. For increasing dimensions, the normalized log-likelihood ratio statistic $[2\{\ell(\widehat{\mathbfθ})-\ell(\widehat{\mathbfθ}^0)\}-r]/(2r)^{1/2}$ converges in distribution to a standard normal distribution. For fixed dimensions, $2\{\ell(\widehat{\mathbfθ})-\ell(\widehat{\mathbfθ}^0)\}$ converges in distribution to a chi-square distribution with $r-1$ degrees of freedom as $n\rightarrow \infty$, independent of the nuisance parameters. Additionally, we present a Wilks-type theorem for the specified null $H_0: α_i=α_i^0$, $i=1,\ldots, r$ in high-dimensional settings, where the normalized log-likelihood ratio statistic also converges in distribution to a standard normal distribution. These results extend the work of \cite{yan2025likelihood} to directed graphs in a highly non-trivial way, where we need to analyze much more expansion terms in the fourth-order asymptotic expansions of the likelihood function and develop new approximate inverse matrices under the null restricted parameter spaces for approximating the inverse of the Fisher information matrices in the $p_0$ model. Simulation studies and real data analyses are presented to verify our theoretical results.