21 citations · 22 across the 4 of their papers we have counts for
6 papers
On the largest common subtree of uniform attachment trees
Johannes Bäumler, Céline Kerriou, Bas Lodewijks +4
We study the largest common subtree of two independent unlabeled uniform attachment trees (also known as random recursive trees). Our main result shows that, when the two trees hav…
Correlated uniform attachment trees
Johannes Bäumler, Miklós Z. Rácz, Nathan Ross +1
We introduce and study a new model of correlated uniform attachment (UA) trees, where correlation is sprinkled throughout the time evolution of the process. In this model, two UA t…
Matching Correlated Inhomogeneous Random Graphs using the -core Estimator
Miklós Z. Rácz, Anirudh Sridhar
We consider the task of estimating the latent vertex correspondence between two edge-correlated random graphs with generic, inhomogeneous structure. We study the so-called \emph{$k…
Average-case and smoothed analysis of graph isomorphism
Julia Gaudio, Miklós Z. Rácz, Anirudh Sridhar
We propose a simple and efficient local algorithm for graph isomorphism which succeeds for a large class of sparse graphs. This algorithm produces a low-depth canonical labeling, w…
Tree trace reconstruction using subtraces
Tatiana Brailovskaya, Miklós Z. Rácz
Tree trace reconstruction aims to learn the binary node labels of a tree, given independent samples of the tree passed through an appropriately defined deletion channel. In recent…
Multidimensional sticky Brownian motions as limits of exclusion processes
Miklós Z. Rácz, Mykhaylo Shkolnikov
We study exclusion processes on the integer lattice in which particles change their velocities due to stickiness. Specifically, whenever two or more particles occupy adjacent sites…