arXiv:2310.14683
A sampling construction of graphon 1-norm convergence
원문 초록
In the short note, we describe a sampling construction that yields a sequence of graphons converging to a prescribed limit graphon in 1-norm. This convergence is stronger than the convergence in the cut norm, usually used to study graphon sequences. The note also contains errata of the previous version of the note.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Identifying the Smallest Adversarial Load Perturbations that Render DC-OPF Infeasible
The kernel of graph indices for vector search
Distributed Lyapunov Functions for Nonlinear Networks
Model-Based Real-Time Pose and Sag Estimation of Overhead Power Lines Using LiDAR for Drone Inspection
PocketVina Enables Scalable and Highly Accurate Physically Valid Docking through Multi-Pocket Conditioning
SWE-Factory: Your Automated Factory for Issue Resolution Training Data and Evaluation Benchmarks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.