Horospherical random graphs

arXiv (Cornell University)(2021)

引用 0|浏览5
暂无评分
摘要
Expanders are sparse graph that are strongly connected, where strong is quantified using eigenvalues of the adjacency matrix, and sparsity in terms of vertex valency. We give a model of random graphs and study their expansion properties. This model is a particular case of soft geometric random graphs, and allows to construct sparse graphs with good expansion properties, as well as highly clustered ones.
更多
查看译文
关键词
Hypergraphs,Graph Limits
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要