We consider the task of estimating the latent vertex correspondence betw...
We study local canonical labeling algorithms on an Erdős–Rényi random
gr...
This paper studies how a centralized planner can modify the structure of...
We consider the problem of learning latent community structure from mult...
We study random graphs with latent geometric structure, where the probab...
We consider the task of learning latent community structure from multipl...
We study the problem of detecting latent geometric structure in random
g...
Tree trace reconstruction aims to learn the binary node labels of a tree...
In the usual trace reconstruction problem, the goal is to exactly recons...
Large pools of synthetic DNA molecules have been recently used to reliab...
Recent work, motivated by anonymous messaging platforms, has introduced
...
We introduce a new model of correlated randomly growing graphs and study...
Recent years have seen a marked increase in the spread of misinformation...
We consider a variant of the planted clique problem where we are allowed...
We study the problem of learning a node-labeled tree given independent t...
Consider algorithms with unbounded computation time that probe the entri...
It is well known that sequential decision making may lead to information...