A Fast Binary Splitting Approach for Non-Adaptive Learning of Erd\H{o}s--R\'enyi Graphs

Researchers have developed a new binary splitting algorithm designed to efficiently identify the structure of Erdős-Rényi graphs by querying subsets of nodes. This method improves the process of mapping unknown network connections by requiring fewer group queries to determine if edges exist within a specific subset.