加载中…
Let be a permutation invariant random matrix and another random matrix. We give a quantitative bound on the difference between the diagonal of the resolvent of and the diagonal of the resolvent of the free sum with amalgamation over the diagonal of and . Moreover, we improve the rate of convergence whenever the matrices and are sparse and bounded in operator norm. Doing so, we explicitly construct the free sum over the diagonal of and as an adjacency operator of a weighted locally finite graph.

生成讲解博客的中文版本

生成AI智能校验的中文版本