书呆子狙击手问题

Boris Alexeev, Dustin Mixon
{"title":"书呆子狙击手问题","authors":"Boris Alexeev, Dustin Mixon","doi":"arxiv-2409.06068","DOIUrl":null,"url":null,"abstract":"We correct errors that appear throughout \"The vicious neighbour problem\" by\nTao and Wu. We seek to solve the following problem. Suppose Nnerds are distributed\nuniformly at random in a square region. At 3:14pm, every nerd simultaneously\nsnipes their nearest neighbor. What is the expected proportion $P_N$ of nerds\nwho are left unscathed in the limit as $N\\to\\infty$?","PeriodicalId":501245,"journal":{"name":"arXiv - MATH - Probability","volume":"264 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The nerd snipers problem\",\"authors\":\"Boris Alexeev, Dustin Mixon\",\"doi\":\"arxiv-2409.06068\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We correct errors that appear throughout \\\"The vicious neighbour problem\\\" by\\nTao and Wu. We seek to solve the following problem. Suppose Nnerds are distributed\\nuniformly at random in a square region. At 3:14pm, every nerd simultaneously\\nsnipes their nearest neighbor. What is the expected proportion $P_N$ of nerds\\nwho are left unscathed in the limit as $N\\\\to\\\\infty$?\",\"PeriodicalId\":501245,\"journal\":{\"name\":\"arXiv - MATH - Probability\",\"volume\":\"264 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - MATH - Probability\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.06068\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Probability","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.06068","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

我们纠正了陶和吴在《恶性相邻问题》一文中出现的错误。我们试图解决以下问题。假设 N 个书呆子均匀地随机分布在一个正方形区域中。下午 3 点 14 分,每个书呆子都同时 "攻击 "了他们最近的邻居。在$N\to\infty$的极限中,毫发无损的书呆子的预期比例$P_N$是多少?
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
The nerd snipers problem
We correct errors that appear throughout "The vicious neighbour problem" by Tao and Wu. We seek to solve the following problem. Suppose Nnerds are distributed uniformly at random in a square region. At 3:14pm, every nerd simultaneously snipes their nearest neighbor. What is the expected proportion $P_N$ of nerds who are left unscathed in the limit as $N\to\infty$?
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Total disconnectedness and percolation for the supports of super-tree random measures The largest fragment in self-similar fragmentation processes of positive index Local limit of the random degree constrained process The Moran process on a random graph Abelian and stochastic sandpile models on complete bipartite graphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1