Counting vines

Dependence Modeling: Vine Copula Handbook

Volumn , Issue , 2010, Pages 189-218

  Morales Nápoles, Oswaldo ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84986626485     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1142/9789814299886_0009     Document Type: Chapter

References (26)

1. Aas K. and Berg D. (2009). Models for construction of multivariate dependence: A comparison study. European Journal of Finance, 15:639-659.
2. Aas K., Czado C., Frigessi A. and Bakken H. (2009). Pair-copula constructions of multiple dependence. Insurance: Mathematics and Economics, 44(2):182-198.
3. Bedford T. J. and Cooke R. M. (2002). Vines: A new graphical model for dependent random variables. Annals of Statistics, 30(4):1031-1068.
4. Beineke L. (2006). Derived graphs with derived complements. Recent Trends in Graph Theory: Proceedings of the First New York City Graph Theory Conference held on June 11, 12, and 13, 1970. Springer.
5. Cayley A. (1889). A theorem on trees. The Quarterly Journal of Pure and Applied Mathematics, 23:376-378.
6. Chollete L., Heinen A. and Valdesogo A. (2009). Modeling international financial returns with a multivariate regime switching copula. Journal of Financial Econometrics, 7(4):437-480.
7. Chow C. and Liu C. (1968). Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory, 14(3):462-467.
8. Cooke R.M. (1997). Markov and entropy properties of tree and vine-dependent variables. Proceedings of the ASA Section on Bayesian Statistical Science. American Statistical Association, Washington.
9. Darroch J.N., Lauritzen S. and Speed T.P. (1980). Markov fields and log-linear interaction models for contingency tables. Annals of Statistics, 8(3):522-539.
10. Harary F. (1969). Graph Theory. Addison-Wesley, Reading, MA.
11. Harary F. and Palmer E.M. (1973). Graphical Enumeration. Academic Press, New York.
12. Kasyanov V.N. and Evstigneev V.A. (2000). Graph Theory for Programmers: Algorithms for Processing Trees. Kluwer Academic Publishers, Norwell, MA.
13. Kolbjornsen O. and Stien M. (2008). D-vine creation of non-Gaussian random field. Proceedings of the Eight International Geostatistics Congress, 399-408.
14. Kurowicka D. and Cooke R.M. (2006). Uncertainty Analysis with High Dimensional Dependence Modelling. Wiley, New York.
15. Mayeda W. and Seshu S. (1967). Generation of trees without duplication. IEEE Transactions on Circuit Theory, 12:181-185.
16. Min A. and Czado C. (2010). Bayesian inference for multivariate copulas using pair copula constructions. Journal of Financial Econometrics. In press.
17. Minty G.J. (1965). A simple algorithm for listing all the trees of a graph. IEEE Transactions on Circuit Theory, 12:120-220.
18. Moon J. (1967). Various proofs of Cayley’s formula for counting trees. In: A Seminar on Graph Theory, F. Harary (ed.). Holt, Rihehat and Winston, New York.
19. Morales-Nápoles O., Cooke R.M. and Kurowicka D. (2009). The number of vines and regular vines on n nodes. Submitted to Discrete Applied Mathematics.
20. Prins G. (1957). On the automorphism group of a tree. PhD thesis, University of Michigan.
21. Prüfer V.H. (1918). Neuer Beweis Eines Satzes über Permutationen. Archiv der Mathematik und Physik, 27:742-744.
22. Read R.C. and Tarjan R.E. (1975). Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks, 5:678-692.
23. Read R.C. and Wilson R.J. (2005). An Atlas of Graphs. Oxford University Press, Oxford.
24. Shioura A., Tamura A. and Uno T. (1994). An optimal algorithm for scanning all spanning trees of undirected graphs. SIAM Journal on Computing, 26:678-692.
25. Smith M.J. (1997). Generating spanning trees. Master’s thesis, University of Victoria.
26. Speed T.P. and Kiiveri H.T. (1986). Gaussian Markov distributions over finite graphs, Annals of Statistics, 14(1):138-150.