Hunter, Cauchy rabbit, and optimal Kakeya sets

DOI10.1090/S0002-9947-2014-06226-0zbMath1305.91042arXiv1207.6389MaRDI QIDQ3190811

Ron Peretz, Yuval Peres, Perla Sousi, Peter M. Winkler, Yakov Babichenko

Publication date: 19 September 2014

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.6389

zbMATH Keywords

Cauchy processKakeya setspursuit gamesgraph games

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Games involving graphs (91A43) Pursuit and evasion games (49N75) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (4)

Cop vs. gambler ⋮ A property of random walks on a cycle graph ⋮ Almost all non-archimedean Kakeya sets have measure zero ⋮ Optimal discrete search with technological choice

Cites Work

• Besicovitch type maximal operators and applications to Fourier analysis
• On L ^p Bounds for Kakeya Maximal Functions and the Minkowski Dimension in R²
• Randomized Pursuit-Evasion in Graphs
• The Kakeya Problem
• Brownian Motion
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hunter, Cauchy rabbit, and optimal Kakeya sets