Consistent Recovery Threshold of Hidden Nearest Neighbor Graphs

Ding Jian,Wu Yihong,Xu Jiaming,Yang Dana

IEEE Transactions on Information Theory（2021）

引用 4|浏览64

暂无评分

摘要

Motivated by applications such as discovering strong ties in social networks and assembling genome subsequences in biology, we study the problem of recovering a hidden $2k$ -nearest neighbor (NN) graph in an $n$ -vertex complete graph, whose edge weights a...

查看译文

关键词

Genomics,Bioinformatics,Social networking (online),Artificial neural networks,Sequential analysis,Noise measurement,Joining processes

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要