Nodal intersections for random waves against a segment on the 3-dimensional torus
نویسندگان
چکیده
منابع مشابه
Hunting a Random Walker on a Low Dimensional Torus
We will define a problem regarding locating a simple random walk on a graph, and give bounds for the optimal solution on toruses of dimension 2,3. 1 Hunting a Random Walker There are several natural variants of the hunting problem, here is one. A bird performs a random walk on a graph. At each step a hunter picks a vertex and either catches the bird or gets to see if the bird visited there befo...
متن کاملLiving on a Random Torus
We don’t see doughnut shapes when we look up in the sky. But what if the Earth we live on were shaped like a torus instead of a sphere? This remote, but otherwise intriguing possibility, lead me to explore the formation of islands and pools in a toroidal world. In this exposition, I start with a programming perspective on counting islands and pools, and finish by presenting a probabilistic anal...
متن کاملOn the Geometry of the Nodal Lines of Eigenfunctions of the Two-Dimensional Torus
The width of a convex curve in the plane is the minimal distance between a pair of parallel supporting lines of the curve. In this paper we study the width of nodal lines of eigenfunctions of the Laplacian on the standard flat torus. We prove a variety of results on the width, some having stronger versions assuming a conjecture of Cilleruelo and Granville asserting a uniform bound for the numbe...
متن کاملRandom Polytopes on the Torus
The expected volume of the convex hull of n random points chosen independently and uniformly on the d-dimensional torus is determined. In the 1860's J. J. Sylvester raised the problem of determining the expected area V$(C) of the convex hull of three points chosen independently and uniformly at random from a given plane convex body C of area one. For some special plane convex bodies the problem...
متن کاملThe Random Connection Model on the Torus
We study the diameter of a family of random graphs on the torus that can be used to model wireless networks. In the random connection model two points x and y are connected with probability g(y − x) where g is a given function. We prove that the diameter of the graph is bounded by a constant, that only depends on ‖g‖1, with high probability as the number of vertices in the graph tends to infinity.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Analysis
سال: 2017
ISSN: 0022-1236
DOI: 10.1016/j.jfa.2017.02.011