首页> 外文期刊>Discrete mathematics, algorithms, and applications >ON CONSTRUCTION OFALMOST-RAMANUJAN GRAPHS
【24h】

ON CONSTRUCTION OFALMOST-RAMANUJAN GRAPHS

机译:关于高空无人攀爬绳的构造

获取原文
获取原文并翻译 | 示例
       

摘要

O. Reingold et al. introduced the notion zig-zag product on two different graphs, and pre-sented a fully explicit construction of d-regular expanders with the second largest eigen-value 0(d-1/3). In the same paper, they ask whether or not the similar technique can beused to construct expanders with the second largest eigenvalue 0(d-1/2). Such graphsare called Ramanujan graphs. Recently, zig-zag product has been generalized by A. Ben-Aroya and A. Ta-Shma. Using this technique, they present a family of expanders with the 1/2+o(1)second largest eigenvalue d-o(1), what they call almost-Ramanujan graphs. How- ever, their construction relies on local invertible functions and the dependence betweenthe 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 sizewill be formalized. By choosing the big graph and several small graphs individually, weshall present a family of fully explicitly almost-Ramanujan graphs with locally invertiblefunction waived.
机译:O. Reingold等。在两个不同的图上引入了Zig-zag乘积的概念,并预示了具有第二大特征值0(d-1 / 3)的d-正则展开器的完全显式构造。在同一篇论文中,他们询问是否可以使用类似的技术来构造具有第二大特征值0(d-1 / 2)的扩展器。这样的图称为拉马努扬图。最近,A。Ben-Aroya和A. Ta-Shma推广了之字形产品。他们使用这种技术提出了一个扩展器族,它们具有1/2 + o(1)第二个最大特征值d-o(1),他们称之为几乎Ramanujan图。但是,它们的构造依赖于局部可逆函数以及大图和几个小图之间的依赖性,这使得构造更加复杂。在本文中,我们将给出一个曲折乘积的广义定理。具体来说,一个“大”图和几个“小”图具有相同大小的之字形乘积将被形式化。通过分别选择大图和几个小图,我们将给出一族完全放弃了可逆函数的完全明确的几乎拉曼努扬图。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号