Related papers: Expected n-Step Product for Gaussian Tours
We consider saddle point integrals in d variables whose phase function is neither real nor purely imaginary. Results analogous to those for Laplace (real phase) and Fourier (imaginary phase) integrals hold whenever the phase function is…
Let $\mu_1,... \mu_k$ be $d$-dimensional probability measures in $\R^d$ with mean 0. At each step we choose one of the measures based on the history of the process and take a step according to that measure. We give conditions for transience…
The $k$-Opt heuristic is a simple improvement heuristic for the Traveling Salesman Problem. It starts with an arbitrary tour and then repeatedly replaces $k$ edges of the tour by $k$ other edges, as long as this yields a shorter tour. We…
We determine almost sure limits of rescaled intrinsic volumes of the construction steps of fractal percolation in $\mathbb{R}^d$ for any dimension $d\geq 1$. We observe a factorization of these limit variables which allows, in particular,…
We propose that the statistics of the optimal tour in the planar random Euclidean traveling salesman problem is conformally invariant on large scales. This is exhibited in power-law behavior of the probabilities for the tour to zigzag…
We consider the traveling salesman problem when the cities are points in R^d for some fixed d and distances are computed according to geometric distances, determined by some norm. We show that for any polyhedral norm, the problem of finding…
A 1d random geometric graph (1d RGG) is built by joining a random sample of $n$ points from an interval of the real line with probability $p$. We count the number of $k$-hop paths between two vertices of the graph in the case where the…
In this paper, we derive formulas for the analytical calculation of the moments of the distance between two uniformly and independently distributed random points in an $n$-sided regular polygon. A number of closed form expressions is…
In this report, the explicit probability density functions of the random Euclidean distances associated with regular hexagons are given, when the two endpoints of a link are randomly distributed in the same hexagon, and two adjacent…
A discrete rotation algorithm can be apprehended as a parametric application $f\_\alpha$ from $\ZZ[i]$ to $\ZZ[i]$, whose resulting permutation ``looks like'' the map induced by an Euclidean rotation. For this kind of algorithm, to be…
This paper develops asymptotic approximations of $P(\int_Te^{f(t)}\,dt>b)$ as $b\rightarrow\infty$ for a homogeneous smooth Gaussian random field, $f$, living on a compact $d$-dimensional Jordan measurable set $T$. The integral of an…
We prove a dimension distortion estimate for mappings of sub-exponentially integrable distortion in Euclidean spaces, which is essentially sharp in the plane.
We construct a N-dimensional Gaussian landscape with multiscale, translation invariant, logarithmic correlations and investigate the statistical mechanics of a single particle in this environment. In the limit of high dimension N>>1 the…
This paper concerns the asymptotic behavior of a random variable $W_\lambda$ resulting from the summation of the functionals of a Gibbsian spatial point process over windows $Q_\lambda \uparrow R^d$. We establish conditions ensuring that…
The random walk to be considered takes place in the d- spherical dual of the group U(n + 1), for a fixed finite dimensional irreducible representation d of U(n). The transition matrix comes from the three term recursion relation satisfied…
Consider $N$ points randomly distributed along a line segment of unitary length. A walker explores this disordered medium moving according to a partially self-avoiding deterministic walk. The walker, with memory $\mu$, leaves from the…
We consider Random Walk in Random Scenery, denoted $X_n$, where the random walk is symmetric on $Z^d$, with $d>4$, and the random field is made up of i.i.d random variables with a stretched exponential tail decay, with exponent $\alpha$…
Kusner asked if $n+1$ points is the maximum number of points in $\mathbb{R}^n$ such that the $\ell_p$ distance $(1<p<\infty)$ between any two points is $1$. We present an improvement to the best known upper bound when $p$ is large in terms…
The metric $D_\alpha (q,q')$ on the set $Q$ of particle locations of a homogeneous Poisson process on $R^d$, defined as the infimum of $(\sum_i |q_i - q_{i+1}|^\alpha)^{1/\alpha}$ over sequences in $Q$ starting with $q$ and ending with $q'$…
Motivated by a connection to the infinite Ginibre point process, decoupled random walks were introduced in a recent article Alsmeyer, Iksanov and Kabluchko (2025). The decoupled random walk is a sequence of independent random variables, in…