Related papers: Probabilistic Parking Functions
The displacement of a car with respect to a parking function is the number of spots it must drive past its preferred spot in order to park. An $\ell$-interval parking function is one in which each car has displacement at most $\ell$. Among…
We introduce Lehmer parking functions and study their set of parking outcomes. Our main results establish that the number of outcomes of Lehmer parking functions of length $n$ is given by a Bell number, which is exactly the number of set…
Referring to a standard context of voting theory, and to the classic notion of voting situation, here we show that it is possible to observe any arbitrary set of elections' outcomes, no matter how paradoxical it may appear. On this purpose…
Parking functions are tuples that describe the parking of $M$ cars on a street with $M$ parking spots. In this paper, we define exact $k$-typed parking functions ($k$-TPFs) to be a variant of classical parking functions. We then establish…
For a connected graph $G$ with sink vertex $q$, a $G$-parking function is a vector of nonnegative integers whose entries are determined by cut-sets in $G$. Such objects also arise as the superstable configurations in the context of…
We introduce several associative algebras and series of vector spaces associated to these algebras. Using lattice vertex operators, we obtain dimension and character formulae for these spaces. In particular, we a series of representations…
In this paper we study the asymptotic behavior of a random uniform parking function $\pi_n$ of size $n$. We show that the first $k_n$ places $\pi_n(1),\dots,\pi_n(k_n)$ of $\pi_n$ are asymptotically i.i.d. and uniform on $\{1,2,\dots,n\}$,…
In this paper we consider polynomial representability of functions defined over $Z_{p^n}$, where $p$ is a prime and $n$ is a positive integer. Our aim is to provide an algorithmic characterization that (i) answers the decision problem: to…
The conceptions of $G$-parking functions and $G$-multiparking functions were introduced in [15] and [12] respectively. In this paper, let $G$ be a connected graph with vertex set $\{1,2,...,n\}$ and $m\in V(G)$. We give the definition of…
We recall that the $k$-Naples parking functions of length $n$ (a generalization of parking functions) are defined by requiring that a car which finds its preferred spot occupied must first back up a spot at a time (up to $k$ spots) before…
This paper describes the automation of a new text categorization task. The categories assigned in this task are more syntactically, semantically, and contextually complex than those typically assigned by fully automatic systems that process…
We study the parking process on the random recursive tree. We first prove that although the random recursive tree has a non-degenerate Benjamini--Schramm limit, the phase transition for the parking process appears at density $0$. We then…
We present a new perspective of assessing the rates of convergence to the Gaussian and Poisson distributions in the Erd\"os-Kac theorem for additive arithmetic functions $\psi$ of a random integer $J_n$ uniformly distributed over…
For certain types of statistical models, the characteristic function (Fourier transform) is available in closed form, whereas the probability density function has an intractable form, typically as an infinite sum of probability weighted…
In previous work cite{Ha98:Towards} we presented a case-based approach to eliciting and reasoning with preferences. A key issue in this approach is the definition of similarity between user preferences. We introduced the probabilistic…
Motivated by the minimax concave penalty based variable selection in high-dimensional linear regression, we introduce a simple scheme to construct structured semiconvex sparsity promoting functions from convex sparsity promoting functions…
Autonomous Valet Parking (AVP) requires planning under partial observability, where parking spot availability evolves as dynamic agents enter and exit spots. Existing approaches either rely only on instantaneous spot availability or make…
The parking-lot model provides a qualitative description of the main features of the phenomenology of granular compaction. We derive here approximate kinetic equations for this model, equations that are based on a $2-$parameter…
We study a generalization of conditional probability for arbitrary ordered vector spaces. A related problem is that of assigning a numerical value to one vector relative to another. We characterize the groups for which these generalized…
Place a car independently with probability $p$ at each site of a graph. Each initially vacant site is a parking spot that can fit one car. Cars simultaneously perform independent random walks. When a car encounters an available parking spot…