Random walks and orthogonal functions associated with highly symmetric graphs
DOI10.1016/0012-365X(94)00038-KzbMATH Open0835.05045WikidataQ56992154 ScholiaQ56992154MaRDI QIDQ1901043FDOQ1901043
Authors: Peter F. Stadler
Publication date: 22 April 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- Random walks on highly symmetric graphs
- High-order random walks and generalized Laplacians on hypergraphs
- Algebraic random walks in the setting of symmetric functions
- scientific article; zbMATH DE number 2128200
- High-ordered random walks and generalized Laplacians on hypergraphs
- Random walks on digraphs, the generalized digraph Laplacian and the degree of asymmetry
- scientific article; zbMATH DE number 2151249
- Random walks on quasisymmetric functions
- Random walks on symmetric spaces and inequalities for matrix spectra
random walksorthogonal functionsautocorrelation functionsvertex transitive graphsspin glass modelisotropic random fields
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random graphs (graph-theoretic aspects) (05C80) Sums of independent random variables; random walks (60G50) Combinatorial probability (60C05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generating a random permutation with random transpositions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Krawtchouk Polynomials, a Unification of Two Different Group Theoretic Interpretations
- Correlated and uncorrelated fitness landscapes and how to tell the difference
- Application of statistical mechanics to NP-complete problems in combinatorial optimisation
- The landscape of the traveling salesman problem
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: Random walks and orthogonal functions associated with highly symmetric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1901043)