87 citations · 454 across the 24 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
math.CO2019★ 2 cited
Free flags over local rings and powering of high dimensional expanders
Tali Kaufman, Ori Parzanchevski
Powering the adjacency matrix of an expander graph results in a better expander of higher degree. In this paper we seek an analogue operation for high-dimensional expanders. We sho…
math.NT2019★ 6 cited
From Ramanujan Graphs to Ramanujan Complexes
Alexander Lubotzky, Ori Parzanchevski
Ramanujan graphs are graphs whose spectrum is bounded optimally. Such graphs have found numerous applications in combinatorics and computer science. In recent years, a high dimensi…
math.PR2019★ 4 cited
Cutoff on Ramanujan complexes and classical groups
Michael Chapman, Ori Parzanchevski
The total-variation cutoff phenomenon has been conjectured to hold for simple random walk on all transitive expanders. However, very little is actually known regarding this conject…