Related papers: Renyi's Parking Problem Revisited
We consider $N$ circles of equal radii, $r$, having their centers randomly placed within a square domain $\mathcal{D}$ of size $L \times L$ with periodic boundary conditions ($\mathcal{D} \in \mathbb{R}^2$). When two or more circles…
Automated parking is a self-driving feature that has been in cars for several years. Parking assistants in currently sold cars fail to park in more complex real-world scenarios and require the driver to move the car to an expected starting…
This paper starts by considering the minimization of the Renyi divergence subject to a constraint on the total variation distance. Based on the solution of this optimization problem, the exact locus of the points $\bigl( D(Q\|P_1),…
An improvement in technology is linearly related to time and time-relevant problems. It has been seen that as time progresses, the number of problems humans face also increases. However, technology to resolve these problems tends to improve…
Convergence is proved for solutions of Dirichlet problems in regions with many small excluded sets (holes), as the holes become smaller and more numerous. The problem is formulated in the context of Markov processes associated with general…
A task is randomly drawn from a finite set of tasks and is described using a fixed number of bits. All the tasks that share its description must be performed. Upper and lower bounds on the minimum $\rho$-th moment of the number of performed…
While real-time parking slot detection plays a critical role in valet parking systems, existing methods have limited success in real-world applications. We argue two reasons accounting for the unsatisfactory performance: \romannumeral1, The…
The paper presents a novel learning-based sampling strategy that guarantees rejection-free sampling of the free space under both biased and approximately uniform conditions, leveraging multivariate kernel densities. Historical data from a…
A recent letter titled "Explicit Analytical Solution for Random Close Packing in d=2 and d=3" published in Physical Review Letters proposes a first-principle computation of the random close packing (RCP) density in spatial dimensions d=2…
Suppose we observe a trajectory of length $n$ from an exponentially $\alpha$-mixing stochastic process over a finite but potentially large state space. We consider the problem of estimating the probability mass placed by the stationary…
Effective and reliable data retrieval is critical for the feasibility of DNA storage, and the development of random access efficiency plays a key role in its practicality and reliability. In this paper, we study the Random Access Problem,…
We study the Darcy boundary value problem with log-normal permeability field. We adopt a perturbation approach, expanding the solution in Taylor series around the nominal value of the coefficient, and approximating the expected value of the…
We study the intersection of a random geometric graph with an Erd\H{o}s-R\'enyi graph. Specifically, we generate the random geometric graph $G(n, r)$ by choosing $n$ points uniformly at random from $D=[0, 1]^2$ and joining any two points…
We investigate the large-time asymptotics of nonlinear diffusion equations $u_t = \Delta u^p$ in dimension $n \ge 1$, in the exponent interval $p > n/(n+2)$, when the initial datum $u_0$ is of bounded second moment. Precise rates of…
We consider the allocation problem in which $m \leq (1-\epsilon) dn $ items are to be allocated to $n$ bins with capacity $d$. The items $x_1,x_2,\ldots,x_m$ arrive sequentially and when item $x_i$ arrives it is given two possible bin…
Relaxation of the packing of elongated particles (discorectangles) aligned on a line was studied numerically. The aspect ratio (length-to-width ratio) for the discorectangles was varied within the range $\varepsilon \in [1;50]$. The initial…
Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…
The sandwiched R\'enyi $\alpha$-divergences of two finite-dimensional quantum states play a distinguished role among the many quantum versions of R\'enyi divergences as the tight quantifiers of the trade-off between the two error…
Randomized rounding is a standard method, based on the probabilistic method, for designing combinatorial approximation algorithms. In Raghavan's seminal paper introducing the method (1988), he writes: "The time taken to solve the linear…
We recall that a parking function of length $n+1$ is said to be prime if removing any instance of 1 yields a parking function of length $n$. In this article, we study prime parking functions from multiple lenses. We derive an explicit…