IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v15y2013i1d10.1007_s11009-011-9210-6.html
   My bibliography  Save this article

MARM Processes Part II: The Empirically-Based Subclass

Author

Listed:
  • Benjamin Melamed

    (Rutgers University)

  • Xiang Zhao

    (Rutgers University)

Abstract

MARM (Multivariate Autoregressive Modular) processes constitute a versatile class of multidimensional stochastic sequences which can exactly fit arbitrary multi-dimensional empirical histograms and approximately fit the leading empirical autocorrelations and cross-correlations. A companion paper (Part I) presented the general theory of MARM processes. This paper (Part II) proposes practical MARM modeling and forecasting methodologies of considerable generality, suitable for implementation on a computer. The purpose of Part II is twofold: (1) to specialize the general class of MARM processes to a practical subclass, called Empirically-Based MARM (EB-MARM) processes, suitable for modeling of empirical vector-valued time series, and devise the corresponding fitting and forecasting algorithms; and (2) to illustrate the efficacy of the EB-MARM fitting and forecasting algorithms. Specifically, we shall consider MARM processes with iid step-function innovation densities and distortions based on an empirical multi-dimensional histogram, as well as empirical autocorrelation and cross-correlation functions. Finally, we illustrate the efficacy of these methodologies with an example of a three-dimension time series vector, using a software environment, called MultiArmLab, which supports MARM modeling and forecasting.

Suggested Citation

  • Benjamin Melamed & Xiang Zhao, 2013. "MARM Processes Part II: The Empirically-Based Subclass," Methodology and Computing in Applied Probability, Springer, vol. 15(1), pages 37-83, March.
    • Handle: RePEc:spr:metcap:v:15:y:2013:i:1:d:10.1007_s11009-011-9210-6
    DOI: 10.1007/s11009-011-9210-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-011-9210-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11009-011-9210-6?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. Benjamin Melamed, 1991. "TES: A Class of Methods for Generating Autocorrelated Uniform Variates," INFORMS Journal on Computing, INFORMS, vol. 3(4), pages 317-329, November.
    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. Girish, Muckai K. & Hu, Jian-Qiang, 2001. "Approximations for the departure process of the G/G/1 queue with Markov-modulated arrivals," European Journal of Operational Research, Elsevier, vol. 134(3), pages 540-556, November.
    2. Wheyming Tina, Song & Li-Ching, Hsiao & Yun-Ju, Chen, 1996. "Generating pseudo-random time series with specified marginal distributions," European Journal of Operational Research, Elsevier, vol. 94(1), pages 194-202, October.
    3. Marne C. Cario & Barry L. Nelson, 1998. "Numerical Methods for Fitting and Simulating Autoregressive-to-Anything Processes," INFORMS Journal on Computing, INFORMS, vol. 10(1), pages 72-81, February.
    4. Gamze Tokol & David Goldsman & Daniel H. Ockerman & James J. Swain, 1998. "Standardized Time Series Lp-Norm Variance Estimators for Simulations," Management Science, INFORMS, vol. 44(2), pages 234-245, February.
    5. Benjamin Melamed & Xiang Zhao, 2013. "MARM Processes Part I: General Theory," Methodology and Computing in Applied Probability, Springer, vol. 15(1), pages 1-35, March.
    6. Henry Lam, 2018. "Sensitivity to Serial Dependency of Input Processes: A Robust Approach," Management Science, INFORMS, vol. 64(3), pages 1311-1327, March.
    7. Kriman, V. & Rubinstein, R.Y., 1995. "Polynomial Time Algorithms for Estimation of Rare Events in Queueing Models," Discussion Paper 1995-12, Tilburg University, Center for Economic Research.
    8. Kriman, V. & Rubinstein, R.Y., 1995. "Polynomial Time Algorithms for Estimation of Rare Events in Queueing Models," Other publications TiSEM bb044e22-c7f1-41f2-b4d9-2, Tilburg University, School of Economics and Management.

    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:spr:metcap:v:15:y:2013:i:1:d:10.1007_s11009-011-9210-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.