English
Related papers

Related papers: Asymptotic laws for regenerative compositions: gam…

200 papers

A random composition of $n$ appears when the points of a random closed set $\widetilde{\mathcal{R}}\subset[0,1]$ are used to separate into blocks $n$ points sampled from the uniform distribution. We study the number of parts $K_n$ of this…

Probability · Mathematics 2007-05-23 Alexander Gnedin , Jim Pitman , Marc Yor

A regenerative composition structure is a sequence of ordered partitions derived from the range of a subordinator by a natural sampling procedure. In this paper, we extend previous studies Barbour and Gnedin (2006), Gnedin, Iksanov and…

Probability · Mathematics 2012-09-04 Alexander Gnedin , Alexander Iksanov

A regenerative random composition of integer $n$ is constructed by allocating $n$ standard exponential points over a countable number of intervals, comprising the complement of the closed range of a subordinator $S$. Assuming that the…

Probability · Mathematics 2020-12-15 Dariusz Buraczewski , Bohdan Dovgay , Alexander Marynych

The points of the closed range of a drift-free subordinator with no killing are used for separating into blocks the elements of a sample of size $n$ from the standard exponential distribution. This gives rise to a random composition of $n$.…

Probability · Mathematics 2024-06-13 Alexander Iksanov , Wissem Jedidi

A new class of random composition structures (the ordered analog of Kingman's partition structures) is defined by a regenerative description of component sizes. Each regenerative composition structure is represented by a process of random…

Probability · Mathematics 2007-05-23 Alexander Gnedin , Jim Pitman

For $S$ a subordinator and $\Pi_n$ an independent Poisson process of intensity $ne^{-x}, x>0,$ we are interested in the number $K_n$ of gaps in the range of $S$ that are hit by at least one point of $\Pi_n$. Extending previous studies in…

Probability · Mathematics 2007-05-23 Andrew D. Barbour , Alexander V. Gnedin

We study pairs and m--tuples of compositions of a positive integer n with parts restricted to a subset P of positive integers. We obtain some exact enumeration results for the number of tuples of such compositions having the same number of…

Combinatorics · Mathematics 2015-12-09 Cyril Banderier , Pawel Hitczenko

In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…

Combinatorics · Mathematics 2019-04-19 Andrew MacFie

If $S$ is a cofinite set of positive integers, an "$S$-restricted composition of $n$" is a sequence of elements of $S$, denoted $\vec{\lambda}=(\lambda_1,\lambda_2,...)$, whose sum is $n$. For uniform random $S$-restricted compositions, the…

Combinatorics · Mathematics 2012-03-13 Eric Schmutz , Caroline Shapcott

A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…

Combinatorics · Mathematics 2007-05-23 Sergey Kitaev , Tyrrell B. McAllister , T. Kyle Petersen

We define the notion of asymptotically free for locally restricted compositions, which means roughly that large parts can often be replaced by any larger parts. Two well-known examples are Carlitz and alternating compositions. We show that…

Combinatorics · Mathematics 2012-08-07 Edward A. Bender , E. Rodney Canfield , Zhicheng Gao

We consider properties of determinants of some random symmetric matrices issued from multivariate statistics: Wishart/Laguerre ensemble (sample covariance matrices), Uniform Gram ensemble (sample correlation matrices) and Jacobi ensemble…

Probability · Mathematics 2008-01-30 Alain Rouault

We consider Kingman's partition structures which are regenerative with respect to a general operation of random deletion of some part. Prototypes of this class are the Ewens partition structures which Kingman characterised by regeneration…

Probability · Mathematics 2007-05-23 Alexander Gnedin , Jim Pitman

Replicability requires that algorithmic conclusions remain consistent when rerun on independently drawn data. A central structural question is composition: given $k$ problems each admitting a $\rho$-replicable algorithm with sample…

If a partition $\lambda$ of size n is chosen randomly according to the Plancherel measure $P_n[\lambda] = (\dim \lambda)^2/n!$, then as n goes to infinity, the rescaled shape of $\lambda$ is with high probability very close to a non-random…

Representation Theory · Mathematics 2010-09-22 Pierre-Loïc Méliot

Let $K$ be a number field, $k\geq 2$ an integer, $(K^*)^k$ the $k$-fold direct product of $K^*$ with coordinatewise multiplication, and $\Gamma$ a finitely generated subgroup of rank $r$ of $(K^*)^k$. Further, let $H(\alpha )$ denote the…

Number Theory · Mathematics 2026-05-29 Jan-Hendrik Evertse , Kálmán Győry , Lajos Hajdu , Florian Luca , László Remete

It is a result of Ginibre that the normalized bulk $k$-point correlation functions of a complex $n\times n$ Gaussian matrix with independent entries of mean zero and unit variance are asymptotically given by the determinantal point process…

Probability · Mathematics 2024-05-28 Terence Tao , Van Vu

Under suitable assumptions on the boundary conditions, it is shown that there is a bijective correspondence between equivalence classes of asymptotic reducibility parameters and asymptotically conserved n-2 forms in the context of…

High Energy Physics - Theory · Physics 2011-07-19 Glenn Barnich , Friedemann Brandt

The variance of the number of lattice points inside the dilated bounded set rD with random position in R^d has asymptotics r^(d-1) if the rotational quadratic average of the modulus of the Fourier transform of the set is O(r^(-d-1)). The…

Metric Geometry · Mathematics 2018-07-04 Jirí Janácek

We present a robust method which translates information on the speed of coming down from infinity of a genealogical tree into sampling formulae for the underlying population. We apply these results to population dynamics where the genealogy…

Probability · Mathematics 2012-02-01 Julien Berestycki , Nathanael Berestycki , Vlada Limic
‹ Prev 1 2 3 10 Next ›