Related papers: Self-avoiding walks and connective constants
In this paper, we construct a family of quasi-strongly regular Cayley graphs $\Gamma_H(G)$ which is defined on a finite group $G$ with respect to a subgroup $H$ of $G$. We also compute its full automorphism group and characterize various…
This article is concerned with self-avoiding walks (SAW) on $\mathbb{Z}^{d}$ that are subject to a self-attraction. The attraction, which rewards instances of adjacent parallel edges, introduces difficulties that are not present in ordinary…
Quantum walks exhibit properties without classical analogues. One of those is the phenomenon of asymptotic trapping -- there can be non-zero probability of the quantum walker being localised in a finite part of the underlying graph…
Let $\Gamma$ be a finite group acting transitively on $[n]=\{1,2,\ldots,n\}$, and let $G=\mathrm{Cay}(\Gamma,T)$ be a Cayley graph of $\Gamma$. The graph $G$ is called normal if $T$ is closed under conjugation. In this paper, we obtain an…
It is shown explicitly how self-similar graphs can be obtained as `blow-up' constructions of finite cell graphs $\hat C$. This yields a larger family of graphs than the graphs obtained by discretising continuous self-similar fractals. For a…
Given a finite, simple, connected graph $G=(V,E)$ with $|V|=n$, we consider the associated graph Laplacian matrix $L = D - A$ with eigenvalues $0 = \lambda_1 < \lambda_2 \leq \dots \leq \lambda_n$. One can also consider the same graph…
Given a graph $G=(V,E)$, consider Poisson($ |V|$) walkers performing independent lazy simple random walks on $G$ simultaneously, where the initial position of each walker is chosen independently with probability proportional to the degrees.…
In this paper we isolate the combinatorial property responsible (at least in part) for the computational speedups recently observed in some quantum walk algorithms. We find that continuous-time quantum walks can exploit the covering space…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
One approach to study the pseudorandomness properties of walks on expander graphs is to label the vertices of an expander with elements from an alphabet $\Sigma$, and study the mean of functions over $\Sigma^n$. We say expander walks…
We study self-avoiding walks on restricted square lattices, more precisely on the lattice strips $\mathbb{Z} \times \{-1,0,1\}$ and $\mathbb{Z}\times \{-1,0,1,2\}$. We obtain the value of the connective constant for the $\mathbb{Z} \times…
A weighted graph $G$ with countable vertex set is bounded if there is an upper bound on the maximum of the sum of absolute values of all edge weights incident to a vertex in $G$. In this paper, we prove a fundamental result on equitable…
Let $G_S$ be a graph with loops attached at each vertex in $S \subseteq V(G).$ In this article, we develop exact formulae for the number of closed $3$- and $4$-walks on $G_S$ in terms of vertex degrees and certain elementary subgraphs of…
Let $G$ be a permutation group on a set $\Omega$. A subset of $\Omega$ is a base for $G$ if its pointwise stabiliser in $G$ is trivial. In this paper we introduce and study an associated graph $\Sigma(G)$, which we call the Saxl graph of…
Kemeny's constant measures how fast a random walker moves around in a graph. Expressions for Kemeny's constant can be quite involved, and for this reason, many lines of research focus on graphs with structure that makes them amenable to…
We show that if H is a quasiconvex subgroup of a hyperbolic group G then the relative Cayley graph Y (also known as the Schreier coset graph) for G/H is Gromov-hyperbolic. We also observe that in this situation if G is torsion-free and…
A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. If this unitary evolution operator has an associated group of symmetries, then for certain…
Building on a work by Alm, we consider a model of weighted self-avoiding walks on a lattice and develop a method for computing upper bounds on the corresponding weighted connective constant, which we implement in a publicly available…
We consider a vectorial, confining SU(N) gauge theory with a variable number, $N_f$, of massless fermions transforming according to the fundamental representation. Using the Schwinger-Dyson and Bethe-Salpeter equations, we calculate the $S$…
Bounds are proved for the connective constant \mu\ of an infinite, connected, \Delta-regular graph G. The main result is that \mu\ \ge \sqrt{\Delta-1} if G is vertex-transitive and simple. This inequality is proved subject to weaker…