English
Related papers

Related papers: The Probability Distribution for Draws Until First…

200 papers

We study discrete probabilistic programs with potentially unbounded looping behaviors over an infinite state space. We present, to the best of our knowledge, the first decidability result for the problem of determining whether such a…

Logic in Computer Science · Computer Science 2022-06-22 Mingshuai Chen , Joost-Pieter Katoen , Lutz Klinkenberg , Tobias Winkler

The problem of dividing resources fairly occurs in many practical situations and is therefore an important topic of study in economics. In this paper, we investigate envy-free divisions in the setting where there are multiple players in…

Computer Science and Game Theory · Computer Science 2020-01-17 Pasin Manurangsi , Warut Suksompong

The problem of quickest detection of a change in distribution is considered under the assumption that the pre-change distribution is known, and the post-change distribution is only known to belong to a family of distributions…

Applications · Statistics 2019-01-30 Tze Siong Lau , Wee Peng Tay , Venugopal V. Veeravalli

We find the asymptotic total variation distance between two distributions on configurations of m balls in n labeled bins: in the first, each ball is placed in a bin uniformly at random; in the second, k balls are planted in an arbitrary but…

Probability · Mathematics 2012-05-16 William Perkins

We study an urn process containing red and blue balls and two different strategies to reinforce the urn. Namely, a generalized P\'olya-type strategy versus an i.i.d. one. At each step, one of the two reinforcement strategies is chosen by…

Probability · Mathematics 2019-03-14 Manuel González-Navarrete , Rodrigo Lambert

We consider an urn model, whose replacement matrix has all entries nonnegative and is balanced, that is, has constant row sums. We obtain the rates of the counts of balls corresponding to each color for the strong laws to hold. The analysis…

Probability · Mathematics 2017-09-05 Amites Dasgupta , Krishanu Maulik

Set-coloring a graph means giving each vertex a subset of a fixed color set so that no two adjacent subsets have the same cardinality. When the graph is complete one gets a new distribution problem with an interesting generating function.…

Combinatorics · Mathematics 2007-05-23 Thomas Zaslavsky

In a recent paper [1], it has been claimed that the outcomes of a quantum coin toss which is idealized as an infinite binary sequence is 1-random. We also defend the correctness of this claim and assert that the outcomes of quantum…

General Physics · Physics 2021-06-16 İnanç Şahin

The wrapped normal distribution arises when a the density of a one-dimensional normal distribution is wrapped around the circle infinitely many times. At first look, evaluation of its probability density function appears tedious as an…

Computation · Statistics 2018-01-01 Gerhard Kurz , Igor Gilitschenski , Uwe D. Hanebeck

A theoretical framework is developed to describe the transformation that distributes probability density functions uniformly over space. In one dimension, the cumulative distribution can be used, but does not generalize to higher…

Neural and Evolutionary Computing · Computer Science 2016-09-08 Eric Kee

Decision trees built with data remain in widespread use for nonparametric prediction. Predicting probability distributions is preferred over point predictions when uncertainty plays a prominent role in analysis and decision-making. We study…

Methodology · Statistics 2024-06-21 Sara Shashaani , Ozge Surer , Matthew Plumlee , Seth Guikema

In this paper we consider a scenario where there are several algorithms for solving a given problem. Each algorithm is associated with a probability of success and a cost, and there is also a penalty for failing to solve the problem. The…

Data Structures and Algorithms · Computer Science 2020-08-11 Shlomo Moran , Irad Yavneh

We study how the order of N independent random walks in one dimension evolves with time. Our focus is statistical properties of the inversion number m, defined as the number of pairs that are out of sort with respect to the initial…

Statistical Mechanics · Physics 2010-12-17 E. Ben-Naim

Quantization for a probability distribution refers to the idea of estimating a given probability by a discrete probability supported by a finite number of points. In this paper, firstly a general approach to this process is outlined using…

Probability · Mathematics 2022-01-26 Joseph Rosenblatt , Mrinal Kanti Roychowdhury

In the game "Super Six", after successfully getting rid of a stick by rolling with the die a number that is not occupied, the player has the choice to continue to roll the die or to stop and to hand over the die to their opponent. The…

General Mathematics · Mathematics 2021-10-08 Rüdiger Jehn

We study the problem of mechanism design for allocating a set of indivisible items among agents with private preferences on items. We are interested in such a mechanism that is strategyproof (where agents' best strategy is to report their…

Computer Science and Game Theory · Computer Science 2024-08-05 Ankang Sun , Bo Chen

Stochastic dominance is a crucial tool for the analysis of choice under risk. It is typically analyzed as a property of two gambles that are taken in isolation. We study how additional independent sources of risk (e.g. uninsurable labor…

Probability · Mathematics 2020-05-14 Luciano Pomatto , Philipp Strack , Omer Tamuz

Randomness is a central concept to statistics and physics. Here, a statistical analysis shows experimental evidence that tossing coins and finding last digits of prime numbers are identical regarding statistics for equally likely outcomes.…

Applications · Statistics 2019-10-29 Yeseul Kim , Byung Mook Weon

For a stochastic process reset at random times, we discuss to what extent the probabilities of some orderings of observables associated with the intervals of time between resetting events are universal, i.e., independent of the choice of…

Statistical Mechanics · Physics 2023-04-28 Claude Godrèche

We study the mechanism design problem of allocating a set of indivisible items without monetary transfers. Despite the vast literature on this very standard model, it still remains unclear how do truthful mechanisms look like. We focus on…

Computer Science and Game Theory · Computer Science 2017-05-31 Georgios Amanatidis , Georgios Birmpas , George Christodoulou , Evangelos Markakis
‹ Prev 1 8 9 10 Next ›