Author:
Tikhomirov Konstantin,Youssef Pierre
Funder
Alfred P. Sloan Foundation
Publisher
Springer Science and Business Media LLC
Subject
Statistics, Probability and Uncertainty,Statistics and Probability,Analysis
Reference62 articles.
1. Aldous, D.: Some inequalities for reversible Markov chains. J. Lond. Math Soc. 25(2), 557–564 (1982)
2. Amanatidis, G., Kleer, P.: Rapid mixing of the switch Markov chain for strongly stable degree sequences and 2-class joint degree matrices. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 966–985 (2019)
3. Bannink, T., van der Hofstad, R., Stegehuis, C.: Switch chain mixing times and triangle counts in simple random graphs with given degrees. J. Complex Netw. 7, 210–225 (2019)
4. Basak, A., Cook, N., Zeitouni, O.: Circular law for the sum of random permutation matrices. Electron. J. Probab. 23(33), 1–51 (2018)
5. Bayati, M., Kim, J.H., Saberi, A.: A sequential algorithm for generating random graphs. Algorithmica 58(4), 860–910 (2010)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献