Related papers: Probabilistic Parking Functions
We introduce and study a unified Bayesian framework for extended feature allocations which flexibly captures interactions -- such as repulsion or attraction -- among features and their associated weights. We provide a complete Bayesian…
We present a queuing model of parking dynamics and a model-based prediction method to provide real-time probabilistic forecasts of future parking occupancy. The queuing model has a non-homogeneous arrival rate and time-varying service time…
We investigate the convexity problem for the Parisi functional defined on the space of the so-called functional ordered parameters in the Sherrington-Kirkpatrick model. In the recent work of Panchenko [3], he proved that this functional is…
The cluster complex on one hand, parking functions on the other hand, are two combinatorial (po)sets that can be associated to a finite real reflection group. Cluster parking functions are obtained by taking an appropriate fiber product…
Current navigation systems conflate time-to-drive with the true time-to-arrive by ignoring parking search duration and the final walking leg. Such underestimation can significantly affect user experience, mode choice, congestion, and…
We consider Poissonian pair correlations (PPC) for uniformly distributed sequences of random numbers with a dependency structure. More specifically, we treat two classes of dependent random variables which have widely been studied in the…
Challenging research in various fields has driven a wide range of methodological advances in variable selection for regression models with high-dimensional predictors. In comparison, selection of nonlinear functions in models with additive…
Parking functions of length $n$ are well known to be in correspondence with both labelled trees on $n+1$ vertices and factorizations of the full cycle $\sigma_n=(0\,1\,\cdots\,n)$ into $n$ transpositions. In fact, these correspondences can…
The main objective of this paper is to look from the unique point of view at some phenomena arising in different areas of probability theory and mathematical statistics. We will try to understand what is common between classical…
We extend the notion of parking functions to parking sequences, which include cars of different sizes, and prove a product formula for the number of such sequences.
This work investigates the duality between two discrete dynamical processes: parking functions, and the Abelian sandpile model (ASM). Specifically, we are interested in the extension of classical parking functions, called $G$-parking…
We give a general framework for approximations to combinatorial assemblies, especially suitable to the situation where the number $k$ of components is specified, in addition to the overall size $n$. This involves a Poisson process, which,…
We investigate a generalisation of the coherent choice functions considered by Seidenfeld et al. (2010), by sticking to the convexity axiom but imposing no Archimedeanity condition. We define our choice functions on vector spaces of…
We test the umbral methods introduced by Rota and Taylor within the theory of representation of symmetric group. We define a simple bijection between the set of all parking functions of length $n$ and the set of all noncrossing partitions…
A permutation of length $n$ is called a flattened partition if the leading terms of maximal chains of ascents (called runs) are in increasing order. We analogously define flattened parking functions: a subset of parking functions for which…
Word2vec (Mikolov et al., 2013) has proven to be successful in natural language processing by capturing the semantic relationships between different words. Built on top of single-word embeddings, paragraph vectors (Le and Mikolov, 2014)…
In the paper I study properties of random polynomials with respect to a general system of functions. Some lower bounds for the mathematical expectation of the uniform and recently introduced integral-uniform norms of random polynomials are…
We present a unified framework to study threshold functions for the existence of solutions to linear systems of equations in random sets which includes arithmetic progressions, sum-free sets, $B_{h}[g]$-sets and Hilbert cubes. In…
In the Page parking (or packing) model on a discrete interval (also known as the discrete R{\'e}nyi packing problem or the unfriendly seating problem), cars of length two successively park uniformly at random on pairs of adjacent places,…
An $(m, n)$-parking function can be characterized as function $f:[n] \to [m]$ such that the partition obtained by reordering the values of $f$ fits inside a right triangle with legs of length $m$ and $n$. Recent work by McCammond, Thomas,…