arXiv (All)
open access
Graph-monotone entrywise guarantees for MLE and Rank Centrality on general comparison graphs
Pairwise comparisons are widely used to infer latent scores and identify top-ranked items. Although sharp statistical guarantees are available under uniform sampling, real data often induce irregular comparison graphs with heterogeneous observation counts across pairs. In this paper, we study an arb
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Almost Stacked Hypothesis: A Conjectural Analogue of Sjöstrand's Cover Pebbling Theorem#1234018
- STAMP: Symmetric Temporal Averaging Message Passing for Domain Adaptation in Chronologically Split Graphs#1355533
- System-Wide Termination in Distributed Betweenness Centrality Computation#665890
- System-Wide Termination in Distributed Betweenness Centrality Computation#664390
- System-Wide Termination in Distributed Betweenness Centrality Computation#422221
Record · ID 1233069
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive