Graph curvature and local discrepancy

IF 0.9 3区数学 Q2 MATHEMATICS

Journal of Graph Theory Pub Date : 2024-09-24 DOI:10.1002/jgt.23176

Paul Horn, Adam Purcilly, Alex Stevens

{"title":"Graph curvature and local discrepancy","authors":"Paul Horn, Adam Purcilly, Alex Stevens","doi":"10.1002/jgt.23176","DOIUrl":null,"url":null,"abstract":"<p>In recent years, discrete notions of curvature have been defined and exploited to understand various geometric properties of graphs; especially regarding heat flow, and spectral properties. In this paper, we study various combinatorial properties implied by satisfying the Bakry–Émery curvature dimension inequality <span></span><math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>C</mi>\n \n <mi>D</mi>\n \n <mrow>\n <mo>(</mo>\n \n <mrow>\n <mi>∞</mi>\n \n <mo>,</mo>\n \n <mi>K</mi>\n </mrow>\n \n <mo>)</mo>\n </mrow>\n </mrow>\n </mrow>\n <annotation> $CD(\\infty ,K)$</annotation>\n </semantics></math>. In particular we derive a local discrepancy inequality, similar in spirit to the expander mixing lemma from spectral graph theory, which certifies a type of “local pseudo-randomness” of the edge set of the graph, for graphs satisfying a curvature lower bound. In addition, several other consequences are derived regarding graph connectivity and cycle statistics of the graph.</p>","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"108 2","pages":"337-360"},"PeriodicalIF":0.9000,"publicationDate":"2024-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Graph Theory","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23176","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

Abstract

In recent years, discrete notions of curvature have been defined and exploited to understand various geometric properties of graphs; especially regarding heat flow, and spectral properties. In this paper, we study various combinatorial properties implied by satisfying the Bakry–Émery curvature dimension inequality $C D (\infty, K)$ . In particular we derive a local discrepancy inequality, similar in spirit to the expander mixing lemma from spectral graph theory, which certifies a type of “local pseudo-randomness” of the edge set of the graph, for graphs satisfying a curvature lower bound. In addition, several other consequences are derived regarding graph connectivity and cycle statistics of the graph.

查看原文本刊更多论文

求助全文

约1分钟内获得全文求助全文

来源期刊

Journal of Graph Theory 数学-数学

CiteScore

1.60

自引率

22.20%

发文量

130

审稿时长

6-12 weeks

期刊介绍： The Journal of Graph Theory is devoted to a variety of topics in graph theory, such as structural results about graphs, graph algorithms with theoretical emphasis, and discrete optimization on graphs. The scope of the journal also includes related areas in combinatorics and the interaction of graph theory with other mathematical sciences. A subscription to the Journal of Graph Theory includes a subscription to the Journal of Combinatorial Designs .