At this point there was already some interest from the theoretical computer science community. The fact that high dimensional expansion is related to property testing in computer science was observed for the first time in [1]}. The first author and Kaufman proved that high dimensional expansion implies an efficient agreement-test [2]}, which is related to both PCPs and LTCs. Anari et al [3]} resolved a conjecture regarding convergence of certain Markov chains by analyzing the global random walk through local analysis at the links.
