中文
相关论文

相关论文: Finite-sample frequency distributions originating …

200 篇论文

Assume in a sample of size M one finds M_i representatives of species i with i=1...N^*. The normalized frequency p^*_i=M_i/M, based on the finite sample, may deviate considerably from the true probabilities p_i. We propose a method to infer…

其他定量生物学 · 定量生物学 2007-05-23 Thorsten Poeschel , Werner Ebeling , Cornelius Froemmel , Rosa Ramirez

A predictive distribution over a sequence of $N+1$ events is said to be "frequency mimicking" whenever the probability for the final event conditioned on the outcome of the first $N$ events equals the relative frequency of successes among…

统计方法学 · 统计学 2019-09-06 Frank Lad , Giuseppe Sanfilippo

The generalised random Fibonacci chain is a stochastic extension of the classical Fibonacci substitution and is defined as the rule mapping $0\mapsto 1$ and $1 \mapsto 1^i01^{m-i}$ with probability $p_i$, where $p_i\geq 0$ with…

组合数学 · 数学 2012-03-12 Johan Nilsson

This paper investigates what can be inferred about an arbitrary continuous probability distribution from a finite sample of $N$ observations drawn from it. The central finding is that the $N$ sorted sample points partition the real line…

机器学习 · 统计学 2025-07-30 Urban Eriksson

We describe a new method that is both physically explicable and quantitatively accurate in describing the multifractal characteristics of intermittent events based on groupings of rank-ordered fluctuations. The generic nature of such…

天体物理学 · 物理学 2009-06-23 Tom Chang , Cheng-chin Wu

A permutation $\sigma$ describing the relative orders of the first $n$ iterates of a point $x$ under a self-map $f$ of the interval $I=[0,1]$ is called an \emph{order pattern}. For fixed $f$ and $n$, measuring the points $x\in I$ (according…

组合数学 · 数学 2010-03-30 Aaron Abrams , Eric Babson , Henry Landau , Zeph Landau , James Pommersheim

Estimating the probability distribution 'q' governing the behaviour of a certain variable by sampling its value a finite number of times most typically involves an error. Successive measurements allow the construction of a histogram, or…

统计力学 · 物理学 2009-11-07 Ines Samengo

The exact expression is derived for the expected value, $< {p_i}> $, for the parameter for any bin $i$ of a histogram following a multinomial distribution derived by sorting $N$ observations into bins of $B$ classes, if $n_i$ of the…

统计理论 · 数学 2013-03-18 Jonathan M. Friedman

We study semiorders induced by points drawn from a uniform random distribution. Of particular interest in this paper are the probabilities of generating specific semiorders and the equivalence classes they produce. We present a method for…

组合数学 · 数学 2025-09-25 Csaba Biró , Caroline E. Boone

We consider a number $\nu_n$ of components in a random graph $G(n,p)$ with $n$ vertices, where the probability of an edge is equal to $p$. By operating with special generating functions we shows the next asymptotic relation for factorial…

概率论 · 数学 2019-04-03 Nikolay Kazimirow

We give sharp, uniform estimates for the probability that the empirical distribution function for n uniform-[0,1] random variables stays to one side of a given line.

概率论 · 数学 2008-05-02 Kevin Ford

We introduce a sharpness functional for probabilistic models that quantifies sharpness as an intrinsic property of the probability distribution. The measure is derived based on a rank-based concentration principle that tracks upward…

统计方法学 · 统计学 2026-04-03 Pekka Syrjänen

We propose the following model of a random graph on n vertices. Let F be a distribution in R_+^{n(n-1)/2} with a coordinate for every pair i$ with 1 \le i,j \le n. Then G_{F,p} is the distribution on graphs with n vertices obtained by…

组合数学 · 数学 2011-08-09 Alan Frieze , Santosh Vempala , Juan Vera

Assume that $m,s\in\mathbb N$, $m>1$, while $f$ is a polynomial with integer coefficients, $\text{deg}~f>1$, $f^{(i)}$ is the $i$th iteration of the polynomial $f$, $\kappa_n$ has a discrete uniform distribution on the set $\{0,1,\ldots,m^n…

数论 · 数学 2017-09-21 Emil Lerner

Let $V(k)$ denote the waiting time, the number of trials needed to get a consecutive $k$ ones. We propose recurrence algorithms for the probability distribution function (pdf) and the probability generating function (pgf) of $V(k)$ in…

概率论 · 数学 2022-10-18 Jungtaek Oh , Chongjin Park , Sungsu Kim

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…

统计力学 · 物理学 2015-06-24 Thorsten Poeschel , Werner Ebeling , Helge Rose

For many applications one wishes to decide whether a certain set of numbers originates from an equiprobability distribution or whether they are unequally distributed. Distributions of relative frequencies may deviate significantly from the…

基因组学 · 定量生物学 2007-05-23 Thorsten Poeschel , Cornelius Froemmel , Christoph Gille

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 · 物理学 2009-10-28 Thorsten Pöschel , Werner Ebeling , Helge Rosé

We prove uniform estimates for the expected value of averages of order statistics of matrices in terms of their largest entries. As an application, we obtain similar probabilistic estimates for $\ell_p$ norms via real interpolation.

概率论 · 数学 2018-10-02 Richard Lechner , Markus Passenbrunner , Joscha Prochno

Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. Using an analysis of the probability that two overlapping consecutive $k$-permutations are order isomorphic, we show that the expected number of distinct consecutive patterns in…

‹ 上一页 1 2 3 10 下一页 ›