Related papers: Probabilistic $(m,n)$-Parking Functions
Consider an infinite tree with random degrees, i.i.d. over the sites, with a prescribed probability distribution with generating function G(s). We consider the following variation of Renyi's parking problem, alternatively called blocking…
Naples parking functions were introduced as a generalization of classical parking functions, in which cars are allowed to park backwards, by checking up to a fixed number of previous slots, before proceedings forward as usual. In our…
We derive a new asymptotic expansion for the global excess risk of a local-$k$-nearest neighbour classifier, where the choice of $k$ may depend upon the test point. This expansion elucidates conditions under which the dominant contribution…
We present an algorithm to simulate random sequential adsorption (random "parking") of discs on constant-curvature surfaces: the plane, sphere, hyperboloid, and projective plane, all embedded in three-dimensional space. We simulate complete…
Vehicle-sharing systems are becoming important for urban transportation. In these systems, users arrive at a station, pick up a vehicle, use it for a while and then return it to another station of their choice. Depending on the type of…
In this paper we analyze the spatial distribution of elements around points of interest. Based on a spatial exclusion principle we model the system by means of a Fermi-Dirac distribution defined by two easily interpretable parameters. By…
We investigate questions related to the notion of traffics introduced by the author C. Male as a noncommutative probability space with numerous additional operations and equipped with the notion of traffic independence. We prove that any…
Inter-patient abdominal registration has various applications, from pharmakinematic studies to anatomy modeling. Yet, it remains a challenging application due to the morphological heterogeneity and variability of the human abdomen. Among…
Parking is a necessary component of traditional last-mile delivery practices, but finding parking can be difficult. Yet, the routing literature largely does not account for the need to find parking. In this paper, we address this challenge…
We prove a new hypothesis on the conditional distribution of the sample mean of the fluctuations of an i.i.d. random potential in the Anderson model. The paper extends to uniform probability distribution some earlier work with Gaussian…
Smart cities around the world have begun monitoring parking areas in order to estimate available parking spots and help drivers looking for parking. The current results are promising, indeed. However, existing approaches are limited by the…
In this paper, we consider approximating expansions for the distribution of integer valued random variables, in circumstances in which convergence in law cannot be expected. The setting is one in which the simplest approximation to the…
The prediction of surrounding traffic participants behavior is a crucial and challenging task for driver assistance and autonomous driving systems. Today's approaches mainly focus on modeling dynamic aspects of the traffic situation and try…
As urban populations continue to grow, cities face numerous challenges in managing parking and determining occupancy. This issue is particularly pronounced in university campuses, where students need to find vacant parking spots quickly and…
Estimating probability distributions which describe where an object is likely to be from camera data is a task with many applications. In this work we describe properties which we argue such methods should conform to. We also design a…
The parking issue is central in transport policies and drivers' concerns, but the determinants of the parking search time remain relatively poorly understood. The question is often handled in a fairly ad hoc way, or by resorting to crude…
Recent studies have revealed a number of striking dependence patterns in high frequency stock price dynamics characterizing probabilistic interrelation between two consequent price increments x (push) and y (response) as described by the…
We consider two variations of the discrete car parking problem where at every vertex of the integers a car arrives with rate one, now allowing for parking in two lines. a) The car parks in the first line whenever the vertex and all of its…
We determine the joint limiting distribution of adjacent spacings around a central, intermediate, or an extreme order statistic $X_{k:n}$ of a random sample of size $n$ from a continuous distribution $F$. For central and intermediate cases,…
Parking functions, classically defined in terms of cars with preferred parking spots on a directed path attempting to park there, arise in many combinatorial situations and have seen various generalizations. In particular, parking functions…