In this note, we give very simple constructions of unique neighbor expander graphs starting from spectral or combinatorial expander graphs of mild expansion. These constructions and their analysis are simple variants of the constructions of LDPC error-correcting codes from expanders, given by Sipser-Spielman\cite{SS96} (and Tanner\cite{Tanner81}), and their analysis. We also show how to obtain expanders with many unique neighbors using similar ideas. There were many exciting results on this topic recently, starting with Asherov-Dinur\cite{AD23} and Hsieh-McKenzie-Mohanty-Paredes\cite{HMMP23}, who gave a similar construction of unique neighbor expander graphs, but using more sophisticated ingredients (such as almost-Ramanujan graphs) and a more involved analysis. Subsequent beautiful works of Cohen-Roth-TaShma\cite{CRT23} and Golowich\cite{Golowich23} gave even stronger objects (lossless expanders), but also using sophisticated ingredients. The main contribution of this work is that we get much more elementary constructions of unique neighbor expanders and with a simpler analysis.

翻译：本文中，我们从具有温和扩展性的谱扩展图或组合扩展图出发，给出了唯一邻接扩展图的非常简单的构造方法。这些构造及其分析是Sipser-Spielman\cite{SS96}（以及Tanner\cite{Tanner81}）给出的从扩展图构造LDPC纠错码的方法及其分析的简单变体。我们还展示了如何利用类似思想获得具有多个唯一邻接点的扩展图。近年来，这一领域涌现了许多激动人心的成果，始于Asherov-Dinur\cite{AD23}和Hsieh-McKenzie-Mohanty-Paredes\cite{HMMP23}，他们给出了唯一邻接扩展图的类似构造，但使用了更复杂的工具（如几乎拉马努金图）和更复杂的分析。随后Cohen-Roth-TaShma\cite{CRT23}和Golowich\cite{Golowich23}的杰出工作给出了更强的对象（无损扩展图），但同样使用了复杂的工具。本文的主要贡献在于，我们获得了更初等的唯一邻接扩展图构造方法，且分析更为简单。