Publisher
Springer Science and Business Media LLC
Reference11 articles.
1. Bloem-Reddy, B., Orbanz, P.: Random-walk models of network formation and sequential Monte Carlo methods for graphs. J. R. Stat. Soc. Series B Stat. Methodol. 79(4), 1119–1146 (2017)
2. Charles, R.: Cutoff at the entropic time for random walks on covered expander graphs. J. Inst. Math. Jussieu 21(5), 1571–1616 (2022)
3. Chung, F.R.K.: The Laplacian of a hypergraph. Proc. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 10, 21–36 (1993)
4. Ernersto, E., Grant, K.R.: Centralities in simplicial complexes applications to protein interaction networks. J. Theor. Biol. 438, 46–60 (2018)
5. Facundo, M., Zhengchao, W., Yusu, W.: Persistent Laplacians: properties, algorithms and implications. SIAM J. Appl. Math. 4, 858 (2020)