# Local and global expansion in random geometric graphs

@article{Liu2022LocalAG,
title={Local and global expansion in random geometric graphs},
author={Siqi Liu and Sidhanth Mohanty and Tselil Schramm and Elizabeth Yang},
journal={ArXiv},
year={2022},
volume={abs/2210.00158}
}
• Published 1 October 2022
• Mathematics
• ArXiv
Consider a random geometric 2-dimensional simplicial complex X sampled as follows: first, sample n vectors u1, . . . ,un uniformly at random on S d−1; then, for each triple i, j,k ∈ [n], add {i, j,k} and all of its subsets to X if and only if 〈 ui ,u j 〉 Ê τ,〈ui ,uk〉 Ê τ, and 〈 u j ,uk 〉 Ê τ. We prove that for every ε > 0, there exists a choice of d = Θ(logn) and τ = τ(ε,d) so that with high probability, X is a high-dimensional expander of average degree n in which each 1-link has spectral gap…

## References

SHOWING 1-10 OF 68 REFERENCES

• Mathematics
SODA '11
• 2011
It is shown that, for every d, the best value of the constant c = c(d) that can be achieved by such a construction is asymptotically equal to the limit of the overlap numbers of the complete (d + 1)-uniform hypergraphs with n vertices, as n → ∞.
• Mathematics, Computer Science
STOC
• 2019
It is shown that a high dimensional walk on a weighted simplicial complex mixes rapidly if for every link of the complex, the corresponding localized random walk on the 1-skeleton is a strong spectral expander, and an FPRAS is designed to count the number of bases of any matroid given by an independent set oracle.
• Computer Science, Mathematics
Random Struct. Algorithms
• 2016
The proof of the detection lower bound is based on a new bound on the total variation distance between a Wishart matrix and an appropriately normalized GOE matrix and a conjecture for the optimal detection boundary is made.
• Mathematics
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)
• 2019
Two families of (a,b) -regular graphs are constructed that expand both locally and globally and are examined vis-a-vis properties which are considered characteristic of high-dimensional expanders.
• Mathematics
Comb.
• 2006
It is shown that every graph of maximal degree d has a 2-lift such that all “new” eigenvalues are in the range, leading to a deterministic polynomial time algorithm for constructing arbitrarily large d-regular graphs, with second eigenvalue O(d/α)+1.
• Mathematics
• 2014
It is well-known that the $G(n,p)$ model of random graphs undergoes a dramatic change around $p=\frac 1n$. It is here that the random graph is, almost surely, no longer a forest, and here it first
• Mathematics, Computer Science
• 2012
We consider n-by-n matrices whose (i,j)-th entry is f(X T i Xj), where X1,...,Xn are i.i.d. standard Gaussian random vectors in Rp, and f is a real-valued function. The eigenvalue distribution of
• Mathematics
Random Struct. Algorithms
• 2008
This article identifies local obstructions that slow down the random walk, when the average degree d is at most O( √ ln n), proving that the mixing time in this case is ((ln n/d)2) asymptotically almost surely.
• Mathematics
STOC
• 2016
This work presents explicit bounded degree cosystolic expanders of every dimension and provides a local to global criterion on a complex that implies cosyStolic expansion, which solves affirmatively an open question raised by Gromov, whether there exist bounded degree complexes with the topological overlapping property in every dimension.
• Mathematics
2014 IEEE 55th Annual Symposium on Foundations of Computer Science
• 2014
This work presents an explicit construction of bounded degree complexes of dimension d = 2 which are high dimensional expanders and says that the 2-skeletons of the 3-dimensional Ramanujan complexes are topological expanders.