Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2611.07890

The second reconstruction transition for random graphs from 2-neighborhoods

Yiming Chen
View original source ↗Read source document ↗Export metadata ↓

Abstract

We prove that, with high probability, the Erdős--Rényi random graph $G(n,p)$ is reconstructible up to isomorphism from the multiset of its rooted induced 2-neighborhoods whenever $p\geq n^{-3/4}(\log n)^3$. Together with the non-reconstructibility result of Johnston, Kronenberg, Roberts and Scott, our result locates the second reconstruction transition at the scale $p=n^{-3/4}$ up to polylogarithmic factors, resolving a question they posed. Our proof relies on a global rigidity argument exploiting 5-cycle constraints.

Explore related subjects

math.PR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yiming Chen. 2026-11-05. The second reconstruction transition for random graphs from 2-neighborhoods. https://arxiv.org/abs/2611.07890

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Scaling limit of the colored ASEP and stochastic six-vertex models

We consider the colored asymmetric simple exclusion process (ASEP) and stochastic six vertex (S6V) model with fully packed initial conditions; the states of these models can be encoded by 2-parameter height functions. We show under Kardar-Parisi-Zhang (KPZ) scaling of time, space, and fluctuations that these height functions converge to the Airy sheet. Several corollaries follow. (1) For ASEP and the S6V model under the basic coupling, we consider the 4-parameter height function at position $y$ and time $t$ with a step initial condition at position $x$ and time $s < t$, and prove that under KPZ scaling it converges to the directed landscape. (2) As a consequence, in our paper arXiv:2412.18117, we prove that ASEPs and S6V models under the basic coupling, with multiple general initial data, converge to KPZ fixed points coupled through the directed landscape. (3) We prove that the colored ASEP stationary measures converge to the stationary horizon. (4) We prove a form of decoupling for the colored ASEP height functions, as well as for the stationary two-point function, as broadly predicted by the theory of non-linear fluctuating hydrodynamics. The starting point for our Airy sheet convergence result is an embedding of these colored models into a larger structure -- a color-indexed family of coupled line ensembles with an explicit Gibbs property, i.e., a colored Hall-Littlewood line ensemble. The core of our work then becomes to develop a framework to analyze the edge scaling limit of these ensembles.

math.PR↗
arXiv2026

Operator level soft edge to bulk transition in $β$-ensembles via canonical systems

The stochastic Airy and sine operators, which are respectively a random Sturm-Liouville operator and a random Dirac operator, characterize the soft edge and bulk scaling limits of $β$-ensembles. Dirac and Sturm-Liouville operators are distinct operator classes which can both be represented as canonical systems, which gives a unified framework for defining important properties, such as their spectral data. Seeing both as canonical systems, we prove that in a suitable high-energy scaling limit, the Airy operator converges to the sine operator. We prove this convergence in the vague topology of canonical systems' coefficient matrices, and deduce the convergence of the associated Weyl-Titchmarsh functions and spectral measures. Our proof relies on a coupling between the Brownian paths that drive the two operators, under which the convergence holds in probability. This extends the corresponding result at the level of the eigenvalue point processes, proven by Valkó and Virág (2009) by comparison to the Gaussian $β$-ensemble.

math.PR↗
arXiv2026

Averaging principle for rough slow-fast systems of level 3

The averaging principle for slow-fast systems of various kind of stochastic (partial) differential equations has been extensively studied. An analogous result was shown for slow-fast systems of rough differential equations driven by random rough paths a few years ago and the study of ``rough slow-fast systems" seems to be gaining momentum now. In all known results, however, the driving rough paths are of level 2. In this paper we formulate rough slow-fast systems driven by random rough paths of level 3 and prove the strong averaging principle of Khas'minskii-type.

math.PR↗