We study a network-archaeology problem for a dynamic graph whose latent substrate is a random recursive tree and whose observed topology is enriched by an independent homogeneous Erdős-Rényi shortcut layer. From a single unlabeled snapshot, the goal is to construct a confidence set of deterministic size for the first vertex. Since shortcut edges create cycles, the usual tree-based arguments using Jordan centrality do not apply directly. Our method uses auxiliary subcritical bond percolation to expose a tree-like renormalized structure: retained recursive-tree clusters form heavy-tailed blobs, retained shortcuts connect these blobs through a subcritical rank-one random graph, and large components are leading backbone blobs decorated by subcritical shortcut pieces. Applying Jordan centrality inside the largest auxiliary percolation components then gives a deterministic-size root confidence set for the cyclic observed network.
🌊
