Feb 26, 2015 · time. In this work, we take a first step towards proving (*) by showing the existence of shift k-lifts that preserve the Ramanujan property in ...
Constructing Ramanujan Graphs Using Shift Lifts - ResearchGate
www.researchgate.net › ... › Ramanujan
Shift $k$-lifts studied by Agarwal-Kolla-Madan lead to a natural approach for constructing Ramanujan graphs more efficiently. The number of possible shift $k$- ...
Constructing Ramanujan Graphs Using Shift Lifts. Karthekeyan Chandrasekaran ∗. Ameya Velingker†. Abstract. In a breakthrough work, Marcus et al. [15] recently ...
Sep 15, 2017 · Shift k-lifts studied in [2] lead to a natural approach for constructing Ramanujan graphs more efficiently. The number of possible shift k-lifts ...
People also ask
What is the Ramanujan graph?
This work takes a first step towards proving (?) by showing the existence of shift k-lifts that preserve the Ramanujan property in d-regular bipartite ...
Shift k-lifts studied in [2] lead to a natural approach for constructing Ramanujan graphs more efficiently. The number of possible shift k-lifts of a d-regular ...
Hello everyone! My name is Ameya Velingker, and I am a Research Scientist at Google Research (since October 2018). My research broadly encompasses topics ...
Bibliographic details on Constructing Ramanujan Graphs Using Shift Lifts.
In a breakthrough work, Marcus-Spielman-Srivastava recently showed that every$d$-regular bipartite Ramanujan graph has a 2-lift that is also ...
Shift k-lifts studied in [2] lead to a natural approach for constructing Ramanujan graphs more efficiently. The number of possible shift k-lifts of a d-regular ...