Self-avoiding walks on cubic graphs and local transformations
Benjamin Grant, Zhongyang Li

TL;DR
This paper develops a general substitution principle for self-avoiding walks on cubic graphs, allowing the exact calculation of connective constants for new graphs via algebraic equations, extending known relations.
Contribution
It introduces a universal method to relate SAWs on original and transformed graphs through vertex replacements, generalizing the Fisher-triangle relation to arbitrary symmetric three-port gadgets.
Findings
Established a formula linking connective constants before and after vertex replacement.
Extended the Fisher-triangle relation to a broader class of graphs and gadgets.
Derived explicit algebraic equations for connective constants of transformed graphs.
Abstract
Despite its elementary definition, the self-avoiding walk (SAW) poses notoriously hard enumerative problems: exact connective constants are known for only a handful of infinite graphs, notably the honeycomb lattice \cite{ds}. We establish a general substitution principle for SAWs on infinite connected quasi-transitive cubic graphs under port-transitive vertex replacements, where each degree- vertex is replaced by a fixed finite three-port gadget. Writing for the associated two-port SAW series, we prove that for , \[ \mu(G)^{-1}=g\bigl(\mu(G_1)^{-1}\bigr), \] equivalently is the unique solution of , thereby extending the Fisher-triangle relation of Grimmett--Li to arbitrary symmetric three-port gadgets. We also obtain the corresponding identity for bipartite graphs when one or both colour classes are transformed, and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Mathematical Dynamics and Fractals · Stochastic processes and statistical mechanics
