Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 6 of 6 for “"ramanujan graph"”.

  1. Ramanujan graphs

    This thesis explores the area of Ramanujan graphs, gives details of most of the known constructions, and explores results related to Ramanujan graphs including Generalized Ramanujan graphs. In addition, it also describes programming many different Ramanujan graph constructions.

    manitoba Repository record for Ramanujan graphs (opens in a new tab)

  2. Bounds on k-Regular Ramanujan Graphs and Separator Theorems

    Expander graphs are a family of graphs that are highly connected. Finding explicit examples of expander graphs which are also sparse is a difficult problem. The best type of expander graph in a. certain sense is a Ramanujan graph. Families of graphs that have separator theorems fail to be Ramanujan …

    wku-diss Repository record for Bounds on k-Regular Ramanujan Graphs and Separator Theorems (opens in a new tab)

  3. Expedition in Data and Harmonic Analysis on Graphs

    The graph Laplacian operator is widely studied in spectral graph theory largely due to its importance in modern data analysis. Recently, the Fourier transform and other time-frequency operators have been defined on graphs using Laplacian eigenvalues and eigenvectors. We extend these results and …

    maryland Repository record for Expedition in Data and Harmonic Analysis on Graphs (opens in a new tab)

  4. Phase Retrieval for Finitely-Supported Complex Measures via the Fourier Transform

    … are encoded as vertices of a graph, and edges of this graph correspond to interference measurements. In particular, if $\Lambda\Omega<s$, $d\geq 3$ and there is a Ramanujan graph, $\Gamma$, that is $d$-regular on …

    houston Repository record for Phase Retrieval for Finitely-Supported Complex Measures via the Fourier Transform (opens in a new tab)

  5. Unique Games Conjecture : the Boolean Hypercube and connections to graph lifts

    … the Unique Games Conjecture when the constraint graph is restricted to the Boolean Hypercube. The Boolean Hypercube is a well studied graph family on which existing spectral methods fail to achieve a sub exponential time bound. We initiate the study of the behaviour of the standard semi-definite …

    uiuc Repository record for Unique Games Conjecture : the Boolean Hypercube and connections to graph lifts (opens in a new tab)

  6. The Expanding Constant, Ramanujan Graphs, and Winnie Li Graphs

    The expanding constant is a measure of graph connectivity that is important for certain applications. This paper discusses the mathematical foundations for the construction of Winnie Li's graphs and for the proof that Winnie Li's graphs are Ramanujan. The paper also establishes the implications of …

    vt Repository record for The Expanding Constant, Ramanujan Graphs, and Winnie Li Graphs (opens in a new tab)