Relative expanders or weakly relatively Ramanujan graphs-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Relative expanders or weakly relatively Ramanujan graphs

Published:2003-05-15 Issue:1 Volume:118 Page:
ISSN:0012-7094
Container-title:Duke Mathematical Journal
language:
Short-container-title:Duke Math. J.

Author:

Friedman Joel

Publisher

Duke University Press

Subject

General Mathematics

Reference19 articles.

1. N. Alon, ``Eigenvalues and expanders'' in Theory of Computing (Singer Island, Fla., 1984), Combinatorica 6 (1986), 83--96.

2. A. Amit and N. Linial, Random graph coverings, I: General theory and graph connectivity, Combinatorica 22 (2002), 1--18.

3. --------, Random graph coverings, II: Edge expansion, to appear in Combin. Probab. Comput.

4. A. Amit, N. Linial, and J. Matoušek, Random lifts of graphs: Independence and chromatic number, Random Structures Algorithms 20 (2002), 1--22.

5. A. Broder and E. Shamir, ``On the second eigenvalue of random regular graphs'' in 28th Annual Symposium on Foundations of Computer Science (Los Angeles, 1987), IEEE Comput. Soc. Press, Washington, D.C., 1987, 286--294.

Cited by 49 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Energy-Efficient Decentralized Learning Via Graph Sparsification;ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP);2024-04-14

2. Spectrum of random d‐regular graphs up to the edge;Communications on Pure and Applied Mathematics;2023-09-28

3. A note on the trace method for random regular graphs;Israel Journal of Mathematics;2023-09

4. New High Dimensional Expanders from Covers;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

5. Depth Descent Synchronization in $${{\,\mathrm{\text {SO}}\,}}(D)$$;International Journal of Computer Vision;2023-01-03

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3