Graph-monotone entrywise guarantees for MLE and Rank Centrality on general comparison graphs BYN44C0X0C

URI	`m2://res/BYN44C0X0C`
Kind	preprint
Creators	Yuepeng Yang, Cong Ma
Date	2026-10-06
MSC	62-XX
Subjects	arxiv math.ST, arxiv stat.ML, arxiv stat.TH
Scope	in

Expressions

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

Item	Kind	Where	Source
Exact top-$K$ recovery	statement	corollary 3.2	arxiv
Rank Centrality edge-noise localization	statement	lemma C.1	arxiv
Localized edge-noise process	statement	lemma A.1	arxiv
Entrywise guarantees for MLE and Rank Centrality	statement	theorem 3.1	arxiv
Strong connectivity implies a finite unique MLE	statement	lemma B.1	arxiv
Cut weight from algebraic connectivity	statement	lemma A.3	arxiv
Random-pairing Rank Centrality	statement	corollary 3.4	arxiv
Strong connectivity for a fixed observation design	statement	lemma A.4	arxiv
MLE score identity and localized score control	statement	lemma B.2	arxiv
Logistic increment lower bound	statement	lemma B.3	arxiv
Outcome-adaptive augmentation	statement	theorem 4.2	arxiv
Lower stationary-flow truncation energy	statement	lemma C.3	arxiv
Heterogeneous random comparison graph	example	example 3.3	arxiv
Upper stationary-flow truncation energy	statement	lemma C.2	arxiv
Algebraic connectivity of an Erd\H{o}s--R\'enyi graph	statement	lemma D.1	arxiv
Sparse-support Poincar\'e inequality	statement	lemma A.2	arxiv
Outcome-adaptive augmentation	definition	definition 4.1	arxiv
Heterogeneous sampling is semirandom	statement	proposition D.3	arxiv
Two-stage localized score control	statement	lemma D.2	arxiv
MLE truncated level-set energy	statement	lemma B.4	arxiv