Relations between connected and self-avoiding hikes in labelled complete digraphs

DOI10.1007/S00373-016-1696-9MaRDI QIDQ343737zbMATH OpenOpenAlexFDO

Authors Thibault Espinasse, Paul Rochet

Publication date 29 November 2016

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-016-1696-9

zbMATH Keywords

directed graphposetincidence algebrawalkweighted adjacency matrix

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Recommendations

• Algebraic combinatorics on trace monoids: extending number theory to walks on graphs
• Random self-avoiding walks on one-dimensional lattices
• Self-avoiding walk on the complete graph
• Walks on directed graphs and matrix polynomials
• scientific article; zbMATH DE number 4070938

Cites work

• scientific article; zbMATH DE number 45380 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• Combinatorial problems of commutation and rearrangements
• Eigenspaces of graphs
• Estimating the transition matrix of a Markov chain observed at random times
• Estimation of Time-Varying Markov Processes with Aggregate Data
• Hypothesis testing for Markovian models with random time observations
• Matrices, Digraphs, and Determinants
• Random walks and diffusions on graphs and databases. An introduction.
• Random walks on graphs: ideas, techniques and results
• Self-Avoiding Paths and the Adjacency Matrix of a Graph
• The Determinant of the Adjacency Matrix of a Graph
• Time changes of Markov chains
• Trace formulae of characteristic polynomial and Cayley-Hamilton's theorem, and applications to chiral perturbation theory and general relativity

Cited in

(3)

• Algebraic combinatorics on trace monoids: extending number theory to walks on graphs
• The language of self-avoiding walks
• A Hopf algebra for counting cycles

This page was built for publication: Relations between connected and self-avoiding hikes in labelled complete digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q343737)