相关论文: Three Sampling Formulas

We present combinatorial rules (one theorem and two conjectures) concerning three bases of Z[x1,x2,....]. First, we prove a "splitting" rule for the basis of key polynomials [Demazure '74], thereby establishing a new positivity theorem…

We review the class of species sampling models (SSM). In particular, we investigate the relation between the exchangeable partition probability function (EPPF) and the predictive probability function (PPF). It is straightforward to define a…

Specify a randomized algorithm that, given a very large graph or network, extracts a random subgraph. What can we learn about the input graph from a single subsample? We derive laws of large numbers for the sampler output, by relating…

In this paper, we provide an explicit probability distribution for classification purposes. It is derived from the Bayesian nonparametric mixture of Dirichlet process model, but with suitable modifications which remove unsuitable aspects of…

The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the…

In this paper, we propose a new class of distributions by exponentiating the random variables associated with the probability density functions of composite distributions. We also derive some mathematical properties of this new class of…

We provide frequency probabilistic analysis of perturbations of physical systems by preparation procedures. We obtained the classification of possible probabilistic transformations connecting input and output probabilities that can appear…

Using a new presentation for partition algebras (J. Algebraic Combin. 37(3):401-454, 2013), we derive explicit combinatorial formulae for the seminormal representations of the partition algebras. These results generalise to the partition…

Assuming repeated independent sampling from a Bernoulli distribution with two possible outcomes S and F, there are formulas for computing the probability of one specific pattern of consecutive outcomes (such as SSFFSS) winning (i.e. being…

We find the formulas of the transition probabilities of the $N$-particle multi-species asymmetric simple exclusion processes (ASEP), and show that the transition probabilities are written as a determinant when the order of particles in the…

We derive and prove an explicit formula for the sum of the fractional parts of certain geometric series. Although the proof is straightforward, we have been unable to locate any reference to this result. This summation formula allows us to…

We characterize the distributions that arise as derivatives of families of probabilities and of positive and signed measures on smooth manifolds.

Cumulants are a notion that comes from the classical probability theory, they are an alternative to a notion of moments. We adapt the probabilistic concept of cumulants to the setup of a linear space equipped with two multiplication…

Partial symplectic conditional and joint probability representations of quantum mechanics are considered. The correspondence rules for most interesting physical operators are found and the expressions of the dual symbols of operators are…

Computational mechanics, an approach to structural complexity, defines a process's causal states and gives a procedure for finding them. We show that the causal-state representation--an $\epsilon$-machine--is the minimal one consistent with…

We explore various combinatorial problems mostly borrowed from physics, that share the property of being continuously or discretely integrable, a feature that guarantees the existence of conservation laws that often make the problems…

We introduce a class of random graphs that we argue meets many of the desiderata one would demand of a model to serve as the foundation for a statistical analysis of real-world networks. The class of random graphs is defined by a…

We consider a component of the word statistics known as clump; starting from a finite set of words, clumps are maximal overlapping sets of these occurrences. This parameter has first been studied by Schbath with the aim of counting the…

A class of probability distributions is characterized via equalities in law between two order statistics shifted by independent exponential variables. An explicit formula for the quintile function of the identified family of distributions…

We review old and new uses of exchangeability, emphasizing the general theme of exchangeable representations of complex random structures. Illustrations of this theme include processes of stochastic coalescence and fragmentation; continuum…