{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T18:03:27Z","timestamp":1780423407984,"version":"3.54.1"},"reference-count":44,"publisher":"Oxford University Press (OUP)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["jcomplexnetw"],"DOI":"10.1093\/comnet\/cnw015","type":"journal-article","created":{"date-parts":[[2016,6,23]],"date-time":"2016-06-23T17:13:13Z","timestamp":1466701993000},"page":"cnw015","source":"Crossref","is-referenced-by-count":69,"title":["Network Filtering for Big Data: Triangulated Maximally Filtered Graph"],"prefix":"10.1093","author":[{"given":"Guido Previde","family":"Massara","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"T.","family":"Di Matteo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tomaso","family":"Aste","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2016,6,21]]},"reference":[{"key":"2016083019142472000_cnw015v2.1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"2016083019142472000_cnw015v2.2","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s100510050929","article-title":"Hierarchical structure in financial markets.","volume":"11","author":"Mantegna.","year":"1999","journal-title":"Eur. Phys. J. B"},{"key":"2016083019142472000_cnw015v2.3","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2004.08.045"},{"key":"2016083019142472000_cnw015v2.4","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0500298102"},{"key":"2016083019142472000_cnw015v2.5","unstructured":"Aste T. An Algorithm to Compute Maximally Filtered Planar Graphs. http:\/\/www.mathworks.com\/matlabcentral\/fileexchange\/27360. Accessed on 26 April 2016."},{"key":"2016083019142472000_cnw015v2.6","unstructured":"Giffin J. W. Graph theoretic techniques for facilities layout. Ph.D. Thesis, University of Canterbury, 1984."},{"key":"2016083019142472000_cnw015v2.7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2003.09.005"},{"key":"2016083019142472000_cnw015v2.8","first-page":"179","article-title":"A new approximation algorithm for finding heavy planar subgraphs.","volume":"36","author":"C\u01celinescu","year":"2003","journal-title":"Algorithmica (New York)"},{"key":"2016083019142472000_cnw015v2.9","doi-asserted-by":"crossref","unstructured":"Song W.-M., Di Matteo, T. & Aste, T. (2012) Hierarchical information clustering by means of topologically embedded graphs. PLoS One, 7:e31929, 2012.","DOI":"10.1371\/journal.pone.0031929"},{"key":"2016083019142472000_cnw015v2.10","doi-asserted-by":"crossref","unstructured":"Musmeci N., Aste T. & Di Matteo, T. (2015) Relation between financial market structure and the real economy: comparison between clustering methods. PLoS One 10:e0126998.","DOI":"10.1371\/journal.pone.0116201"},{"key":"2016083019142472000_cnw015v2.11","first-page":"11722.","article-title":"Risk diversification: a study of persistence with a filtered correlation-network approach.","volume":"1","author":"Musmeci","year":"2015","journal-title":"J. Netw. Theory Finance"},{"key":"2016083019142472000_cnw015v2.12","doi-asserted-by":"crossref","first-page":"1665.","DOI":"10.1038\/srep01665","article-title":"Spread of risk across financial markets: better to invest in the peripheries.","volume":"3","author":"Pozzi","year":"2013","journal-title":"Sci. Rep."},{"key":"2016083019142472000_cnw015v2.13","doi-asserted-by":"crossref","unstructured":"Kindermann R. & Snell J. L. Markov Random Fields and Their Applications, vol. 1. Providence, RI: American Mathematical Society, 1980.","DOI":"10.1090\/conm\/001"},{"key":"2016083019142472000_cnw015v2.14","first-page":"473.","article-title":"Approximate inference using planar graph decomposition.","volume":"19.","author":"Globerson","year":"2007","journal-title":"Advances in Neural Information Processing Systems 19: Proceedings of the 2006 Conference"},{"key":"2016083019142472000_cnw015v2.15","unstructured":"Bach F. R. & Jordan, M. I. (2001) Thin junction trees. Advances in Neural Information Processing Systems, pp. 569\u2013576."},{"key":"2016083019142472000_cnw015v2.16","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.86.036109"},{"key":"2016083019142472000_cnw015v2.17","doi-asserted-by":"crossref","first-page":"294","DOI":"10.2307\/1968099","article-title":"The combinatorial theory of complexes.","volume":"31","author":"Alexander","year":"1930","journal-title":"Ann. Math."},{"key":"2016083019142472000_cnw015v2.18","unstructured":"Lauritzen S. L. (1996) Graphical Models. Clarendon Press, Oxford: Oxford University Press."},{"key":"2016083019142472000_cnw015v2.19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000001","article-title":"Graphical models, exponential families, and variational inference.","volume":"1","author":"Wainwright","year":"2008","journal-title":"Found. Trends\u00ae Mach. Learn."},{"key":"2016083019142472000_cnw015v2.20","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel M., Lov\u00e1sz L. & Schrijver A. (1988) Geometric algorithms and combinatorial optimization. Berlin, Heidelberg, New York, Paris, Tokyo: Springer-Verlag.","DOI":"10.1007\/978-3-642-97881-4"},{"key":"2016083019142472000_cnw015v2.21","doi-asserted-by":"crossref","unstructured":"Drton M. Sturmfels, B. & Sullivant, S. (2009) Lectures on Algebraic Statistics, Oberwolfach Seminars. vol. 39, Basel: Birkh\u00e4user Verlag, Springer.","DOI":"10.1007\/978-3-7643-8905-5"},{"key":"2016083019142472000_cnw015v2.22","doi-asserted-by":"publisher","DOI":"10.1017\/S1446788700027300"},{"key":"2016083019142472000_cnw015v2.23","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/32\/41\/301"},{"key":"2016083019142472000_cnw015v2.24","doi-asserted-by":"publisher","DOI":"10.1080\/14786435.2011.613861"},{"key":"2016083019142472000_cnw015v2.25","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.85.046115"},{"key":"2016083019142472000_cnw015v2.26","doi-asserted-by":"crossref","unstructured":"Fiedor P. (2014) Networks in financial markets based on the mutual information rate. Phys. Rev. E, 89, 052801.","DOI":"10.1103\/PhysRevE.89.052801"},{"key":"2016083019142472000_cnw015v2.27","doi-asserted-by":"crossref","unstructured":"Foulds L. R. & Robinson, D. F. (1976) A strategy for solving the plant layout problem. Oper. Res. Q., 845\u2013855.","DOI":"10.2307\/3009168"},{"key":"2016083019142472000_cnw015v2.28","doi-asserted-by":"publisher","DOI":"10.1080\/00207547808929997"},{"key":"2016083019142472000_cnw015v2.29","doi-asserted-by":"crossref","first-page":"74.","DOI":"10.7155\/jgaa.00032","article-title":"Planarizing graphs\u2014a survey and annotated bibliography.","volume":"5","author":"Liebers","year":"2001","journal-title":"J. Graph Algorithms Appl."},{"key":"2016083019142472000_cnw015v2.30","doi-asserted-by":"crossref","unstructured":"Lengauer T. (1990) Combinatorial Algorithms for Integrated Circuit Layout. New York, NY, USA: Wiley.","DOI":"10.1007\/978-3-322-92106-2_3"},{"key":"2016083019142472000_cnw015v2.31","unstructured":"Song W.-M., Aste, T. & Di Matteo, T. (2007) Correlation-based biological networks. In Proceedings of International Symposium on Microelectronics, MEMS and Nanotechnology, Canberra, Australia, p. 680212."},{"key":"2016083019142472000_cnw015v2.32","doi-asserted-by":"crossref","unstructured":"Easley D. & Kleinberg J. (2010) Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge, New York, Melbourne, Madrid, Cape Town, Singapore, S\u00e3o Paulo, Delhi, Dubai, Tokyo, Mexico City: Cambridge University Press.","DOI":"10.1017\/CBO9780511761942"},{"key":"2016083019142472000_cnw015v2.33","unstructured":"Nishizeki T. & Chiba N. (2008) Planar Graphs: Theory and Algorithms. Dover Publications, INC, Mineola, New York: Elsevier."},{"key":"2016083019142472000_cnw015v2.34","doi-asserted-by":"publisher","DOI":"10.1145\/321850.321852"},{"key":"2016083019142472000_cnw015v2.35","unstructured":"Boyer J. M. & Myrvold, W. (2001) Simplified o(n) planarity algorithms. http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.8.6613. Accessed on 25 April 2016."},{"key":"2016083019142472000_cnw015v2.36","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"2016083019142472000_cnw015v2.37","first-page":"19.","article-title":"Submodular function maximization.","volume":"3","author":"Krause","year":"2012","journal-title":"Tractability: Practical Approaches to Hard Problems"},{"key":"2016083019142472000_cnw015v2.38","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.58.6368"},{"key":"2016083019142472000_cnw015v2.39","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.94.018702"},{"key":"2016083019142472000_cnw015v2.40","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0483(85)90074-X"},{"key":"2016083019142472000_cnw015v2.41","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.38.4.594"},{"key":"2016083019142472000_cnw015v2.42","unstructured":"Barfuss W., Massara G. P., Di Matteo, T. & Aste, T. (2015) Parsimonious Modelling with Information Filtering Networks. http:\/\/arxiv.org\/abs\/1602.07349. Accessed on 25 April 2016."},{"key":"2016083019142472000_cnw015v2.43","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.07.018"},{"key":"2016083019142472000_cnw015v2.44","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729694"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/5\/2\/161\/13794756\/cnw015.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T03:21:28Z","timestamp":1568085688000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article-lookup\/doi\/10.1093\/comnet\/cnw015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,21]]},"references-count":44,"alternative-id":["10.1093\/comnet\/cnw015"],"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnw015","relation":{},"ISSN":["2051-1310","2051-1329"],"issn-type":[{"value":"2051-1310","type":"print"},{"value":"2051-1329","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,21]]}}}