EIGENVALUE DISTRIBUTION OF LARGE WEIGHTED MULTIPARTITE RANDOM SPARSE GRAPHS

被引：0
|
作者：
Vengerovsky, Valentin [1 ]
机构：
[1] B. Verkin Institute for Low Temperature Physics and Engineering, National Academy of Sciences of Ukraine, 47 Nauky Ave., Kharkiv,61103, Ukraine
来源：
arXiv |
关键词：
Compilation and indexing terms; Copyright 2025 Elsevier Inc;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Graph theory - Probability distributions - Thorium alloys
引用
收藏
相关论文
共 50 条
  • [31] The von Neumann entropy of random multipartite graphs
    Hu, Dan
    Li, Xueliang
    Liu, Xiaogang
    Zhang, Shenggui
    DISCRETE APPLIED MATHEMATICS, 2017, 232 : 201 - 206
  • [32] Subdivision number of large complete graphs and large complete multipartite graphs
    Gervacio, SV
    COMBINATORIAL GEOMETRY AND GRAPH THEORY, 2005, 3330 : 94 - 101
  • [33] Addressing Johnson Graphs, Complete Multipartite Graphs, Odd Cycles, and Random Graphs
    Alon, Noga
    Cioaba, Sebastian M.
    Gilbert, Brandon D.
    Koolen, Jack H.
    McKay, Brendan D.
    EXPERIMENTAL MATHEMATICS, 2021, 30 (03) : 372 - 382
  • [34] EIGENVALUE ASYMPTOTICS FOR SCHRODINGER OPERATORS ON SPARSE GRAPHS
    Bonnefont, Michel
    Golenia, Sylvain
    Keller, Matthias
    ANNALES DE L INSTITUT FOURIER, 2015, 65 (05) : 1969 - 1998
  • [35] Central limit theorem for fluctuations of linear eigenvalue statistics of large random graphs
    Shcherbina, Mariya
    Tirozzi, Brunello
    JOURNAL OF MATHEMATICAL PHYSICS, 2010, 51 (02)
  • [36] The diameter of sparse random graphs
    Chung, F
    Lu, LY
    ADVANCES IN APPLIED MATHEMATICS, 2001, 26 (04) : 257 - 279
  • [37] Bisecting sparse random graphs
    Luczak, MJ
    McDiarmid, C
    RANDOM STRUCTURES & ALGORITHMS, 2001, 18 (01) : 31 - 38
  • [38] Large deviations of the greedy independent set algorithm on sparse random graphs
    Kolesnik, Brett
    RANDOM STRUCTURES & ALGORITHMS, 2022, 61 (02) : 353 - 363
  • [39] Large triangle packings and Tuza's conjecture in sparse random graphs
    Bennett, Patrick
    Dudek, Andrzej
    Zerbib, Shira
    COMBINATORICS PROBABILITY & COMPUTING, 2020, 29 (05): : 757 - 779
  • [40] Dismantling sparse random graphs
    Department of Mathematics, Uppsala University, PO Box 480, SE-75.1 06 Uppsala, Sweden
    不详
    Comb. Probab. Comput., 2008, 2 (259-264):
12345