Large Deviations for Sparse Graphs

被引:0
|
作者
Chatterjee, Sourav [1 ]
机构
[1] Stanford Univ, Dept Stat, Stanford, CA 94305 USA
关键词
CONCENTRATION INEQUALITIES; STEINS METHOD;
D O I
10.1007/978-3-319-65816-2_8
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
引用
收藏
页码:119 / 164
页数:46
相关论文
共 50 条
  • [41] Identifying sparse and dense sub-graphs in large graphs with a fast algorithm
    Fioriti, Vincenzo
    Chinnici, Marta
    EPL, 2014, 108 (05)
  • [42] Spectral deviations of graphs
    Stanic, Zoran
    SPECIAL MATRICES, 2025, 13 (01):
  • [43] A large-deviations principle for all the components in a sparse inhomogeneous random graph
    Luisa Andreis
    Wolfgang König
    Heide Langhammer
    Robert I. A. Patterson
    Probability Theory and Related Fields, 2023, 186 : 521 - 620
  • [44] A large-deviations principle for all the components in a sparse inhomogeneous random graph
    Andreis, Luisa
    Koenig, Wolfgang
    Langhammer, Heide
    Patterson, Robert I. A.
    PROBABILITY THEORY AND RELATED FIELDS, 2023, 186 (1-2) : 521 - 620
  • [45] Large deviations for cascades and cascades of large deviations
    Rouault, A
    MATHEMATICS AND COMPUTER SCIENCE III: ALGORITHMS, TREES, COMBINATORICS AND PROBABILITIES, 2004, : 351 - 362
  • [46] Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs
    Chen, Lu
    Liu, Chengfei
    Zhou, Rui
    Xu, Jiajie
    Li, Jianxin
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2022, 15 (08): : 1559 - 1571
  • [47] EIGENVALUE DISTRIBUTION OF LARGE WEIGHTED MULTIPARTITE RANDOM SPARSE GRAPHS
    Vengerovsky, Valentin
    arXiv,
  • [48] A parallel maximum clique algorithm for large and massive sparse graphs
    Pablo San Segundo
    Alvaro Lopez
    Jorge Artieda
    Panos M. Pardalos
    Optimization Letters, 2017, 11 : 343 - 358
  • [49] Less is More: Compact Matrix Decomposition for Large Sparse Graphs
    Sun, Jimeng
    Xie, Yinglian
    Zhang, Hui
    Faloutsos, Christos
    PROCEEDINGS OF THE SEVENTH SIAM INTERNATIONAL CONFERENCE ON DATA MINING, 2007, : 366 - 377
  • [50] Efficient Maximum Clique Computation over Large Sparse Graphs
    Chang, Lijun
    KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2019, : 529 - 538