English
Related papers

Related papers: The logarithmic Zipf version of the coupon collect…

200 papers

Zipf's law describes the empirical size distribution of the components of many systems in natural and social sciences and humanities. We show, by solving a statistical model, that Zipf's law co-occurs with the maximization of the diversity…

Statistical Mechanics · Physics 2021-10-05 Onofrio Mazzarisi , Amanda de Azevedo-Lopes , Jeferson J. Arenzon , Federico Corberi

We consider the problem of estimating the number of types in a corpus using the number of types observed in a sample of tokens from that corpus. We derive exact and asymptotic distributions for the number of observed types, conditioned upon…

Methodology · Statistics 2014-06-27 Shohei Hidaka

Zipf's law is the most common statistical distribution displaying scaling behavior. Cities, populations or firms are just examples of this seemingly universal law. Although many different models have been proposed, no general theoretical…

Statistical Mechanics · Physics 2010-07-05 Bernat Corominas Murtra , Ricard Solé

Let $A^{(n)}_{l;k}\subset S_n$ denote the event that the set of $l$ consecutive numbers $\{k,k+1,\cdots, k+l-1\}$ appear in a set of $l$ consecutive positions. Let $p=\{p_j\}_{j=1}^\infty$ be a distribution on $\mathbb{N}$ with $p_j>0$. Let…

Probability · Mathematics 2021-01-08 Ross G. Pinsky

In this paper, the joint distribution of the sum and maximum of independent, not necessarily identically distributed, nonnegative random variables is studied for two cases: i) continuous and ii) discrete random variables. First, a recursive…

Probability · Mathematics 2024-07-01 Christos N. Efrem

We propose a new method for the calculation of the statistical properties, as e.g. the entropy, of unknown generators of symbolic sequences. The probability distribution $p(k)$ of the elements $k$ of a population can be approximated by the…

chao-dyn · Physics 2009-10-28 Thorsten Pöschel , Werner Ebeling , Helge Rosé

Let (W_i, J_i) be a sequence of i.i.d. R_+ x R-valued random vectors. Considering the partial sum of the first component and the corresponding maximum of the second component, we are interested in the limit distributions that can be…

Probability · Mathematics 2016-09-09 Katharina Hees , Hans-Peter Scheffler

Given a probability distribution ${\bf p} = (p_1, \dots, p_n)$ and an integer $1\leq m < n$, we say that ${\bf q} = (q_1, \dots, q_m)$ is a contiguous $m$-aggregation of ${\bf p}$ if there exist indices $0=i_0 < i_1 < \cdots < i_{m-1} < i_m…

Information Theory · Computer Science 2018-05-16 Ferdinando Cicalese , Ugo Vaccaro

This paper investigates how global decision problems over arithmetically represented domains acquire reflective structure through class-quantification. Arithmetization forces diagonal fixed points whose verification requires reflection…

Computational Complexity · Computer Science 2025-11-19 Milan Rosko

Repeated sampling is a standard way to spend test-time compute, but its benefit is controlled by the latent distribution of correctness across examples, not by one-call accuracy alone. We study the binary correctness layer of repeated LLM…

Machine Learning · Computer Science 2026-05-08 Yi Liu

Let $X$ be an isotropic random vector in $R^d$ that satisfies that for every $v \in S^{d-1}$, $\|<X,v>\|_{L_q} \leq L \|<X,v>\|_{L_p}$ for some $q \geq 2p$. We show that for $0<\varepsilon<1$, a set of $N = c(p,q,\varepsilon) d$ random…

Probability · Mathematics 2020-08-20 Shahar Mendelson

The algorithmic theory of randomness is well developed when the underlying space is the set of finite or infinite sequences and the underlying probability distribution is the uniform distribution or a computable distribution. These…

Computational Complexity · Computer Science 2016-08-31 Peter Gacs

The probability of finding a prime multiplet, i.e., a sequence of primes $p$ and $p+a_i$, $i=1... m$, being all primes where $p$ is some prime less than the integer $n$ is naively $1/log(n)^{m+1}$. It is shown that, in reality, it is…

Number Theory · Mathematics 2007-05-23 Doron Gepner

We consider a variant of the channel simulation problem with a single input and multiple outputs, where Alice observes a probability distribution $P$ from a set of prescribed probability distributions $\mathbb{\mathcal{P}}$, and sends a…

Information Theory · Computer Science 2021-09-07 Chak Fung Choi , Cheuk Ting Li

In this paper, we study the problem of estimating uniformly well the mean values of several distributions given a finite budget of samples. If the variance of the distributions were known, one could design an optimal sampling strategy by…

Machine Learning · Computer Science 2015-07-17 Alexandra Carpentier , Alessandro Lazaric , Mohammad Ghavamzadeh , Rémi Munos , Peter Auer , András Antos

Suppose Alice has a coin with heads probability $q$ and Bob has one with heads probability $p>q$. Now each of them will toss their coin $n$ times, and Alice will win iff she gets more heads than Bob does. Evidently the game favors Bob, but…

Combinatorics · Mathematics 2015-03-13 Vittorio Addona , Stan Wagon , Herb Wilf

We study properties of ridge functions $f(x)=g(a\cdot x)$ in high dimensions $d$ from the viewpoint of approximation theory. The considered function classes consist of ridge functions such that the profile $g$ is a member of a univariate…

Numerical Analysis · Mathematics 2013-11-11 Sebastian Mayer , Tino Ullrich , Jan Vybiral

Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern matching problem inspired by the popularity of such compression…

Data Structures and Algorithms · Computer Science 2011-04-22 Pawel Gawrychowski

Power-law distributions with various exponents are studied. We first introduce a simple and generic model that reproduces Zipf's law. We can regard this model both as the time evolution of the population of cities and that of the asset…

Statistical Mechanics · Physics 2007-05-23 Kenji Kawamura , Naomichi Hatano

We consider a bilevel continuous knapsack problem where the leader controls the capacity of the knapsack, while the follower chooses a feasible packing maximizing his own profit. The leader's aim is to optimize a linear objective function…

Data Structures and Algorithms · Computer Science 2022-07-19 Christoph Buchheim , Dorothee Henke , Jannik Irmai
‹ Prev 1 4 5 6 7 8 10 Next ›