On Construction of Almost-Ramanujan Graphs

نویسندگان

  • He Sun
  • Hong Zhu
چکیده

Reingold et al. introduced the notion zig-zag product on two different graphs, and presented a fully explicit construction of dregular expanders with the second largest eigenvalue O(d−1/3). In the same paper, they ask whether or not the similar technique can be used to construct expanders with the second largest eigenvalue O(d−1/2). Such graphs are called Ramanujan graphs. Recently, zig-zag product has been generalized by Ben-Aroya and Ta-Shma. Using this technique, they present a family of expanders with the second largest eigenvalue d−1/2+o(1), what they call almost-Ramanujan graphs. However, their construction relies on local invertible functions and the dependence between the big graph and several small graphs, which makes the construction more complicated. In this paper, we shall give a generalized theorem of zig-zag product. Specifically, the zig-zag product of one “big” graph and several “small” graphs with the same size will be formalized. By choosing the big graph and several small graphs individually, we shall present a family of fully explicitly almost-Ramanujan graphs with locally invertible function waived.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Expander Graphs and Gaps between Primes∗

The explicit construction of infinite families of d-regular graphs which are Ramanujan is known only in the case d−1 is a prime power. In this paper, we consider the case when d− 1 is not a prime power. The main result is that by perturbing known Ramanujan graphs and using results about gaps between consecutive primes, we are able to construct infinite families of “almost” Ramanujan graphs for ...

متن کامل

Expander graphs and gaps between primes * Sebastian

The explicit construction of infinite families of d-regular graphs which are Ramanujan is known only in the case d 1 is a prime power. In this paper, we consider the case when d 1 is not a prime power. The main result is that by perturbing known Ramanujan graphs and using results about gaps between consecutive primes, we are able to construct infinite families of ‘‘almost’’ Ramanujan graphs for...

متن کامل

Ramanujan Edge-Indexed Graphs

The construction of Ramanujan graphs has been of great interest. Ramanujan graphs have many applications in computer science. For a comprehensive survey see [10]. The first explicit construction was done independently by Margulis [12] (related papers are [13, 14]) and Lubotzky et al. [11] who introduced the name ``Ramanujan'' for these graphs. However, it seems that these graphs first appeared ...

متن کامل

Families of Ramanujan Graphs and Quaternion Algebras

Expander graphs are graphs in which the neighbors of any given “not too large” set of vertices X form a large set relative to the size of X—rumors tend to spread very fast. Among those, the Ramanujan graphs are extremal in their expansion properties. To be precise, the eigenvalues of the adjacency matrix have an extremal property that guarantees good expansion properties. Expanders, and hence R...

متن کامل

Ramanujan Graphs and Shimura Curves

What follows are some long, rambling notes of mine on Ramanujan graphs. For a period of about two months in 2006 I thought very intensely on this subject and had thoughts running in several different directions. In paricular this document contains the most complete exposition so far of my construction of expander graphs using Hecke operators on Shimura curves. I am posting this document now (Ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Math., Alg. and Appl.

دوره 1  شماره 

صفحات  -

تاریخ انتشار 2009