Related papers: Self-avoiding walks and the Fisher transformation

We study groups acting vertex-transitively on connected, trivalent graphs such that stabilizers of vertices are infinite. If the action is edge-transitive, we prove that the graph has to be a tree. We analyze the case where the action is…

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…

The growth constant for two-dimensional self-avoiding walks on the honeycomb lattice was conjectured by Nienhuis in 1982, and since that time the corresponding results for the square and triangular lattices have been sought. For the square…

Quantum walks are powerful kernels in quantum computing protocols that possess strong capabilities in speeding up various simulation and optimisation tasks. One striking example is given by quantum walkers evolving on glued trees for their…

We present a new general theory of function-based hypergraph transformations on finite families of finite hypergraphs. A function-based hypergraph transformation formalises the action of structurally modifying hypergraphs from a family in a…

Given any two forests with the same degree sequence, we show in an algorithmic way that one can be transformed into the other by a sequence of 2-switches in such a way that all the intermediate graphs of the transformation are forests. We…

We make and generalize the observation that summing of probability amplitudes of a discrete-time quantum walk over partitions of the walking graph consistent with the step operator results in a unitary evolution on the reduced graph which…

The adjacency matrix of a graph G is the Hamiltonian for a continuous-time quantum walk on the vertices of G. Although the entries of the adjacency matrix are integers, its eigenvalues are generally irrational and, because of this, the…

A stochastic differential game theoretic model has been proposed to determine optimal behavior of a fish while migrating against water currents both in rivers and oceans. Then, a dynamic objective function is maximized subject to two…

Quantum walks, both discrete and continuous, serve as fundamental tools in quantum information processing with diverse applications. This work introduces a hybrid quantum walk model that integrates the coin mechanism of discrete walks with…

The relevance of the concept of Fisher information is increasing in both statistical physics and quantum computing. From a statistical mechanical standpoint, the application of Fisher information in the kinetic theory of gases is…

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…

The connective constant $\mu(G)$ of an infinite transitive graph $G$ is the exponential growth rate of the number of self-avoiding walks from a given origin. In earlier work of Grimmett and Li, a locality theorem was proved for connective…

Feynman diagrams in $\phi^4$ theory have as their underlying structure 4-regular graphs. In particular, any 4-point $\phi^4$ graph can be uniquely derived from a 4-regular graph by deleting a vertex. The Feynman period is a simplified…

Choosing the Fisher information as the metric tensor for a Riemannian manifold provides a powerful yet fundamental way to understand statistical distribution families. Distances along this manifold become a compelling measure of statistical…

We propose a twisted Szegedy walk for estimating the limit behavior of a discrete-time quantum walk on a crystal lattice, an infinite abelian covering graph, whose notion was introduced by [14]. First, we show that the spectrum of the…

A $k$-weak bisection of a cubic graph $G$ is a partition of the vertex-set of $G$ into two parts $V_1$ and $V_2$ of equal size, such that each connected component of the subgraph of $G$ induced by $V_i$ ($i=1,2$) is a tree of at most $k-2$…

Dynamical quantum phase transitions are non-analyticities in a dynamical free energy (or return rate) which occur at critical times. Although extensively studied in one dimension, the exact nature of the non-analyticity in two and three…

Quantum walks exhibit many unique characteristics compared to classical random walks. In the classical setting, self-avoiding random walks have been studied as a variation on the usual classical random walk. Classical self-avoiding random…

We consider a specific random graph which serves as a disordered medium for a particle performing biased random walk. Take a two-sided infinite horizontal ladder and pick a random spanning tree with a certain edge weight $c$ for the…