Cover Image

Errors are Robustly Tamed in Cumulative Knowledge Processes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Brandenberger, Anna, Marcussen, Cassandra, Mossel, Elchanan, Sudan, Madhu
Format:	Preprint
Published:	2023
Subjects:	Artificial Intelligence Data Structures and Algorithms Social and Information Networks Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Finding the root in random nearest neighbor trees
by: Brandenberger, Anna, et al.
Published: (2024)

Finding the Root in Random Nearest Neighbor Trees
by: Anna Brandenberger, et al.
Published: (2026)

Influence Maximization in Ising Models
by: Chen, Zongchen, et al.
Published: (2023)

Quality control in sublinear time: a case study via random graphs
by: Marcussen, Cassandra, et al.
Published: (2025)

On Algorithmic Robustness of Corrupted Markov Chains
by: Gaitonde, Jason, et al.
Published: (2025)

Comparison Theorems for the Mixing Times of Systematic and Random Scan Dynamics
by: Gaitonde, Jason, et al.
Published: (2024)

Reconstructing Riemannian Metrics From Random Geometric Graphs
by: Huang, Han, et al.
Published: (2025)

Learning and Testing Convex Functions
by: Pinto Jr., Renato Ferreira, et al.
Published: (2025)

Markov Chains with Rewinding
by: Azarmehr, Amir, et al.
Published: (2026)

Is this correct? Let's check!
by: Ben-Eliezer, Omri, et al.
Published: (2022)

Local Limits of Small World Networks
by: Alimohammadi, Yeganeh, et al.
Published: (2025)

The Metric Dimension of Sparse Random Graphs
by: Díaz, Josep, et al.
Published: (2025)

Pack and Measure: An Effective Approach for Influence Propagation in Social Networks
by: Abu-Khzam, Faisal N., et al.
Published: (2023)

A Generalisation of Voter Model: Influential Nodes and Convergence Properties
by: Manohara, Abhiram, et al.
Published: (2024)

Node Similarities under Random Projections: Limits and Pathological Cases
by: Tadić, Tvrtko, et al.
Published: (2024)

BEACON: A Benchmark for Efficient and Accurate Counting of Subgraphs
by: Najafi, Mohammad Matin, et al.
Published: (2025)

Modularity and partially observed graphs
by: McDiarmid, Colin, et al.
Published: (2021)

A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensation
by: Hashemi, Mohammad, et al.
Published: (2024)

Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation
by: Bläsius, Thomas, et al.
Published: (2024)

Leaf Stripping on Uniform Attachment Trees
by: Addario-Berry, Louigi, et al.
Published: (2024)

Spectral clustering in the Gaussian mixture block model
by: Li, Shuangping, et al.
Published: (2023)

Efficient Graph Matching for Correlated Stochastic Block Models
by: Chai, Shuwen, et al.
Published: (2024)

Sample-Efficient Linear Regression with Self-Selection Bias
by: Gaitonde, Jason, et al.
Published: (2024)

Better Models and Algorithms for Learning Ising Models from Dynamics
by: Gaitonde, Jason, et al.
Published: (2025)

Bypassing the Noisy Parity Barrier: Learning Higher-Order Markov Random Fields from Dynamics
by: Gaitonde, Jason, et al.
Published: (2024)

A Theory of Spectral CSP Sparsification
by: Khanna, Sanjeev, et al.
Published: (2025)

Near-optimal Hypergraph Sparsification in Insertion-only and Bounded-deletion Streams
by: Khanna, Sanjeev, et al.
Published: (2025)

Entropic independence via sparse localization
by: Jain, Vishesh, et al.
Published: (2026)

Succinct Preferential Attachment Graphs
by: Alaoui, Ziad Ismaili, et al.
Published: (2025)

Parallel Sampling via Counting
by: Anari, Nima, et al.
Published: (2024)

Efficient Diffusion Models for Symmetric Manifolds
by: Mangoubi, Oren, et al.
Published: (2025)

An Edge-Based Decomposition Framework for Temporal Networks
by: Oettershagen, Lutz, et al.
Published: (2023)

Finding coherent node groups in directed graphs
by: Kumpulainen, Iiro, et al.
Published: (2023)

Temporal Betweenness Centrality on Shortest Walks Variants
by: Naima, Mehdi
Published: (2023)

MANTRA: Temporal Betweenness Centrality Approximation through Sampling
by: Cruciani, Antonio
Published: (2023)

Graph Discovery and Source Detection in Temporal Graphs
by: Bals, Ben
Published: (2025)

Overcoming Non-Submodularity: Towards Constant Approximation for Network Immunization
by: Srivastava, Ajitesh, et al.
Published: (2024)

ProbeWalk: Fast Estimation of Biharmonic Distance on Graphs via Probe-Driven Random Walks
by: Zheng, Dehong, et al.
Published: (2025)

Multilevel Digital Contact Tracing
by: Mahapatra, Gautam, et al.
Published: (2020)

Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
by: Chen, Jingbang, et al.
Published: (2024)