Graph homomorphisms through random walks
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2151249
- An interlacing technique for spectra of random walks and its application to finite percolation clusters
- Comparison theory for Markov chains on different state spaces and application to random walk on derangements
- Markov chains on hypercubes: Spectral representations and several majorization relations
- Random flights on regular graphs
- Publication:4946132
- Avoidance coupling
- Random walks on Diestel-Leader graphs
- scientific article; zbMATH DE number 878897
Cites work
- Discrete groups, expanding graphs and invariant measures. With an appendix by Jonathan D. Rogawski
- scientific article; zbMATH DE number 3668627 (Why is no real title available?)
- scientific article; zbMATH DE number 1118889 (Why is no real title available?)
- Interlacing eigenvalues and graphs
- Matrix Analysis
- Time to Reach Stationarity in the Bernoulli–Laplace Diffusion Model
Cited in
(14)- On colorings of graph powers
- The good, the bad, and the great: homomorphisms and cores of random graphs
- A note on random homomorphism from arbitrary graphs to \(\mathbb{Z}\)
- Circular colouring and algebraic no-homomorphism theorems
- Graph homomorphisms via vector colorings
- On cylindrical graph construction and its applications
- Graph lattice: random walk and combinatorial identities
- A note on Random Homomorphism from ArbitraryGraphs to Z
- Counting Walks and Graph Homomorphisms via Markov Chains and Importance Sampling
- scientific article; zbMATH DE number 2151249 (Why is no real title available?)
- Graph homomorphisms and nodal domains
- Density and power graphs in graph homomorphism problem
- Bounds for visual cryptography schemes
- On the isoperimetric spectrum of graphs and its approximations
This page was built for publication: Graph homomorphisms through random walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4434546)
