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

DOI10.1007/S00373-016-1696-9zbMATH Open1349.05152OpenAlexW2315744018MaRDI QIDQ343737FDOQ343737

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

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

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)

Cites Work

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

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)