Elliptic Approximate Message Passing and an application to theoretical ecology

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Gueddari, Mohammed-Younes, Hachem, Walid, Najim, Jamal
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866916123358789632
author Gueddari, Mohammed-Younes
Hachem, Walid
Najim, Jamal
author_facet Gueddari, Mohammed-Younes
Hachem, Walid
Najim, Jamal
contents Approximate Message Passing (AMP) algorithmshave recently gathered significant attention across disciplines such as statistical physics, machine learning, and communication systems. This study aims to extend AMP algorithms to non-symmetric (elliptic) matrices, motivated by analyzing equilibrium properties in ecological systems featuring elliptic interaction matrices.In this article, we provide the general form of an AMP algorithm associated to a random elliptic matrix, the main change lying in a modification of the corrective (Onsager) term. In order to establish the statistical properties of this algorithm, we use and prove a generalized form of Bolthausen conditioning argument, pivotal to proceed by a Gaussian-based induction.We finally address the initial motivating question from theoretical ecology. Large foodwebs are often described by Lotka-Volterra systems of coupled differential equations, where the interaction matrix is elliptic random. In this context, we design an AMP algorithm to analyze the statistical properties of the equilibrium point in a high-dimensional regime. We rigorously recover the results established by [Bunin, 2017] and [Galla,2018] who used techniques from theoretical physics, and extend them with the help of propagation of chaos type arguments.
format Preprint
id arxiv_https___arxiv_org_abs_2402_08271
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Elliptic Approximate Message Passing and an application to theoretical ecology
Gueddari, Mohammed-Younes
Hachem, Walid
Najim, Jamal
Probability
Approximate Message Passing (AMP) algorithmshave recently gathered significant attention across disciplines such as statistical physics, machine learning, and communication systems. This study aims to extend AMP algorithms to non-symmetric (elliptic) matrices, motivated by analyzing equilibrium properties in ecological systems featuring elliptic interaction matrices.In this article, we provide the general form of an AMP algorithm associated to a random elliptic matrix, the main change lying in a modification of the corrective (Onsager) term. In order to establish the statistical properties of this algorithm, we use and prove a generalized form of Bolthausen conditioning argument, pivotal to proceed by a Gaussian-based induction.We finally address the initial motivating question from theoretical ecology. Large foodwebs are often described by Lotka-Volterra systems of coupled differential equations, where the interaction matrix is elliptic random. In this context, we design an AMP algorithm to analyze the statistical properties of the equilibrium point in a high-dimensional regime. We rigorously recover the results established by [Bunin, 2017] and [Galla,2018] who used techniques from theoretical physics, and extend them with the help of propagation of chaos type arguments.
title Elliptic Approximate Message Passing and an application to theoretical ecology
topic Probability
url https://arxiv.org/abs/2402.08271