Random Linear Systems with Quadratic Constraints: from Random Matrix Theory to replicas and back
arxiv(2024)
摘要
I present here a pedagogical introduction to the works by Rashel Tublin and
Yan V. Fyodorov on random linear systems with quadratic constraints, using
tools from Random Matrix Theory and replicas. These notes illustrate and
complement the material presented at the Summer School organised within the
Puglia Summer Trimester 2023 in Bari (Italy). Consider a system of M linear
equations in N unknowns, ∑_j=1^N A_kjx_j=b_k for k=1,…,M,
subject to the constraint that the solutions live on the N-sphere,
x_1^2+… + x_N^2=N. Assume that both the coefficients A_ij and the
parameters b_i be independent Gaussian random variables with zero mean. Using
two different approaches – based on Random Matrix Theory and on a replica
calculation – it is possible to compute whether a large linear system subject
to a quadratic constraint is typically solvable or not, as a function of the
ratio α=M/N and the variance σ^2 of the b_i's. This is done by
defining a quadratic loss function H(
x)=1/2∑_k=1^M[∑_j=1^NA_kj x_j-b_k]^2 and
computing the statistics of its minimal value on the sphere,
E_min=min_|| x||^2=NH( x), which is zero if the system is
compatible, and larger than zero if it is incompatible. One finds that there
exists a compatibility threshold 0<α_c<1, such that systems with
α>α_c are typically incompatible. This means that even weakly
under-complete linear systems could become typically incompatible if forced to
additionally obey a quadratic constraint.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要