<p>This paper investigates the asymptotic distribution of order statistics in generalized allocation schemes. We focus on scenarios where <i>n</i>, the number of particles, and <i>N</i>, the number of cells, satisfy <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(n = \theta N^a\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>=</mo> <mi>θ</mi> <msup> <mi>N</mi> <mi>a</mi> </msup> </mrow> </math></EquationSource> </InlineEquation> for some <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(a &gt; 1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>a</mi> <mo>&gt;</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation> and a positive constant <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(\theta \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>θ</mi> </math></EquationSource> </InlineEquation>. Building on foundational work by Kolchin and others, where the joint distribution of the number of particles in each cell, <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\((\eta _1 = k_1, \ldots , \eta _N = k_N)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">(</mo> <msub> <mi>η</mi> <mn>1</mn> </msub> <mo>=</mo> <msub> <mi>k</mi> <mn>1</mn> </msub> <mo>,</mo> <mo>…</mo> <mo>,</mo> <msub> <mi>η</mi> <mi>N</mi> </msub> <mo>=</mo> <msub> <mi>k</mi> <mi>N</mi> </msub> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>, follows a conditional joint distribution <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\((\xi _1 = k_1, \ldots , \xi _N = k_N \mid \xi _1 + \cdots + \xi _N = n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">(</mo> <msub> <mi>ξ</mi> <mn>1</mn> </msub> <mo>=</mo> <msub> <mi>k</mi> <mn>1</mn> </msub> <mo>,</mo> <mo>…</mo> <mo>,</mo> <msub> <mi>ξ</mi> <mi>N</mi> </msub> <mo>=</mo> <msub> <mi>k</mi> <mi>N</mi> </msub> <mo>∣</mo> <msub> <mi>ξ</mi> <mn>1</mn> </msub> <mo>+</mo> <mo>⋯</mo> <mo>+</mo> <msub> <mi>ξ</mi> <mi>N</mi> </msub> <mo>=</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>, we assume that <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(\xi _i\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>ξ</mi> <mi>i</mi> </msub> </math></EquationSource> </InlineEquation> are independent geometric random variables and <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(k_1 + \cdots + k_N = n\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>k</mi> <mn>1</mn> </msub> <mo>+</mo> <mo>⋯</mo> <mo>+</mo> <msub> <mi>k</mi> <mi>N</mi> </msub> <mo>=</mo> <mi>n</mi> </mrow> </math></EquationSource> </InlineEquation>. We extend the analysis to determine the limiting distributions and the moment generating functions of the order statistics <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(\eta _{(1)}\le \eta _{(2)}\le \cdots \le \eta _{(N)}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>η</mi> <mrow> <mo stretchy="false">(</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> </msub> <mo>≤</mo> <msub> <mi>η</mi> <mrow> <mo stretchy="false">(</mo> <mn>2</mn> <mo stretchy="false">)</mo> </mrow> </msub> <mo>≤</mo> <mo>⋯</mo> <mo>≤</mo> <msub> <mi>η</mi> <mrow> <mo stretchy="false">(</mo> <mi>N</mi> <mo stretchy="false">)</mo> </mrow> </msub> </mrow> </math></EquationSource> </InlineEquation> under these allocation models. We present the limiting distributions for <InlineEquation ID="IEq9"> <EquationSource Format="TEX">\(\eta _{(m)}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>η</mi> <mrow> <mo stretchy="false">(</mo> <mi>m</mi> <mo stretchy="false">)</mo> </mrow> </msub> </math></EquationSource> </InlineEquation> and the moment generating functions of <InlineEquation ID="IEq10"> <EquationSource Format="TEX">\(\eta _{(m)} / N^{a-2}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>η</mi> <mrow> <mo stretchy="false">(</mo> <mi>m</mi> <mo stretchy="false">)</mo> </mrow> </msub> <mo stretchy="false">/</mo> <msup> <mi>N</mi> <mrow> <mi>a</mi> <mo>-</mo> <mn>2</mn> </mrow> </msup> </mrow> </math></EquationSource> </InlineEquation> for <InlineEquation ID="IEq11"> <EquationSource Format="TEX">\(1\le m \le N\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>1</mn> <mo>≤</mo> <mi>m</mi> <mo>≤</mo> <mi>N</mi> </mrow> </math></EquationSource> </InlineEquation> under certain conditions. These findings have significant implications for applications in random graphs and sequences of runs, providing deeper insights into their asymptotic behavior.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Asymptotic Distribution of Order Statistics in Generalized Allocation Schemes

  • May-Ru Chen,
  • Chong-Yi Li,
  • Ju-Yi Yen

摘要

This paper investigates the asymptotic distribution of order statistics in generalized allocation schemes. We focus on scenarios where n, the number of particles, and N, the number of cells, satisfy \(n = \theta N^a\) n = θ N a for some \(a > 1\) a > 1 and a positive constant \(\theta \) θ . Building on foundational work by Kolchin and others, where the joint distribution of the number of particles in each cell, \((\eta _1 = k_1, \ldots , \eta _N = k_N)\) ( η 1 = k 1 , , η N = k N ) , follows a conditional joint distribution \((\xi _1 = k_1, \ldots , \xi _N = k_N \mid \xi _1 + \cdots + \xi _N = n)\) ( ξ 1 = k 1 , , ξ N = k N ξ 1 + + ξ N = n ) , we assume that \(\xi _i\) ξ i are independent geometric random variables and \(k_1 + \cdots + k_N = n\) k 1 + + k N = n . We extend the analysis to determine the limiting distributions and the moment generating functions of the order statistics \(\eta _{(1)}\le \eta _{(2)}\le \cdots \le \eta _{(N)}\) η ( 1 ) η ( 2 ) η ( N ) under these allocation models. We present the limiting distributions for \(\eta _{(m)}\) η ( m ) and the moment generating functions of \(\eta _{(m)} / N^{a-2}\) η ( m ) / N a - 2 for \(1\le m \le N\) 1 m N under certain conditions. These findings have significant implications for applications in random graphs and sequences of runs, providing deeper insights into their asymptotic behavior.