IDEAS home Printed from https://ideas.repec.org/a/eee/jmvana/v190y2022ics0047259x22000331.html
   My bibliography  Save this article

Max-linear models in random environment

Author

Listed:
  • Klüppelberg, Claudia
  • Sönmez, Ercan

Abstract

We extend previous work of max-linear models on finite directed acyclic graphs to infinite graphs as well as random graphs, and investigate their relations to classical percolation theory, more particularly the impact of Bernoulli bond percolation on such models. We show that the critical probability of percolation on the oriented square lattice graph Z2 describes a phase transition in the obtained model. Focus is on the dependence introduced by this graph into the max-linear model. We discuss natural applications in communication networks, in particular, concerning the propagation of influences.

Suggested Citation

  • Klüppelberg, Claudia & Sönmez, Ercan, 2022. "Max-linear models in random environment," Journal of Multivariate Analysis, Elsevier, vol. 190(C).
    • Handle: RePEc:eee:jmvana:v:190:y:2022:i:c:s0047259x22000331
    DOI: 10.1016/j.jmva.2022.104999
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0047259X22000331
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.jmva.2022.104999?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Gissibl, Nadine & Klüppelberg, Claudia & Otto, Moritz, 2018. "Tail dependence of recursive max-linear models with regularly varying noise variables," Econometrics and Statistics, Elsevier, vol. 6(C), pages 149-167.
    2. Nadine Gissibl & Claudia Klüppelberg & Steffen Lauritzen, 2021. "Identifiability and estimation of recursive max‐linear models," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 48(1), pages 188-211, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Asenova, Stefka & Segers, Johan, 2022. "Max-linear graphical models with heavy-tailed factors on trees of transitive tournaments," LIDAM Discussion Papers ISBA 2022031, Université catholique de Louvain, Institute of Statistics, Biostatistics and Actuarial Sciences (ISBA).
    2. Kiriliouk, Anna, 2020. "Hypothesis testing for tail dependence parameters on the boundary of the parameter space," Econometrics and Statistics, Elsevier, vol. 16(C), pages 121-135.
    3. Zhong, Peng & Huser, Raphaël & Opitz, Thomas, 2024. "Exact Simulation of Max-Infinitely Divisible Processes," Econometrics and Statistics, Elsevier, vol. 30(C), pages 96-109.
    4. Klüppelberg, Claudia & Krali, Mario, 2021. "Estimating an extreme Bayesian network via scalings," Journal of Multivariate Analysis, Elsevier, vol. 181(C).
    5. Hu, Shuang & Peng, Zuoxiang & Segers, Johan, 2022. "Modelling multivariate extreme value distributions via Markov trees," LIDAM Discussion Papers ISBA 2022021, Université catholique de Louvain, Institute of Statistics, Biostatistics and Actuarial Sciences (ISBA).
    6. Segers, Johan, 2019. "One- versus multi-component regular variation and extremes of Markov trees," LIDAM Discussion Papers ISBA 2019001, Université catholique de Louvain, Institute of Statistics, Biostatistics and Actuarial Sciences (ISBA).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jmvana:v:190:y:2022:i:c:s0047259x22000331. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.