Cover Image

A Fast Binary Splitting Approach for Non-Adaptive Learning of Erdős--Rényi Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ta, Hoang, Scarlett, Jonathan
Format:	Preprint
Published:	2025
Subjects:	Information Theory Discrete Mathematics Machine Learning Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Exact Thresholds for Noisy Non-Adaptive Group Testing
by: Chen, Junren, et al.
Published: (2024)

A Method for Generating Connected Erdos-Renyi Random Graphs
by: Chinyaev, Boris
Published: (2025)

Group Testing: An Information Theory Perspective
by: Aldridge, Matthew, et al.
Published: (2019)

Sandwiching Random Geometric Graphs and Erdos-Renyi with Applications: Sharp Thresholds, Robust Testing, and Enumeration
by: Bangachev, Kiril, et al.
Published: (2024)

Characterizing Graph Datasets for Node Classification: Homophily-Heterophily Dichotomy and Beyond
by: Platonov, Oleg, et al.
Published: (2022)

Entropy Equivalence Testing
by: Canonne, Clément L., et al.
Published: (2026)

The maximal hard-core model as a recoverable system: Gibbs measures and phase coexistence
by: Wang, Geyang, et al.
Published: (2025)

Smoothed Analysis of the Komlós Conjecture: Rademacher Noise
by: Aigner-Horev, Elad, et al.
Published: (2023)

Recoverable systems and the maximal hard-core model on the triangular lattice
by: Wang, Geyang, et al.
Published: (2026)

A note on the capacity of the binary perceptron
by: Altschuler, Dylan J., et al.
Published: (2024)

The Fundamental Limits of Recovering Planted Subgraphs
by: Lee, Daniel, et al.
Published: (2025)

Non-adaptive Learning of Random Hypergraphs with Queries
by: Austhof, Bethany, et al.
Published: (2025)

On The Fourier Coefficients of High-Dimensional Random Geometric Graphs
by: Bangachev, Kiril, et al.
Published: (2024)

Optimally revealing bits for rejection sampling
by: Langevin, Louis-Roy, et al.
Published: (2025)

CayleyPy RL: Pathfinding and Reinforcement Learning on Cayley Graphs
by: Chervov, A., et al.
Published: (2025)

Graph-theoretical estimates of the diameters of the Rubik's Cube groups
by: Hirata, So
Published: (2024)

Efficient Online Random Sampling via Randomness Recycling
by: Draper, Thomas L., et al.
Published: (2025)

Efficient Rejection Sampling in the Entropy-Optimal Range
by: Draper, Thomas L., et al.
Published: (2025)

Bespoke multiresolution analysis of graph signals
by: Elefante, Giacomo, et al.
Published: (2025)

Efficient Algorithm for Sparse Fourier Transform of Generalized $q$-ary Functions
by: Tsui, Darin, et al.
Published: (2025)

On Training-Test (Mis)alignment in Unsupervised Combinatorial Optimization: Observation, Empirical Exploration, and Analysis
by: Bu, Fanchen, et al.
Published: (2025)

Multi-Path Long-Term Vessel Trajectories Forecasting with Probabilistic Feature Fusion for Problem Shifting
by: Spadon, Gabriel, et al.
Published: (2023)

Multicoloured Hardcore Model: Fast Mixing and Queueing
by: Olesker-Taylor, Sam
Published: (2024)

MPXGAT: An Attention based Deep Learning Model for Multiplex Graphs Embedding
by: Bongiovanni, Marco, et al.
Published: (2024)

Frustrated Random Walks: A Fast Method to Compute Node Distances on Hypergraphs
by: Li, Enzhi, et al.
Published: (2024)

Ergodic properties of concurrent systems
by: Abbes, Samy, et al.
Published: (2025)

Noisy Nonadaptive Group Testing with Binary Splitting: New Test Design and Improvement on Price-Scarlett-Tan's Scheme
by: Li, Xiaxin, et al.
Published: (2024)

Revisiting Graph Homophily Measures
by: Mironov, Mikhail, et al.
Published: (2024)

Balanced colorings of Erdős-Rényi hypergraphs
by: Dhawan, Abhishek, et al.
Published: (2025)

Sharp Thresholds for Temporal Motifs and Doubling Time in Random Temporal Graphs
by: Austin, Henry, et al.
Published: (2026)

Chemically inspired Erdős-Rényi oriented hypergraphs
by: Garcia-Chung, Angel, et al.
Published: (2023)

Optimal Erasure Codes and Codes on Graphs
by: Chen, Yeyuan, et al.
Published: (2025)

On the clique number of random Cayley graphs and related topics
by: Conlon, David, et al.
Published: (2024)

Learning general conditional independence structures via the neighbourhood lattice
by: Amini, Arash A., et al.
Published: (2022)

An Incentive-Compatible Semi-Parallel Proof-of-Work Protocol
by: Doger, Mustafa, et al.
Published: (2025)

When Should Selfish Miners Double-Spend?
by: Doger, Mustafa, et al.
Published: (2025)

The Instability of all Backoff Protocols
by: Goldberg, Leslie Ann, et al.
Published: (2026)

Double Spending Analysis of Nakamoto Consensus for Time-Varying Mining Rates with Ruin Theory
by: Doger, Mustafa, et al.
Published: (2024)

On the Asymptotics of the Connectivity Probability of Random Bipartite Graphs
by: Chinyaev, Boris
Published: (2025)

Limit Laws for Critical Dispersion on Complete Graphs
by: De Ambroggio, Umberto, et al.
Published: (2024)