Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

The University of British Columbia

$27,000.00

Topology preserving sampling algorithms

EF 2024-25

Résumé
The core aim of my research program is to develop and apply new methods for simulating polymers of fixed topology. Polymers, such as polyethylene and DNA, are ubiquitous and the ways in which they interact with themselves and their environment are crucial to many physical and biological phenomena. A key property of any long chain polymer is that it can tangle. This is important in the case of DNA; knotting and linking can inhibit processes such as transcription. Hence the effect of topology on polymer properties is an important area of study. We will develop new simulation methods for key models of polymers. These, in turn, will allow us to investigate the influence of topology on the geometric and physical properties of long polymers. The self-avoiding-walk (SAW) and -polygon (SAP) were introduced as a model of linear polymers and is now a significant area of research in statistical mechanics, probability and combinatorics. While there are rigorous results in two- and high dimensions, much less is known in three-dimensions. In 3D, precisely where topology is most relevant, most results are obtained through simulations of ring-polymers and SAPs. Simulations of SAPs of fixed topology typically use the BFACF algorithm; it has been the go-to method for 40 years. It samples SAPs by making many small local changes to the conformation. Those changes preserve the knot-type, however, large numbers of moves are required to produce independent samples. This is manageable at modest system sizes, but large systems, and the corresponding asymptotic properties, remain out of reach. The main alternative is to sample without fixed topology using methods such the pivot algorithm; which changes conformations at all length-scales. Recent breakthroughs mean that the pivot algorithm can be used to study systems of millions of edges. Unfortunately, as soon as one asks topological questions, one has to separate samples using knot-invariants, such as the HOMFLY-PT polynomial. These invariants are slow to compute and, at the same time, conformations of any fixed topology become exponentially rare with length. These two problems combine to force us back to modest sizes. The core of this proposal is to combine ideas from these two approaches - BFACF and pivots - with ideas from computational geometry, to produce a fast topology preserving pivot algorithm. The fast topology preserving simulation methods developed by program will be of great use to the research community that sits at this interface between topology, physics and biology. We will ensure that a well documented implementation publicly available under an open source license. We will break the development of the algorithm into smaller projects. We have chosen the components to be manageable and reasonably self-contained, while still building towards the main goal. Many of these projects are suitable for students, however, there are components of the project that are best suited to a postdoctoral fellow.
Programme
Discovery Grants Program - Individual
Emplacement
British Columbia, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
RGPIN-2023-04166
Name nom
Rechnitzer, Andrew
Department département
Mathematics
Organization id
2
Institution établissement
The University of British Columbia
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2024
Competition year année de concours
2023
Award amount
27000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR LA DÉCOUVERTE
Committee code
1508
Committee name en
Mathematics and Statistics
Committee name fr
Mathématiques et statistique
Area of application code
1200
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Advancement of knowledge
Area of application fr
Avancement des connaissances
Research subject code
2914
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Combinatorics
Research subject fr
Combinatoire
Field of research list names en
Not available
Field of research list names fr
Non disponible
Socioeconomic objective list names en
Not available
Socioeconomic objective list names fr
Non disponible
Application title
Topology preserving sampling algorithms
Keywords
combinatorics; enumeration; statistical mechanics; knots and links
Application summary
The core aim of my research program is to develop and apply new methods for simulating polymers of fixed topology. Polymers, such as polyethylene and DNA, are ubiquitous and the ways in which they interact with themselves and their environment are crucial to many physical and biological phenomena. A key property of any long chain polymer is that it can tangle. This is important in the case of DNA; knotting and linking can inhibit processes such as transcription. Hence the effect of topology on polymer properties is an important area of study. We will develop new simulation methods for key models of polymers. These, in turn, will allow us to investigate the influence of topology on the geometric and physical properties of long polymers. The self-avoiding-walk (SAW) and -polygon (SAP) were introduced as a model of linear polymers and is now a significant area of research in statistical mechanics, probability and combinatorics. While there are rigorous results in two- and high dimensions, much less is known in three-dimensions. In 3D, precisely where topology is most relevant, most results are obtained through simulations of ring-polymers and SAPs. Simulations of SAPs of fixed topology typically use the BFACF algorithm; it has been the go-to method for 40 years. It samples SAPs by making many small local changes to the conformation. Those changes preserve the knot-type, however, large numbers of moves are required to produce independent samples. This is manageable at modest system sizes, but large systems, and the corresponding asymptotic properties, remain out of reach. The main alternative is to sample without fixed topology using methods such the pivot algorithm; which changes conformations at all length-scales. Recent breakthroughs mean that the pivot algorithm can be used to study systems of millions of edges. Unfortunately, as soon as one asks topological questions, one has to separate samples using knot-invariants, such as the HOMFLY-PT polynomial. These invariants are slow to compute and, at the same time, conformations of any fixed topology become exponentially rare with length. These two problems combine to force us back to modest sizes. The core of this proposal is to combine ideas from these two approaches - BFACF and pivots - with ideas from computational geometry, to produce a fast topology preserving pivot algorithm. The fast topology preserving simulation methods developed by program will be of great use to the research community that sits at this interface between topology, physics and biology. We will ensure that a well documented implementation publicly available under an open source license. We will break the development of the algorithm into smaller projects. We have chosen the components to be manageable and reasonably self-contained, while still building towards the main goal. Many of these projects are suitable for students, however, there are components of the project that are best suited to a postdoctoral fellow.