<p>Consider the matrix products <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10959_2025_1406_Article_IEq1.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="104" /> </InlineMediaObject> <EquationSource Format="TEX">\(G_n: = g_n \cdots g_1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>G</mi> <mi>n</mi> </msub> <mo>:</mo> <mo>=</mo> <msub> <mi>g</mi> <mi>n</mi> </msub> <mo>⋯</mo> <msub> <mi>g</mi> <mn>1</mn> </msub> </mrow> </math></EquationSource> </InlineEquation>, where <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10959_2025_1406_Article_IEq2.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="52" /> </InlineMediaObject> <EquationSource Format="TEX">\((g_{n})_{n\geqslant 1}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mrow> <mo stretchy="false">(</mo> <msub> <mi>g</mi> <mi>n</mi> </msub> <mo stretchy="false">)</mo> </mrow> <mrow> <mi>n</mi> <mo>⩾</mo> <mn>1</mn> </mrow> </msub> </math></EquationSource> </InlineEquation> is a sequence of independent and identically distributed positive random <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10959_2025_1406_Article_IEq3.gif" Format="GIF" Height="15" Rendition="HTML" Resolution="72" Type="Linedraw" Width="43" /> </InlineMediaObject> <EquationSource Format="TEX">\(d\times d\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>d</mi> <mo>×</mo> <mi>d</mi> </mrow> </math></EquationSource> </InlineEquation> matrices. Under the optimal third moment condition, we first establish a Berry–Esseen theorem and an Edgeworth expansion for the (<i>i</i>,&#xa0;<i>j</i>)-th entry <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10959_2025_1406_Article_IEq4.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="29" /> </InlineMediaObject> <EquationSource Format="TEX">\(G_n^{i,j}\)</EquationSource> <EquationSource Format="MATHML"><math> <msubsup> <mi>G</mi> <mi>n</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msubsup> </math></EquationSource> </InlineEquation> of the matrix <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10959_2025_1406_Article_IEq5.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="23" /> </InlineMediaObject> <EquationSource Format="TEX">\(G_n\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>G</mi> <mi>n</mi> </msub> </math></EquationSource> </InlineEquation>, where <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10959_2025_1406_Article_IEq6.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="89" /> </InlineMediaObject> <EquationSource Format="TEX">\(1 \leqslant i, j \leqslant d\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>1</mn> <mo>⩽</mo> <mi>i</mi> <mo>,</mo> <mi>j</mi> <mo>⩽</mo> <mi>d</mi> </mrow> </math></EquationSource> </InlineEquation>. Utilizing the Edgeworth expansion for <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10959_2025_1406_Article_IEq4.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="29" /> </InlineMediaObject> <EquationSource Format="TEX">\(G_n^{i,j}\)</EquationSource> <EquationSource Format="MATHML"><math> <msubsup> <mi>G</mi> <mi>n</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msubsup> </math></EquationSource> </InlineEquation> under the changed probability measure, we then prove precise upper and lower large deviation asymptotics for the entries <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10959_2025_1406_Article_IEq4.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="29" /> </InlineMediaObject> <EquationSource Format="TEX">\(G_n^{i,j}\)</EquationSource> <EquationSource Format="MATHML"><math> <msubsup> <mi>G</mi> <mi>n</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msubsup> </math></EquationSource> </InlineEquation> subject to an exponential moment assumption. As applications, we deduce local limit theorems with large deviations for <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10959_2025_1406_Article_IEq4.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="29" /> </InlineMediaObject> <EquationSource Format="TEX">\(G_n^{i,j}\)</EquationSource> <EquationSource Format="MATHML"><math> <msubsup> <mi>G</mi> <mi>n</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msubsup> </math></EquationSource> </InlineEquation> and establish upper and lower large deviations bounds for the spectral radius <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10959_2025_1406_Article_IEq10.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="44" /> </InlineMediaObject> <EquationSource Format="TEX">\(\rho (G_n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>ρ</mi> <mo stretchy="false">(</mo> <msub> <mi>G</mi> <mi>n</mi> </msub> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> of <InlineEquation ID="IEq11"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10959_2025_1406_Article_IEq5.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="23" /> </InlineMediaObject> <EquationSource Format="TEX">\(G_n\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>G</mi> <mi>n</mi> </msub> </math></EquationSource> </InlineEquation>. A byproduct of our approach is the local limit theorem for <InlineEquation ID="IEq12"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10959_2025_1406_Article_IEq4.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="29" /> </InlineMediaObject> <EquationSource Format="TEX">\(G_n^{i,j}\)</EquationSource> <EquationSource Format="MATHML"><math> <msubsup> <mi>G</mi> <mi>n</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msubsup> </math></EquationSource> </InlineEquation> under the optimal second moment condition. In the proofs we develop a spectral gap theory for both the norm cocycle and the coefficients, which is of independent interest.</p>

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

Edgeworth Expansion and Large Deviations for the Coefficients of Products of Positive Random Matrices

  • Hui Xiao,
  • Ion Grama,
  • Quansheng Liu

摘要

Consider the matrix products \(G_n: = g_n \cdots g_1\) G n : = g n g 1 , where \((g_{n})_{n\geqslant 1}\) ( g n ) n 1 is a sequence of independent and identically distributed positive random \(d\times d\) d × d matrices. Under the optimal third moment condition, we first establish a Berry–Esseen theorem and an Edgeworth expansion for the (ij)-th entry \(G_n^{i,j}\) G n i , j of the matrix \(G_n\) G n , where \(1 \leqslant i, j \leqslant d\) 1 i , j d . Utilizing the Edgeworth expansion for \(G_n^{i,j}\) G n i , j under the changed probability measure, we then prove precise upper and lower large deviation asymptotics for the entries \(G_n^{i,j}\) G n i , j subject to an exponential moment assumption. As applications, we deduce local limit theorems with large deviations for \(G_n^{i,j}\) G n i , j and establish upper and lower large deviations bounds for the spectral radius \(\rho (G_n)\) ρ ( G n ) of \(G_n\) G n . A byproduct of our approach is the local limit theorem for \(G_n^{i,j}\) G n i , j under the optimal second moment condition. In the proofs we develop a spectral gap theory for both the norm cocycle and the coefficients, which is of independent interest.