Answers are grounded in this paper and cite their sources.
We show that the chronological removal of cycles from a walk on a graph, known as Lawler's loop-erasing procedure, generates a preLie co-algebra on the vector space spanned by the walks. In addition, we prove that the tensor and symmetric algebras of graph walks are Hopf algebras, provide their antipodes explicitly and recover the preLie co-algebra from a brace coalgebra on the tensor algebra of graph walks. Finally we exhibit sub-Hopf algebras associated to particular types of walks.
No takes yet. Share an insight, caveat, or question.
Foissy et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: