论文信息 - Counting Walks and Graph Homomorphisms via Markov Chains and Importance Sampling

Counting Walks and Graph Homomorphisms via Markov Chains and Importance Sampling

Abstract Hoffman [7] proved a matrix inequality that yields a useful upper bound on the number of walks in a graph. Sidorenko [14] extended the bound on the number of walks to a bound on the number of homomorphisms from a tree to a graph. In this expository note, we give a short probabilistic proof of both results, using the basic identity of importance sampling.

David A. Levin | Yuval Peres

[1] Elizabeth L. Wilmer,et al. Markov Chains and Mixing Times , 2008 .

[2] A. J. Hoffman. Three Observations on Nonnegative Matrices , 1967 .

[3] Mireille Bousquet-Mélou,et al. On the Importance Sampling of Self-Avoiding Walks , 2011, Combinatorics, Probability and Computing.

[4] Avishay Tal,et al. Degree and Sensitivity: tails of two distributions , 2016, Electron. Colloquium Comput. Complex..

[5] Yuval Peres,et al. Markov chains indexed by trees , 1994 .

[6] Miguel Angel Fiol,et al. Number of walks and degree powers in a graph , 2009, Discret. Math..

[7] Alexander Sidorenko. A partially ordered set of functionals corresponding to graphs , 1994, Discret. Math..

[8] D E Knuth,et al. Mathematics and Computer Science: Coping with Finiteness , 1976, Science.

[9] M. Bálek,et al. Large Networks and Graph Limits , 2022 .

[10] Péter Csikvári,et al. Graph Homomorphisms between Trees , 2013, Electron. J. Comb..

[11] David London. Two inequalities in nonnegative symmetric matrices , 1966 .

[12] A. F. Sidorenko. Proof of london's conjecture on sums of elements of positive matrices , 1985 .

[13] P. Diaconis,et al. The sample size required in importance sampling , 2015, 1511.01437.

[14] Alexander Sidorenko,et al. A correlation inequality for bipartite graphs , 1993, Graphs Comb..

[15] Hanjo Täubig. The number of walks and degree powers in directed graphs , 2012 .