Mean Distance on Metric Graphs

被引:0
|
作者
Baptista, Luis N. [1 ,2 ]
Kennedy, James B. [1 ,2 ]
Mugnolo, Delio [3 ]
机构
[1] Univ Lisbon, Fac Ciencias, Dept Matemat, Edificio C6, P-1749016 Lisbon, Portugal
[2] Inst Super Tecn, Grp Fis Matemat, Ave Rovisco Pais, P-1049001 Lisbon, Portugal
[3] Fernuniv, Fak Math & Informat, Lehrgebiet Anal, D-58084 Hagen, Germany
关键词
Metric graph; Mean distance; Graph surgery; Laplacian; Spectral gap; Coarea formula; EIGENVALUES; DIAMETER;
D O I
10.1007/s12220-024-01574-0
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We introduce a natural notion of mean (or average) distance in the context of compact metric graphs, and study its relation to geometric properties of the graph. We show that it exhibits a striking number of parallels to the reciprocal of the spectral gap of the graph Laplacian with standard vertex conditions: it is maximised among all graphs of fixed length by the path graph (interval), or by the loop in the restricted class of doubly connected graphs, and it is minimised among all graphs of fixed length and number of edges by the equilateral flower graph. We also establish bounds for the correctly scaled product of the spectral gap and the square of the mean distance which depend only on combinatorial, and not metric, features of the graph. This raises the open question whether this product admits absolute upper and lower bounds valid on all compact metric graphs.
引用
收藏
页数:25
相关论文
共 50 条
  • [31] Stratified graphs and distance graphs
    Spence, SA
    ARS COMBINATORIA, 2000, 55 : 233 - 246
  • [32] On Mean Graphs
    Seoud, M. A.
    Salim, M. A.
    ARS COMBINATORIA, 2014, 115 : 13 - 34
  • [33] WHICH GRAPHS ARE DISTANCE GRAPHS
    CHARTRAND, G
    GODDARD, W
    HENNING, MA
    LESNIAK, L
    SWART, HC
    WALL, CE
    ARS COMBINATORIA, 1990, 29A : 225 - 232
  • [34] Uniform Metric Graphs
    Herron, David A.
    JOURNAL OF GEOMETRIC ANALYSIS, 2024, 34 (10)
  • [35] Floodings of metric graphs
    Krzysztof Burdzy
    Soumik Pal
    Probability Theory and Related Fields, 2020, 177 : 577 - 620
  • [36] On metric generators of graphs
    Sebó, A
    Tannier, E
    MATHEMATICS OF OPERATIONS RESEARCH, 2004, 29 (02) : 383 - 393
  • [37] Floodings of metric graphs
    Burdzy, Krzysztof
    Pal, Soumik
    PROBABILITY THEORY AND RELATED FIELDS, 2020, 177 (1-2) : 577 - 620
  • [38] DISTANCE IN GRAPHS
    ENTRINGER, RC
    JACKSON, DE
    SNYDER, DA
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 1976, 26 (02) : 283 - 296
  • [39] Ensemble-based clustering of large probabilistic graphs using neighborhood and distance metric learning
    Malihe Danesh
    Morteza Dorrigiv
    Farzin Yaghmaee
    The Journal of Supercomputing, 2021, 77 : 4107 - 4134
  • [40] Ensemble-based clustering of large probabilistic graphs using neighborhood and distance metric learning
    Danesh, Malihe
    Dorrigiv, Morteza
    Yaghmaee, Farzin
    JOURNAL OF SUPERCOMPUTING, 2021, 77 (04): : 4107 - 4134