Related papers: Probabilistic Parking Functions

For $\mathbf{b}=(b_1,\dots,b_n)\in \mathbb{Z}_{>0}^n$, a $\mathbf{b}$-parking function is defined to be a sequence $(\beta_1,\dots,\beta_n)$ of positive integers whose nondecreasing rearrangement $\beta'_1\leq \beta'_2\leq \cdots \leq…

A defective $(m,n)$-parking function with defect $d$ is a parking function with $m$ cars attempting to park on a street with $n$ parking spots in which exactly $d$ cars fail to park. We establish a way to compute the defect of a defective…

In this paper, we address the problem of embedded feature selection for ranking on top of the list problems. We pose this problem as a regularized empirical risk minimization with $p$-norm push loss function ($p=\infty$) and sparsity…

We describe some recent approaches to likelihood based inference in the presence of nuisance parameters. Our approach is based on plotting the likelihood function and the $p$-value function, using recently developed third order…

In this paper, we study a bi-criterion framework for assessing scoring functions in the context of binary classification. The positive and negative predictive values (ppv and npv, respectively) are conditional probabilities of the true…

Let $\Delta$ be an integer $n \times n$-matrix which satisfies the conditions: $\det \Delta\neq 0$, $\Delta_{ij}\leq 0\text{ for }i\neq j,$ and there exists a vector ${\bf r}=(r_1,\ldots,r_n)>0$ such that ${\bf r}\Delta \geq 0$. Here the…

It is widely believed that complex machine learning models generally encode features through linear representations. This is the foundational hypothesis behind a vast body of work on interpretability. A key challenge toward extracting…

We obtain variants of the classical von Neumann-Morgenstern expected utility theorem, with and without the completeness axiom, in which the derived Bernoulli utility functions are Lipschitz. The prize space in these results is an arbitrary…

This paper proposes a totally asymmetric simple exclusion process on a traveling lane, which is equipped with a queueing system and functions of site assignments along the parking lane. In the proposed system, new particles arrive at the…

This paper contains a partial answer to the open problem 3.11 of \cite{[H2008]}. That is to find an explicit bijection on Schr\"oder paths that inverts the statistics area and bounce. This paper started as an attempt to write the sum over…

Vector space models have become popular in distributional semantics, despite the challenges they face in capturing various semantic phenomena. We propose a novel probabilistic framework which draws on both formal semantics and recent…

We propose a novel and efficient algorithm for the collaborative preference completion problem, which involves jointly estimating individualized rankings for a set of entities over a shared set of items, based on a limited number of…

This work addresses the problem of predicting the motion trajectories of dynamic objects in the environment. Recent advances in predicting motion patterns often rely on machine learning techniques to extrapolate motion patterns from…

Kim, Kim, and Neggers (2019) defined probability functions on a poset, by listing some very natural conditions that a function \(\pi: P \times P \to [0,1]\) should satisfy in order to capture the intuition of "the likelihood that \(a\)…

Let $\mathfrak{S}_n$ denote the symmetric group and let $W(\mathfrak{S}_n)$ denote the weak order of $\mathfrak{S}_n$. Through a surprising connection to a subset of parking functions, which we call unit Fubini rankings, we provide a…

Motivated by the need for accurate traffic flow prediction in transportation management, we propose a functional data method to analyze traffic flow patterns and predict future traffic flow. In this study we approach the problem by sampling…

Recently, the authors extended the notion of parking functions to parking sequences, which include cars of different sizes, and proved a product formula for the number of such sequences. We here give a refinement of that result involving…

Motivated by the success of Sinkhorn's algorithm for entropic optimal transport, we study convergence properties of iterative proportional fitting procedures (IPFP) used to solve more general information projection problems. We establish…

This is a general description of a probabilistic formalism of mechanics, i.e., an extension of the Newtonian mechanics principles to the systems undergoing random motion. From an analysis of the induction procedure from experimental data to…

In many applications of social navigation, existing works have shown that predicting and reasoning about human intentions can help robotic agents make safer and more socially acceptable decisions. In this work, we study this problem for…