{"title":"约束随机游走的几何及其在框架理论中的应用","authors":"C. Shonkwiler","doi":"10.1109/SSP.2018.8450816","DOIUrl":null,"url":null,"abstract":"Random walks in ${{\\mathbb{R}}^3}$ are classical objects in geometric probability which have, over the last 70 years, been rather successfully used as models of polymers in solution. Modifying the theory to apply to topologically nontrivial polymers, such as ring polymers, has proven challenging, but several recent breakthroughs have been made by thinking of random walks as points in some nice conformation space and then exploiting the geometry of the space. Using tools from symplectic geometry, this approach yields a fast algorithm for sampling loop random walks. Such walks can be lifted via the Hopf map to finite unit norm tight frames (FUNTFs) in ${{\\mathbb{C}}^2}$, producing an algorithm for randomly sampling FUNTFs in ${{\\mathbb{C}}^2}$ as well as a mechanism for searching for FUNTFs with nice properties. In general, symplectic geometry seems like a promising tool for understanding the space of FUNTFs in ${{\\mathbb{C}}^d}$ for any d.","PeriodicalId":330528,"journal":{"name":"2018 IEEE Statistical Signal Processing Workshop (SSP)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"The Geometry of Constrained Randomwalks and an Application to Frame Theory\",\"authors\":\"C. Shonkwiler\",\"doi\":\"10.1109/SSP.2018.8450816\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Random walks in ${{\\\\mathbb{R}}^3}$ are classical objects in geometric probability which have, over the last 70 years, been rather successfully used as models of polymers in solution. Modifying the theory to apply to topologically nontrivial polymers, such as ring polymers, has proven challenging, but several recent breakthroughs have been made by thinking of random walks as points in some nice conformation space and then exploiting the geometry of the space. Using tools from symplectic geometry, this approach yields a fast algorithm for sampling loop random walks. Such walks can be lifted via the Hopf map to finite unit norm tight frames (FUNTFs) in ${{\\\\mathbb{C}}^2}$, producing an algorithm for randomly sampling FUNTFs in ${{\\\\mathbb{C}}^2}$ as well as a mechanism for searching for FUNTFs with nice properties. In general, symplectic geometry seems like a promising tool for understanding the space of FUNTFs in ${{\\\\mathbb{C}}^d}$ for any d.\",\"PeriodicalId\":330528,\"journal\":{\"name\":\"2018 IEEE Statistical Signal Processing Workshop (SSP)\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE Statistical Signal Processing Workshop (SSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SSP.2018.8450816\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Statistical Signal Processing Workshop (SSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSP.2018.8450816","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Geometry of Constrained Randomwalks and an Application to Frame Theory
Random walks in ${{\mathbb{R}}^3}$ are classical objects in geometric probability which have, over the last 70 years, been rather successfully used as models of polymers in solution. Modifying the theory to apply to topologically nontrivial polymers, such as ring polymers, has proven challenging, but several recent breakthroughs have been made by thinking of random walks as points in some nice conformation space and then exploiting the geometry of the space. Using tools from symplectic geometry, this approach yields a fast algorithm for sampling loop random walks. Such walks can be lifted via the Hopf map to finite unit norm tight frames (FUNTFs) in ${{\mathbb{C}}^2}$, producing an algorithm for randomly sampling FUNTFs in ${{\mathbb{C}}^2}$ as well as a mechanism for searching for FUNTFs with nice properties. In general, symplectic geometry seems like a promising tool for understanding the space of FUNTFs in ${{\mathbb{C}}^d}$ for any d.