相关论文: Completing a k-1 assignment

It is well known that, under some assumptions, the limit distribution of random block matrices and their partial transposition converges to the distributions of random variables in some noncommutative probability space. Using free…

Consider the problem in which n jobs that are classified into k types are to be scheduled on m identical machines without preemption. A machine requires a proper setup taking s time units before processing jobs of a given type. The…

We extend the relation between random matrices and free probability theory from the level of expectations to the level of all correlation functions (which are classical cumulants of traces of products of the matrices). We introduce the…

A simple numerical method for loading of a relativistic Maxwellian-type distribution is proposed based on inverse transform sampling. The relativistic Maxwellian energy distribution is introduced as an alternative to the Maxwell-J\"{u}ttner…

Integral expressions for positive-part moments E X_+^p (p>0) of random variables X are presented, in terms of the Fourier-Laplace or Fourier transforms of the distribution of X. A necessary and sufficient condition for the validity of such…

In this paper, we provide a novel algorithm for solving planning and learning problems of Markov decision processes. The proposed algorithm follows a policy iteration-type update by using a rank-one approximation of the transition…

We propose a novel distribution-free scheme to solve optimization problems where the goal is to minimize the expected value of a cost function subject to probabilistic constraints. Unlike standard sampling-based methods, our idea consists…

We consider cost constrained versions of the minimum spanning tree problem and the assignment problem. We assume edge weights are independent copies of a continuous random variable $Z$ that satisfies $F(x)=\Pr(Z\leq x)\approx x^\alpha$ as…

We consider an expected-value ranking and selection (R&S) problem where all k solutions' simulation outputs depend on a common parameter whose uncertainty can be modeled by a distribution. We define the most probable best (MPB) to be the…

A method to generate new classes of random matrix ensembles is proposed. Random matrices from these ensembles are Lax matrices of classically integrable systems with a certain distribution of momenta and coordinates. The existence of an…

Consider the fundamental problem of drawing a simple random sample of size k without replacement from [n] := {1, . . . , n}. Although a number of classical algorithms exist for this problem, we construct algorithms that are even simpler,…

We consider a refracted jump diffusion process having two-sided jumps with rational Laplace transforms. For such a process, by applying a straightforward but interesting approach, we derive formulas for the Laplace transform of its…

Motivated by the question of computing the probability of successful power domination by placing k monitors uniformly at random, in this paper we give a recursive formula to count the number of power domination sets of size k in a labeled…

We consider estimation of the covariance matrix of a multivariate random vector under the constraint that certain covariances are zero. We first present an algorithm, which we call Iterative Conditional Fitting, for computing the maximum…

We consider the k-th order statistic from unit exponential distribution and show that it can be represented as a sum of independent exponential random variables. Our proof is simple and different. It readily proves that the standardized…

The paper considers the problem of orthogonal variable spreading Walsh-code assignments. The aim of the paper is to provide assignments that can avoid both complicated signaling from the BS to the users and blind rate and code detection…

We study the k-core of a random (multi)graph on n vertices with a given degree sequence. We let n tend to infinity. Then, under some regularity conditions on the degree sequences, we give conditions on the asymptotic shape of the degree…

We consider the problem of matrix completion on an $n \times m$ matrix. We introduce the problem of Interpretable Matrix Completion that aims to provide meaningful insights for the low-rank matrix using side information. We show that the…

We study the Lagrangian formulation of a class of the Monge-Kantorovich optimal transportation problem. It can be considered a stochastic optimal transportation problem for absolutely continuous stochastic processes. A cost function and…

Many practical scenarios make it necessary to evaluate top-k queries over data items with partially unknown values. This paper considers a setting where the values are taken from a numerical domain, and where some partial order constraints…