Pith. sign in

REVIEW 1 cited by

A sampling construction of graphon 1-norm convergence

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2310.14683 v2 pith:RBIO2KSP submitted 2023-10-23 eess.SP

Xingchao Jian , Feng Ji , Wee Peng Tay This is my paper · ORCID
classification eess.SP
keywords convergencegraphonnormnoteconstructionsamplingcontainsconverging
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Why is it easier to predict the epidemic curve than to reconstruct the underlying contact network?

    q-bio.PE 2025-05 accept novelty 7.0 of 10

    For large dense weighted SIS networks, prediction of epidemic curves is uniformly stable under trajectory-fitting error, while network reconstruction is provably non-identifiable in the cut norm.

Pith tools