Related papers: Knot Probability for Self-Avoiding Loops on a Cubi…
We propose a novel combinatorial algorithm for efficient generation of Hamiltonian walks and cycles on a cubic lattice, modeling the conformations of lattice toy proteins. Through extensive tests on small lattices (allowing complete…
We study a number of combinatorial and algebraic structures arising from walks on the two-dimensional integer lattice. To a given step set $X\subseteq\mathbb Z^2$, there are two naturally associated monoids: $\mathscr F_X$, the monoid of…
Monte Carlo dynamics of the lattice 48 monomers toy protein is interpreted as a random walk in an abstract (discrete) space of conformations. To test the geometry of this space, we examine the return probability $P(T)$, which is the…
Scattering of matter waves through slits has been explored using the Feynman Path Integral formalism. We explicitly plot the near-zero probability densities to analyse the behaviour near the slit. Upon doing so, intriguing patterns emerge,…
We study the localisation of lattice polymer models near a permeable interface in two dimensions. Localisation can arise due to an interaction between the polymer and the interface, and can be altered by a preference for the bulk solvent on…
We model the typical behavior of knots and links using grid diagrams. Links are ubiquitous in the sciences, and their "normal" or "typical" behavior is of significant importance in understanding situations such as the topological state of…
A sampling method for spin systems is presented. The spin lattice is written as the union of a nested sequence of sublattices, all but the last with conditionally independent spins, which are sampled in succession using their marginals. The…
We analyse a biased random walk on a 1D lattice with unequal step lengths. Such a walk was recently shown to undergo a phase transition from a state containing a single connected cluster of visited sites to one with several clusters of…
The weights of a neural network are typically initialized at random, and one can think of the functions produced by such a network as having been generated by a prior over some function space. Studying random networks, then, is useful for a…
We establish up-to-constants estimates for arm events in the Brownian loop soup on the 2D metric graph associated with the square lattice. More specifically, we consider two natural geometric events: first, ``bulk'' four-arm events,…
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…
In this article, we consider the number of collisions of three independent simple random walks on a subgraph of the two-dimensional square lattice obtained by removing all horizontal edges with vertical coordinate not equal to 0 and then,…
We present computer simulations of a dynamic Monte Carlo algorithm for polymer chains on the FCC lattice which takes explicitly into account the possibility to overcome topological constraints by controlling the rate at which nearby polymer…
Generalizing unknotting number, $n$-adjacent knots have $n$ crossings such that changing any non-empty subset of them results in the unknot. In this paper, we determine the 2-adjacent knots through 12 crossings. Using Heegaard Floer…
In this paper we show how to realize all knot (and link) types as C^{2} smooth curves of constant curvature. Our proof is constructive: we build the knots with copies of a fixed finite number of "building blocks" that are particular…
Spin-orbit coupling in solids is typically a single-body effect arising from relativity. In this work, we propose a spontaneous generation of spin-orbit coupling from symmetry breaking. A spin-dependent electron-phonon coupling model is…
Using canonical Monte Carlo simulations, we introduce a new numerical procedure for comparing the entropic exponents of polymers with different constraints and/or topologies. Setting up competitions between polymer segments which can…
We study the motion of a particle on the two-dimensional honeycomb lattice, whose sites are occupied by either flipping rotators or flipping mirrors, which scatter the particle according to a deterministic rule. For both types of scatterers…
Three-dimensional three-colour percolation on a lattice made of tetrahedra is a direct generalization of two-dimensional two-colour percolation on the triangular lattice. The interfaces between one-colour clusters are made of bicolour…
A contact map is a simple representation of the structure of proteins and other chain-like macromolecules. This representation is quite amenable to numerical studies of folding. We show that the number of contact maps corresponding to the…