Pith. sign in

REVIEW 4 major objections 5 minor 1 cited by

Information Filtering Networks: Theoretical Foundations, Generative Methodologies, and Real-World Applications

T0 review · 4 major / 5 minor · reviewed 2026-08-16 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Sparse clique-tree graphs extract inverse-covariance structure without a tuning parameter.

desk verdict A competent, self-referential survey of the author's IFN line whose abstract overclaims accuracy over GLASSO based on an unproven subgraph assumption. read the letter →

arxiv 2505.03812 v1 pith:GWVQDBXU submitted 2025-05-02 cs.LG

Tomaso Aste This is my paper · ORCID
classification cs.LG MSC 05C8262H12
keywords InformationfilteringnetworkscliquetreeschordalgraphssparseinversecovarianceLoGographicalmodelsTMFGMFCF
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper argues that Information Filtering Networks (IFNs) are a general framework for multivariate modeling with global sparsity and locally dense cliques. Its strongest claim is that IFN-based estimation of the sparse inverse covariance matrix, the LoGo procedure, beats Graphical LASSO in accuracy and scalability because the network itself fixes where the non-zero entries sit, so no regularization parameter needs tuning. The chordal clique-tree structure also factorizes the joint probability into clique and separator factors exactly, which is what makes the local LoGo formula valid and fast inference possible. A sympathetic reader should care because the paper presents a parameter-free structural route to a problem normally solved by penalized likelihood, with applications from portfolio selection to neural network design.

What carries the argument

The load-bearing object is the clique tree, a chordal graph built by TMFG or MFCF moves: vertices are added inside an existing clique and connected to all its members, generating triangles and tetrahedra while preserving planarity in TMFG or arbitrary clique sizes in MFCF. Chordality guarantees that cliques and separators form a tree, and on that tree the probability factorization $p(x)=\prod_{c\in C}p_c(x_c)/\prod_{s\in S}p_s(x_s)$ holds exactly. This factorization is what turns the edge set into a sparse precision matrix via the LoGo formula, with each non-zero entry obtained by local clique and separator inversions, and it is what allows efficient inference.

What would settle it

Take a synthetic multivariate Gaussian with a known non-chordal conditional-dependence graph (for example a long cycle or a grid), build TMFG or MFCF from sample correlations, compute the LoGo precision, and compare its graph to the true graph and its out-of-sample likelihood to a tuned GLASSO at the same sparsity; if the IFN misses true edges that GLASSO recovers, or LoGo's log-likelihood is worse, the core accuracy claim is refuted for that regime.

Watch

Extended reading notes

Core claim

On the paper's own terms, the central discovery is that a chordal IFN, built greedily as a clique tree (MST, TMFG, or MFCF), is simultaneously a filtered view of the dependency structure and a computational engine for probabilistic modeling. The LoGo estimate $\mathbf{J}_{\mathrm{sp}}$ is assembled by summing inverse covariances computed locally on cliques and subtracting those on separators, so its zero pattern coincides with the IFN's edges; the paper claims this estimate is more accurate and more scalable than GLASSO's penalized likelihood solution, especially when observations are few and sparsity must be large. Because the IFN is chordal, the joint probability decomposes as a ratio of clique factors over separator factors, and this same decomposition yields the LoGo formula for any multivariate distribution with a defined covariance. The paper therefore claims that a single structural object carries dependency filtering, sparse precision estimation, regression, and deep-network architecture generation.

Load-bearing premise

The argument depends on the true conditional-dependency structure being contained in the IFN's edge set: exact conditional dependencies cannot be read off from marginal ones, and the paper assumes that in practice the genuine conditional graph is typically a subgraph of the clique-tree IFN; if that fails, LoGo's zero pattern is wrong and the claimed accuracy advantage over GLASSO collapses.

Editorial extensions

If this is right

  • If the accuracy claim holds, high-dimensional covariance selection no longer requires cross-validating a penalty parameter: the network topology itself selects the zero pattern.
  • LoGo sparse precisions can be dropped directly into Markowitz portfolios, multilinear regressions, and elliptical likelihoods, improving out-of-sample behavior when sample size is small.
  • IFN topologies supply interpretable adjacency priors for graph neural networks and define the wiring of Homological Neural Networks, reducing parameter counts while matching state-of-the-art accuracy.
  • The clique-tree factorization gives a nonparametric factorization of any joint distribution consistent with the graph, so the same construction applies beyond Gaussian data.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A quantitative falsification test suggests itself: on synthetic data with a known non-chordal conditional-dependence graph, compare LoGo's zero pattern and out-of-sample likelihood against a properly tuned GLASSO at matched sparsity.
  • The subgraph assumption in Section 6.2.1 implies LoGo should excel when the true conditional graph is near-chordal; in dense or highly non-chordal regimes, zero-pattern error may dominate its advantage.
  • The same clique and separator factorization could be adapted to nonparametric or copula-based densities, not just elliptical families, giving a topological prior for Bayesian structure learning.
  • HNN and HCNN architectures suggest a design principle: layer width and depth are prescribed by the clique complex of the data, which could be tested against randomly wired sparse networks at matched parameter counts.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 5 minor

Summary. The paper is a single-author review of Information Filtering Networks (IFNs), tracing their development from maximum spanning trees through PMFG, TMFG, and MFCF, and describing algorithms, ensemble/validation approaches, and applications in finance, biology, psychology, neuroscience, and deep learning. The theoretical sections cover composite-function motivation, chordal/clique-tree factorization, the LoGo sparse inverse covariance formula, elliptical distribution modeling, and the recently proposed HNN/HCNN architectures. The abstract and Section 6 argue that IFNs enable sparse inverse covariance estimation with greater accuracy and scalability than Graphical LASSO, and that IFN topologies provide interpretable higher-order priors for machine learning.

Significance. If the main claims were fully established, the review would make a useful case for chordal, clique-tree-based network filtering as a practical alternative to penalized likelihood methods, with the added benefit of interpretable topological priors and efficient local computation. The manuscript correctly states several standard results: Eq. (16) for clique-tree factorization, Eq. (11) for the LoGo precision estimator on a chordal graph, and the Gaussian mutual-information expression in Eq. (21). It also provides reproducible-code pointers (Section 5.6.1) and a broad application survey. However, the central practical claim of superiority over GLASSO rests on an unproven support-containment assumption in Section 6.2.1, and there are mathematical inaccuracies in the elliptical-distribution statements. The review is therefore informative as an overview of the author's research program, but its headline claim is not currently supported.

major comments (4)
  1. [§6.2.1 / §6.2.2] The claim that "it suffices for the exact conditional dependency structure to form a subgraph of the IFN" is load-bearing for the abstract's accuracy claim, and it is both unproven and logically insufficient. Equation (11) defines J_sp with zeros exactly on non-edges of the IFN, so the zero pattern of J_sp matches the true precision matrix only if the IFN's edge set coincides with the true conditional independence graph. If the true graph is a strict subgraph, the IFN contains extra edges and J_sp can place nonzeros where the true precision has zeros; if a true conditional edge is not in the IFN, J_sp has a false zero. No theorem or benchmark on known ground-truth precision matrices is supplied to establish that this is "typically achieved," and the local-density intuition does not rule out missing a conditional edge with low marginal weight or including a spurious edge with high marginal but zero partial correlation. This assumption must be substantiated or the accuracy claims must be weakened to match the hedged statement in Section 6.2.2 that LoGo "often excels" under large sparsity and small n.
  2. [§6.5.1] Equations (19) and (21) are stated for "the elliptical multivariate probability distribution class," but they are Gaussian mutual-information formulas. For a bivariate Student-t distribution with finite degrees of freedom nu, the mutual information between two components depends on nu and is not -1/2 log(1-rho^2); similarly, I(a;b) = 1/2 log(|Sigma_a||Sigma_b|/|Sigma_c|) does not hold for general elliptical distributions. The paper itself introduces the Student-t as an elliptical member in Section 6.5, so the formulas as stated are internally inconsistent. These equations should be restricted to the Gaussian case or replaced by the correct elliptical expressions.
  3. [§6.2.2] The statement "Unlike GLASSO, IFN-LoGos are parameter-free" is misleading because the IFN construction depends on free structural choices: Algorithm 5 has Min Cl, Max Cl, and Max Mult, Section 5.7.2 discusses the choice of gain function, and Sections 5.5 and 7.5.4 introduce bootstrap replica counts and edge-frequency thresholds. At most, LoGo avoids a penalty parameter; the structural hyperparameters should be acknowledged explicitly so that the comparison with GLASSO's regularization parameter is accurate.
  4. [§6.2.1] The sentence "This formula is valid for any multivariate distribution as long as the covariance is defined" is inaccurate. Equation (11) constructs a matrix with support equal to the IFN; it is the precision matrix of a Gaussian distribution whose covariance respects the clique/separator structure. For a non-Gaussian distribution, conditional independence does not generally correspond to zeros in the inverse covariance matrix, so J_sp is not generally the inverse covariance of the data-generating distribution. The universality claim should be corrected or carefully qualified.
minor comments (5)
  1. [§5.1] Algorithm 2 says it finds the edge with the "smallest weight" and Eq. (3) uses min, but the algorithm is for the maximum spanning tree; it should select the largest weight, consistent with Algorithm 1 and with the definition in the text.
  2. [§6.2.2] The abstract's "greater accuracy" claim is at odds with the paper's own report in Section 7.5.2, where GLASSO achieved the best overall performance in the FSST-GNN study and IFN filtering was "nearly equivalent" with lower complexity. The abstract and conclusions should be aligned with this hedged comparison.
  3. [§6.4] The statement that Eq. (16) is "a direct consequence of the Kolmogorov definition of conditional probability" is imprecise: the clique-tree factorization follows from the Markov property and positivity assumptions, not from the definition of conditional probability alone. This should be clarified.
  4. [Throughout] There are several typos and incomplete sentences, including "hipervertices" in the Figure 2 caption, "findngs" in Section 7.5, "t results" in Section 6.1, "determinat" in Section 6.5.1, "psycology" in Section 7.4, and reference errors such as "Oxford University Ppress" in reference [1] and "Prooceedings" in reference [72].
  5. [References] References [18] and [25] appear to cite the same paper (Massara, Di Matteo, and Aste, Journal of Complex Networks) with different years; this duplication should be resolved.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the LoGo construction is standard chordal-graph factorization, and the comparative claims are supported by external empirical benchmarks rather than by circular derivation.

full rationale

I find no circular step that reduces an output to an input by definition or by fitting. The core mathematical content of Section 6.2.1 is the standard clique-tree formula for the inverse covariance of a distribution factorizing over a chordal graph: Eq. (11) sums local inverses over cliques and separators, and Eq. (16) is the classical Lauritzen–Spiegelhalter factorization. These are not derived from the IFN in a way that presupposes the desired conclusion; they are standard graphical-model identities applied to a chosen sparse graph. The zero pattern of Jsp is, by construction, the IFN edge set, and the review explicitly treats the relation between the IFN and the true conditional-dependence structure as an approximation rather than a proven equivalence: it states that 'it suffices for the exact conditional dependency structure to form a subgraph of the IFN' and that this is 'typically achieved' (Section 6.2.1). That is a substantive, unproven modeling assumption and a genuine correctness risk, but it is not circular: the estimator is defined by the assumption and then compared with GLASSO on external benchmarks. The abstract's stronger claim of 'greater accuracy and scalability than Graphical LASSO' is not re-derived in this review; it is delegated to published empirical studies, several of which are by the author's group. Under the stated rules, externally falsifiable empirical benchmarks count as independent evidence, so this self-citation pattern does not by itself constitute circularity. The main weakness—the unproven subgraph containment assumption—belongs to correctness risk, not to circularity analysis, because the paper does not pretend to infer conditional independence structure from marginal information, nor does it define the IFN in terms of the very quantity it claims to predict.

Assumptions & free parameters 3 free parameters · 4 assumptions · 0 invented entities

No new empirical fits are presented; the review relies on previously published, mostly self-authored studies. Main assumptions are chordality and decomposability, the subgraph assumption for conditional dependence, elliptical distributional assumptions, and sparsity. Free parameters are user-selected in MFCF and in bootstrap procedures.

free parameters (3)
  • MFCF clique-size bounds (Min Cl, Max Cl, Max Mult) = user-specified, not fitted in this paper
    Algorithm 5 requires these parameters to set minimum and maximum clique size and separator multiplicity, controlling the trade-off between sparsity and density; they are chosen by the practitioner.
  • Gain function choice = mutual information or sum of squared correlations
    Sections 5.7.2 and 6.5.1: the construction maximizes a gain function; the sum-of-squared-correlations proxy assumes independence within groups and is an approximation. The choice affects the resulting graph.
  • Bootstrap replica count and edge frequency threshold = not specified in this review
    BootstrapNet and HLOB use a threshold on edge appearance frequency across replicas and a number of bootstrap replicas; these are hyperparameters described in the cited papers [22, 23].
assumptions (4)
  • standard math Chordal graphs admit factorization of the joint density over cliques and separators (Eq. 16) and the LoGo inverse covariance formula (Eq. 11).
    This is the standard decomposable graphical model theory from Lauritzen (1996), used throughout Section 6.
  • ad hoc to paper The true conditional independence graph is a subgraph of the IFN constructed from marginal dependencies.
    Section 6.2.1 states: 'it suffices for the exact conditional dependency structure to form a subgraph of the IFN. This is typically achieved...' This is an unproven working hypothesis, not a derived result.
  • domain assumption The data follow an elliptical multivariate distribution with well-defined covariance, so pairwise and group mutual information can be expressed through correlations and determinants (Eqs. 19-21).
    Section 6.5: the mutual information formulas and the LoGo approximation to the precision matrix rely on elliptical, typically Gaussian or Student-t, assumptions.
  • domain assumption The underlying dependency structure is sparse enough to be represented by a graph with a small number of edges.
    The entire IFN approach assumes sparsity; Section 5.7.3 acknowledges that sparsity is not universally valid and can exclude relevant links.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Information Filtering Networks: Theoretical Foundations, Generative Methodologies, and Real-World Applications." pith.science (2026). https://pith.science/paper/GWVQDBXU

@misc{pith2026250503812,
  author       = {Pith},
  title        = {Pith review of: Information Filtering Networks: Theoretical Foundations, Generative Methodologies, and Real-World Applications},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/GWVQDBXU}},
  note         = {Machine review of arXiv:2505.03812}
}
read the original abstract

Information Filtering Networks (IFNs) provide a powerful framework for modeling complex systems through globally sparse yet locally dense and interpretable structures that capture multivariate dependencies. This review offers a comprehensive account of IFNs, covering their theoretical foundations, construction methodologies, and diverse applications. Tracing their origins from early network-based models to advanced formulations such as the Triangulated Maximally Filtered Graph (TMFG) and the Maximally Filtered Clique Forest (MFCF), the paper highlights how IFNs address key challenges in high-dimensional data-driven modeling. IFNs and their construction methodologies are intrinsically higher-order networks that generate simplicial complexes-structures that are only now becoming popular in the broader literature. Applications span fields including finance, biology, psychology, and artificial intelligence, where IFNs improve interpretability, computational efficiency, and predictive performance. Special attention is given to their role in graphical modeling, where IFNs enable the estimation of sparse inverse covariance matrices with greater accuracy and scalability than traditional approaches like Graphical LASSO. Finally, the review discusses recent developments that integrate IFNs with machine learning and deep learning, underscoring their potential not only to bridge classical network theory with contemporary data-driven paradigms, but also to shape the architectures of deep learning models themselves.

Figures

Figures reproduced from arXiv: 2505.03812 by the authors.

Figure 1
Figure 1. Illustration of the network representation of the composible function f(x1, x2, x3, x4) = h [PITH_FULL_IMAGE:figures/full_fig_p006_1.png] view at source ↗
Figure 2
Figure 2. A simple example of a chordal graph made of 6 vertices, three cliques, and two separators. It is a clique tree, a hypergraph with the cliques as hipervertices, and the separators as hyperedges. Algorithm 4 TMFG Construction for the Maximum Weight Planar Graph Input. A p × p matrix of edge weights wi,j > 0. Initialize. Start with the triangle (u1, u2, u3) with the largest edge weight. Initialize. Set V ← {u1, u2, u3}… view at source ↗
Figure 3
Figure 3. Examples of MFCF networks constructed to maximize the sum of correlations squared. The three networks on the top are trees, while the three on the bottom are planar graphs. MFCF(2,2,1), has max and min clique sizes equal to 2, and separators can be used only once. The result can only be a line. MFCF(2,2,2), also has max and min clique sizes equal to 2, but vertices can have coordination up to three. MFCF(2,2,∞), is … view at source ↗
Figures from the paper (6 more)
Figure 4
Figure 4. Figure 4: A schematic representation of graphical modeling using clique tree representations. Two cliques from separate clique trees T1 and T2 are connected by merging the separators sa and sb into a new separator sc. The resulting global gain in mutual information is given by I…
Figure 5
Figure 5. Figure 5: An HNN layered deep architecture generated from an IFN made of a triangular clique and an attached edge. The HNN is approximating f(x1, x2, x3, x4) as composite function h [PITH_FULL_IMAGE:figures/full_fig_p030_5.png]
Figure 6
Figure 6. Figure 6: Another simple HNN architecture generated from a IFN made of a single triangular clique. This architecture was introduced in [21] with convolutional units and given the name of HCNN. . . P . C . . C . P . . . . . . . . . . P . . . . . . C . . C . . . . P C . . . . . . …
Figure 7
Figure 7. Figure 7: (a) An example of structural organization and clustering from the PMFG structure from correlations between log-returns of 400 qualities of the S&P500 observed over the period between 1996-2009 (see [74] for details). (b) An example of portfolio selection from a PMFG ne…
Figure 8
Figure 8. Figure 8: PMFG network and cluster structure for 96 malignant and normal lymphocyte samples from [98]. The labels inside the symbols indicate the sample types, as detailed in the legend. The DBHT technique identifies 11 distinct sample clusters, represented by different symbols.…
Figure 9
Figure 9. Figure 9: TMFG structure from 60 × 60 WSS-SF endorsement association matrix computed form a psycometric survey of 5,831 participants (see [111]). 7.4. IFNs for Psychology and Neurosciences In psychology, IFNs have proven to be powerful tools for analyzing complex relationships w…

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. The Extremity Premium: Sentiment Regimes and Adverse Selection in Cryptocurrency Markets

    q-fin.ST 2026-02 reject novelty 5.0 of 10

    Extreme sentiment regimes show higher estimated spreads and uncertainty than neutral ones in Bitcoin data, but the effect is sensitive to controls and overlaps mechanically with volatility.

Reference graph

Works this paper leans on

128 extracted references · 73 canonical work pages · cited by 1 Pith paper

  1. [1]

    Networks

    Mark Newman. Networks. Oxford University Ppress, 2018

    2018

  2. [2]

    Networks beyond pairwise interactions: Structure and dynamics

    Federico Battiston, Giulia Cencetti, Iacopo Iacopini, Vito Latora, Maxime Lucas, Alice Patania, Jean-Gabriel Young, and Giovanni Petri. Networks beyond pairwise interactions: Structure and dynamics. Physics Reports, 874:1–92, 2020

    2020

  3. [3]

    What are higher- order networks? SIAM Review, 65(3):686–731, 2023

    Christian Bick, Elizabeth Gross, Heather A Harrington, and Michael T Schaub. What are higher- order networks? SIAM Review, 65(3):686–731, 2023

    2023

  4. [4]

    Social networks

    J Clyde Mitchell. Social networks. Annual Review of Anthropology, 3:279–299, 1974

    1974

  5. [5]

    Biological networks

    Eric Alm and Adam P Arkin. Biological networks. Current opinion in structural biology , 13(2):193–202, 2003

    2003

  6. [6]

    The economics of networks

    Nicholas Economides. The economics of networks. International journal of industrial organization, 14(6):673–699, 1996

    1996

  7. [7]

    inside” and “outside,

    Applications of IFNs Initially introduced for modeling financial systems as complex, interrelated structures [46, 12], IFNs have primarily been applied within this domain. However, under the broader framework of complex systems modeling, recent years have witnessed a rapid expansion of their applications across a much wider range of fields. Information Fi...

    1996

  8. [8]

    Conclusions This review has examined the theoretical, algorithmic, and practical foundations of Information Filtering Networks (IFNs), underscoring their relevance for modeling complex systems through sparse, interpretable structures. By capturing the underlying dependency architecture in high-dimensional data, IFNs serve as effective tools for filtering ...

    2018

Show all 128 references
  1. [9]

    A mathematical theory of communication

    Claude Elwood Shannon. A mathematical theory of communication. The Bell system technical journal, 27(3):379–423, 1948

    1948

  2. [10]

    Probabilistic Data-Driven Modeling

    Tomaso Aste. Probabilistic Data-Driven Modeling. Cambridge University Press, 2025

    2025

  3. [11]

    Complexity: A very short introduction

    John H Holland. Complexity: A very short introduction . OUP Oxford, 2014

    2014

  4. [12]

    Modeling complex systems, volume 1

    Nino Boccara and Nine Boccara. Modeling complex systems, volume 1. Springer, 2010

    2010

  5. [13]

    Complex networks on hyperbolic surfaces

    Tomaso Aste, Tiziana Di Matteo, and ST Hyde. Complex networks on hyperbolic surfaces. Physica A: Statistical Mechanics and its Applications , 346(1-2):20–26, 2005

    2005

  6. [14]

    Mantegna

    Michele Tumminello, Tomaso Aste, Tiziana Di Matteo, and Rosario N. Mantegna. A tool for filtering information in complex systems. Proceedings of the National Academy of Sciences , 102(30):10421–10426, 2005

    2005

  7. [15]

    Interest rates hierarchical structure

    Tiziana Di Matteo, Tomaso Aste, ST Hyde, and Stuart Ramsden. Interest rates hierarchical structure. Physica A: Statistical Mechanics and its Applications , 355(1):21–33, 2005

    2005

  8. [16]

    Centrality and peripherality in filtered graphs from dynamical financial correlations

    Francesco Pozzi, Tiziana Di Matteo, and Tomaso Aste. Centrality and peripherality in filtered graphs from dynamical financial correlations. Advances in Complex Systems , 11(06):927–950, 2008

    2008

  9. [17]

    Spread of risk across financial markets: better to invest in the peripheries

    Francesco Pozzi, Tiziana Di Matteo, and Tomaso Aste. Spread of risk across financial markets: better to invest in the peripheries. Scientific reports, 3(1):1665, 2013

    2013

  10. [18]

    Local computations with probabilities on graphical structures and their application to expert systems

    Steffen L Lauritzen and David J Spiegelhalter. Local computations with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society: Series B (Methodological), 50(2):157–194, 1988

    1988

  11. [19]

    Parsimonious modeling with information filtering networks

    Wolfram Barfuss, Guido Previde Massara, Tiziana Di Matteo, and Tomaso Aste. Parsimonious modeling with information filtering networks. Physical Review E, 94(6):062306, 2016

    2016

  12. [20]

    Network filtering for big data: triangulated maximally filtered graph

    Guido Previde Massara, Tiziana Di Matteo, and Tomaso Aste. Network filtering for big data: triangulated maximally filtered graph. Journal of Complex Networks , 5(2):161–178, 2017

    2017

  13. [21]

    Lauritzen

    Steffen L. Lauritzen. Graphical Models. Oxford University Press, 1996

    1996

  14. [22]

    Solvable model of a spin-glass

    David Sherrington and Scott Kirkpatrick. Solvable model of a spin-glass. Physical review letters, 35(26):1792, 1975

    1975

  15. [23]

    Homological convolutional neural networks

    Antonio Briola, Yuanrong Wang, Silvia Bartolucci, and Tomaso Aste. Homological convolutional neural networks. arXiv preprint arXiv:2308.13816 , 2023

    2023 arXiv

  16. [24]

    Homological neural networks: A sparse architecture for multivariate complexity

    Yuanrong Wang, Antonio Briola, and Tomaso Aste. Homological neural networks: A sparse architecture for multivariate complexity. In Topological, Algebraic and Geometric Learning Workshops 2023, pages 228–241. PMLR, 2023

    2023

  17. [25]

    Hlob–information persistence and structure in limit order books

    Antonio Briola, Silvia Bartolucci, and Tomaso Aste. Hlob–information persistence and structure in limit order books. arXiv preprint arXiv:2405.18938 , 2024

    2024 arXiv

  18. [26]

    Simplicial complexes and complex systems

    Vsevolod Salnikov, Daniele Cassese, and Renaud Lambiotte. Simplicial complexes and complex systems. European Journal of Physics , 40(1):014001, 2018

    2018

  19. [27]

    Massara, Tiziana Di Matteo, and Tomaso Aste

    Guido P. Massara, Tiziana Di Matteo, and Tomaso Aste. Network filtering for big data: Triangulated maximally filtered graph. Journal of Complex Networks , 5(2):161–178, 2016

    2016

  20. [29]

    Higher-Order Networks: An Introduction to Simplicial Complexes

    Ginestra Bianconi. Higher-Order Networks: An Introduction to Simplicial Complexes . Information Filtering Networks 44 Cambridge University Press, 2021

    2021

  21. [30]

    Topological analysis of data

    Alice Patania, Francesco Vaccarino, and Giovanni Petri. Topological analysis of data. EPJ Data Science, 6(1):1–6, 2017

    2017

  22. [31]

    Information geometry and its applications , volume 194

    Shun-ichi Amari. Information geometry and its applications , volume 194. Springer, 2016

    2016

  23. [32]

    Homological scaffolds of brain functional networks

    Giovanni Petri, Paul Expert, Federico Turkheimer, Robin Carhart-Harris, David Nutt, Peter J Hellyer, and Francesco Vaccarino. Homological scaffolds of brain functional networks. Journal of The Royal Society Interface , 11(101):20140873, 2014

    2014

  24. [33]

    C. W. J. Granger. Investigating causal relations by econometric models and cross-spectral methods. Econometrica, 37(3):424–438, 1969

    1969

  25. [34]

    Causality: Models, Reasoning, and Inference

    Judea Pearl. Causality: Models, Reasoning, and Inference . Cambridge University Press, 2000

    2000

  26. [35]

    Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference

    Judea Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference . Morgan Kaufmann, San Francisco, 1988

    1988

  27. [36]

    Network granger causality with inherent grouping structure

    Sumanta Basu, Ali Shojaie, and George Michailidis. Network granger causality with inherent grouping structure. The Journal of Machine Learning Research , 16(1):417–453, 2015

    2015

  28. [37]

    Transfer entropy as a measure of brain connectivity: A critical analysis with the help of neural mass models

    Mauro Ursino, Giulia Ricci, and Elisa Magosso. Transfer entropy as a measure of brain connectivity: A critical analysis with the help of neural mass models. Frontiers in computational neuroscience, 14:45, 2020

    2020

  29. [38]

    Approximation theory and methods

    Michael James David Powell. Approximation theory and methods . Cambridge University Press, 1981

    1981

  30. [39]

    Approximation theory and approximation practice, extended edition

    Lloyd N Trefethen. Approximation theory and approximation practice, extended edition . SIAM, 2019

    2019

  31. [40]

    One-variable calculus, with an introduction to linear algebra, volume 1

    Tom M Apostol. One-variable calculus, with an introduction to linear algebra, volume 1. Blaisdell Waltham, Toronto, London, 1967

    1967

  32. [41]

    Networks for approximation and learning

    Tomaso Poggio and Federico Girosi. Networks for approximation and learning. Proceedings of the IEEE, 78(9):1481–1497, 1990

    1990

  33. [42]

    Why and when can deep-but not shallow-networks avoid the curse of dimensionality: a review

    Tomaso Poggio, Hrushikesh Mhaskar, Lorenzo Rosasco, Brando Miranda, and Qianli Liao. Why and when can deep-but not shallow-networks avoid the curse of dimensionality: a review. International Journal of Automation and Computing , 14(5):503–519, 2017

    2017

  34. [43]

    Shortest connection networks and some generalizations

    Robert Clay Prim. Shortest connection networks and some generalizations. The Bell System Technical Journal, 36(6):1389–1401, 1957

    1957

  35. [44]

    Correlation and causation

    Sewall Wright. Correlation and causation. Journal of Agricultural Research, 20(7):557–585, 1921

    1921

  36. [45]

    L. L. Thurstone. Multiple factor analysis. Psychological Review, 38(5):406–427, 1931

    1931

  37. [46]

    J. N. Darroch, S. L. Lauritzen, and T. P. Speed. Markov fields and log-linear interaction models for contingency tables. Annals of Statistics , 8(3):522–539, 1980

    1980

  38. [47]

    Estimation of principal components and related models by iterative least squares

    Herman Wold. Estimation of principal components and related models by iterative least squares. In P. R. Krishnaiah, editor, Multivariate Analysis, pages 391–420. Academic Press, 1966

    1966

  39. [48]

    Mantegna

    Rosario N. Mantegna. Hierarchical structure in financial markets. The European Physical Journal B, 11(1):193–197, 1999

    1999

  40. [49]

    Tomaso Aste, Tiziana Di Matteo, and Stuart T. Hyde. Complex networks on hyperbolic surfaces. Physica A: Statistical Mechanics and its Applications , 346:20–26, 2005

    2005

  41. [50]

    Exploring complex networks via topological embedding on surfaces

    Tomaso Aste, Ruggero Gramatica, and Tiziana Di Matteo. Exploring complex networks via topological embedding on surfaces. Physical Review E—Statistical, Nonlinear, and Soft Matter Physics, 86(3):036109, 2012

    2012

  42. [51]

    Kenett, Michele Tumminello, Assaf Madi, Gabriele Gur-Gershgoren, Rosario N

    Dror Y. Kenett, Michele Tumminello, Assaf Madi, Gabriele Gur-Gershgoren, Rosario N. Mantegna, and Eshel Ben-Jacob. Dominating clasp of the financial sector revealed by partial correlation analysis of the stock market. PLoS ONE, 5(12):e15032, 2010

    2010

  43. [52]

    Stefano Boccaletti, Vito Latora, Yamir Moreno, Martin Chavez, and D.-U. Hwang. Complex networks: Structure and dynamics. Physics Reports, 424(4–5):175–308, 2006

    2006

  44. [53]

    Towards computing homology from finite approximations

    Vanessa Robins. Towards computing homology from finite approximations. In Proceedings of the International Conference on Intelligent Robots and Systems (IROS) , pages 175–182, 1999

    1999

  45. [54]

    Topological persistence and Information Filtering Networks 45 simplification

    Herbert Edelsbrunner, David Letscher, and Afra Zomorodian. Topological persistence and Information Filtering Networks 45 simplification. Discrete & Computational Geometry , 28(4):511–533, 2002

    2002

  46. [55]

    Chung, Bung-Nyun Kim, and Dong Soo Lee

    Hyekyoung Lee, Hyejin Kang, Moo K. Chung, Bung-Nyun Kim, and Dong Soo Lee. Persistent brain network homology from the perspective of dendrogram. IEEE Transactions on Medical Imaging, 31(12):2267–2277, 2012

    2012

  47. [56]

    Hellyer, and Francesco Vaccarino

    Giovanni Petri, Paul Expert, Federico Turkheimer, Robin Carhart-Harris, David Nutt, Peter J. Hellyer, and Francesco Vaccarino. Homological scaffolds of brain functional networks. Journal of The Royal Society Interface , 11(101):20140873, 2014

    2014

  48. [57]

    Models, reasoning and inference

    Judea Pearl. Models, reasoning and inference. Cambridge, UK: CambridgeUniversityPress , 19, 2000

    2000

  49. [58]

    Ojist´ em probl´ emu minim´ aln´ ım.Acta Societatis Scientiarum Naturalium Moravicae, 3(3):1–22, 1926

    Otakar Boruvka. Ojist´ em probl´ emu minim´ aln´ ım.Acta Societatis Scientiarum Naturalium Moravicae, 3(3):1–22, 1926

    1926

  50. [59]

    Otakar Boruvka on minimum spanning tree problem translation of both the 1926 papers, comments, history

    Jaroslav Neˇ setˇ ril, Eva Milkov´ a, and Helena Neˇ setˇ rilov´ a. Otakar Boruvka on minimum spanning tree problem translation of both the 1926 papers, comments, history. Discrete Mathematics, 233(1–3):3–36, 2001

    1926

  51. [60]

    A minimum spanning tree algorithm with inverse-Ackermann type complexity

    Bernard Chazelle. A minimum spanning tree algorithm with inverse-Ackermann type complexity. Journal of the ACM , 47(6):1028–1047, 2000

    2000

  52. [61]

    Planar graphs

    Hassler Whitney. Planar graphs. In Hassler Whitney Collected Papers, pages 135–146. Springer, 1933

    1933

  53. [62]

    Sur le probleme des courbes gauches en topologie

    Casimir Kuratowski. Sur le probleme des courbes gauches en topologie. Fundamenta Mathematicae, 15(1):271–283, 1930

    1930

  54. [63]

    Software tools repository for the financial computing and analytics group UCL, https://github.com/FinancialComputingUCL, 2024

    T Aste, G Massara, A Briola, and R Wang. Software tools repository for the financial computing and analytics group UCL, https://github.com/FinancialComputingUCL, 2024. [Accessed 10 July 2024]

    2024

  55. [64]

    Learning clique forests

    Guido Previde Massara and Tomaso Aste. Learning clique forests. arXiv preprint arXiv:1905.02266, 2019

    1905 arXiv

  56. [65]

    Exponential smoothing weighted correlations

    Francesco Pozzi, Tiziana Di Matteo, and Tomaso Aste. Exponential smoothing weighted correlations. The European Physical Journal B , 85(6):1–21, 2012

    2012

  57. [66]

    Forecasting market states

    Pier Francesco Procacci and Tomaso Aste. Forecasting market states. In Machine Learning and AI in Finance , pages 44–51. Routledge, 2021

    2021

  58. [67]

    Parallel filtered graphs for hierarchical clustering

    Shangdi Yu and Julian Shun. Parallel filtered graphs for hierarchical clustering. In 2023 IEEE 39th International Conference on Data Engineering (ICDE) , pages 1967–1980. IEEE, 2023

    2023

  59. [68]

    Faster parallel triangular maximally filtered graphs and hierarchical clustering

    Steven Raphael and Julian Shun. Faster parallel triangular maximally filtered graphs and hierarchical clustering. arXiv preprint arXiv:2408.09399 , 2024

    2024 arXiv

  60. [69]

    Topological feature selection

    Antonio Briola and Tomaso Aste. Topological feature selection. In Topological, Algebraic and Geometric Learning Workshops 2023 , pages 534–556. PMLR, 2023

    2023

  61. [70]

    Covariance selection

    Arthur P Dempster. Covariance selection. Biometrics, pages 157–175, 1972

    1972

  62. [71]

    Sparse inverse covariance estimation with the graphical lasso

    Jerome Friedman, Trevor Hastie, and Robert Tibshirani. Sparse inverse covariance estimation with the graphical lasso. Biostatistics, 9(3):432–441, 2008

    2008

  63. [72]

    Topological regularization with information filtering networks

    Tomaso Aste. Topological regularization with information filtering networks. Information Sciences, 608:655–669, 2022

    2022

  64. [73]

    Symmetric multivariate and related distributions

    Kai Wang Fang. Symmetric multivariate and related distributions . CRC Press, 2018

    2018

  65. [74]

    On the generalized distance in statistics

    Prasanta Chandra Mahalanobis. On the generalized distance in statistics. Prooceedings of the National Institute of Science of India , 2:49–55, 1936

    1936

  66. [75]

    Network filtering of spatial-temporal gnn for multivariate time-series prediction

    Yuanrong Wang and Tomaso Aste. Network filtering of spatial-temporal gnn for multivariate time-series prediction. In Proceedings of the Third ACM International Conference on AI in Finance, pages 463–470, 2022

    2022

  67. [76]

    Relation between financial market structure and the real economy: comparison between clustering methods

    Nicolo Musmeci, Tomaso Aste, and Tiziana Di Matteo. Relation between financial market structure and the real economy: comparison between clustering methods. PloS one , 10(3):e0116201, 2015

    2015

  68. [77]

    A network perspective of the stock market

    K Tse Chi, Jing Liu, and Francis CM Lau. A network perspective of the stock market. Journal of Empirical Finance, 17(4):659–667, 2010. Information Filtering Networks 46

    2010

  69. [78]

    The physics of financial networks

    Marco Bardoscia, Paolo Barucca, Stefano Battiston, Fabio Caccioli, Giulio Cimini, Diego Garlaschelli, Fabio Saracco, Tiziano Squartini, and Guido Caldarelli. The physics of financial networks. Nature Reviews Physics, 3(7):490–507, 2021

    2021

  70. [79]

    A survey of the application of graph-based approaches in stock market analysis and prediction

    Suman Saha, Junbin Gao, and Richard Gerlach. A survey of the application of graph-based approaches in stock market analysis and prediction. International Journal of Data Science and Analytics, 14(1):1–15, 2022

    2022

  71. [80]

    The use of dynamical networks to detect the hierarchical organization of financial market sectors

    Tiziana Di Matteo, Francesca Pozzi, and Tomaso Aste. The use of dynamical networks to detect the hierarchical organization of financial market sectors. The European Physical Journal B , 73:3–11, 2010

    2010

  72. [81]

    The multiplex dependency structure of financial markets

    Nicol´ o Musmeci, Vincenzo Nicosia, Tomaso Aste, Tiziana Di Matteo, and Vito Latora. The multiplex dependency structure of financial markets. Complexity, 2017(1):9586064, 2017

    2017

  73. [82]

    Interplay between past market correlation structure changes and future volatility outbursts

    Nicol´ o Musmeci, Tomaso Aste, and Tiziana Di Matteo. Interplay between past market correlation structure changes and future volatility outbursts. Scientific Reports, 6(1):36320, 2016

    2016

  74. [83]

    Anatomy of a stablecoin’s failure: The terra-luna case

    Antonio Briola, David Vidal-Tom´ as, Yuanrong Wang, and Tomaso Aste. Anatomy of a stablecoin’s failure: The terra-luna case. Finance Research Letters, 51:103358, 2023

    2023

  75. [84]

    Risk diversification: a study of persistence with a filtered correlation-network approach

    Nicol´ o Musmeci, Tomaso Aste, and Tiziana Di Matteo. Risk diversification: a study of persistence with a filtered correlation-network approach. Journal of Network Theory in Finance, 1(1):1–22, 2015

    2015

  76. [85]

    Correlation structure and dynamics in volatile markets

    Tomaso Aste, William Shaw, and Tiziana Di Matteo. Correlation structure and dynamics in volatile markets. New Journal of Physics , 12(8):085009, 2010

    2010

  77. [86]

    Market structure dynamics during covid-19 outbreak

    Pier Francesco Procacci, Carolyn E Phelan, and Tomaso Aste. Market structure dynamics during covid-19 outbreak. arXiv preprint arXiv:2003.10922 , 2020

    2003 arXiv

  78. [87]

    Stress testing and systemic risk measures using elliptical conditional multivariate probabilities

    Tomaso Aste. Stress testing and systemic risk measures using elliptical conditional multivariate probabilities. Journal of Risk and Financial Management , 14(5):213, 2021

    2021

  79. [88]

    Quantifying impact and response in markets using information filtering networks

    Isobel Seabrook, Fabio Caccioli, and Tomaso Aste. Quantifying impact and response in markets using information filtering networks. Journal of Physics: Complexity , 3(2):025004, 2022

    2022

  80. [89]

    Sector neutral portfolios: Long memory motifs persistence in market structure dynamics

    Jeremy D Turiel and Tomaso Aste. Sector neutral portfolios: Long memory motifs persistence in market structure dynamics. In Complex Networks and Their Applications VIII: Volume 2 Proceedings of the Eighth International Conference on Complex Networks and Their Applications COMP...

    2019

  81. [90]

    Portfolio optimization with sparse multivariate modeling

    Pier Francesco Procacci and Tomaso Aste. Portfolio optimization with sparse multivariate modeling. Journal of Asset Management , 23(6):445–465, 2022

    2022

  82. [91]

    Dynamic portfolio optimization with inverse covariance clustering

    Yuanrong Wang and Tomaso Aste. Dynamic portfolio optimization with inverse covariance clustering. Expert Systems with Applications , 213:118739, 2023

    2023

  83. [92]

    Topological portfolio selection and optimization

    Yuanrong Wang, Antonio Briola, and Tomaso Aste. Topological portfolio selection and optimization. In Proceedings of the Fourth ACM International Conference on AI in Finance , pages 681–688, 2023

    2023

  84. [93]

    Cryptocurrency market structure: connecting emotions and economics

    Tomaso Aste. Cryptocurrency market structure: connecting emotions and economics. Digital Finance, 1(1):5–21, 2019

    2019

  85. [94]

    Dependency structures in cryptocurrency market from high to low frequency

    Antonio Briola and Tomaso Aste. Dependency structures in cryptocurrency market from high to low frequency. Entropy, 24(11):1548, 2022

    2022

  86. [95]

    Davide Stocco, Tomaso Aste, Emilio Barucci, and Maxime L.D. Nicolas. Resilience of market returns around esg controversies: Insights from the S&P100

  87. [96]

    Predicting future stock market structure by combining social and financial network information

    Th´ arsis TP Souza and Tomaso Aste. Predicting future stock market structure by combining social and financial network information. Physica A: Statistical Mechanics and its Applications, 535:122343, 2019

    2019

  88. [97]

    Simplicial persistence of financial markets: Filtering, generative processes and structural risk

    Jeremy Turiel, Paolo Barucca, and Tomaso Aste. Simplicial persistence of financial markets: Filtering, generative processes and structural risk. Entropy, 24(10):1482, 2022

    2022

  89. [98]

    Markowitz

    H.M. Markowitz. Portfolio selection. The Journal of Finance , 7:77–91, 1952

    1952

  90. [99]

    Portfolio selection

    Harry M Markowitz. Portfolio selection. Yale University Press, 1968

    1968

  91. [100]

    Distinct types of diffuse large b-cell lymphoma identified by gene expression profiling

    Ash A Alizadeh, Michael B Eisen, R Eric Davis, Chi Ma, Izidore S Lossos, Andreas Rosenwald, Information Filtering Networks 47 Jennifer C Boldrick, Hajeer Sabet, Truc Tran, Xin Yu, et al. Distinct types of diffuse large b-cell lymphoma identified by gene expression profiling. N...

    2000

  92. [101]

    Nested hierarchies in planar graphs

    Won-Min Song, Tiziana Di Matteo, and Tomaso Aste. Nested hierarchies in planar graphs. Discrete Applied Mathematics, 159(17):2135–2146, 2011

    2011

  93. [102]

    Hierarchical information clustering by means of topologically embedded graphs

    Won-Min Song, Tiziana Di Matteo, and Tomaso Aste. Hierarchical information clustering by means of topologically embedded graphs. PloS one, 7(3):e31929, 2012

    2012

  94. [103]

    Simplex2Vec embeddings for community detection in simplicial complexes

    Jacob Charles Wright Billings, Mirko Hu, Giulia Lerda, Alexey N Medvedev, Francesco Mottes, Adrian Onicas, Andrea Santoro, and Giovanni Petri. Simplex2Vec embeddings for community detection in simplicial complexes. arXiv preprint arXiv:1906.09068 , 2019

    1906 arXiv

  95. [104]

    Multiscale embedded gene co-expression network analysis

    Won-Min Song and Bin Zhang. Multiscale embedded gene co-expression network analysis. PLoS computational biology, 11(11):e1004574, 2015

    2015

  96. [105]

    The landscape of human tissue and cell type specific expression and co-regulation of senescence genes

    Peng Xu, Minghui Wang, Won-min Song, Qian Wang, Guo-Cheng Yuan, Peter H Sudmant, Habil Zare, Zhidong Tu, Miranda E Orr, and Bin Zhang. The landscape of human tissue and cell type specific expression and co-regulation of senescence genes. Molecular neurodegeneration, 17:1–20, 2022

    2022

  97. [106]

    Hiscf: leveraging higher-order structures for clustering analysis in biological networks

    Lun Hu, Jun Zhang, Xiangyu Pan, Hong Yan, and Zhu-Hong You. Hiscf: leveraging higher-order structures for clustering analysis in biological networks. Bioinformatics, 37(4):542–550, 2021

    2021

  98. [107]

    Donges, Yong Zou, Norbert Marwan, and J¨ urgen Kurths

    Jonathan F. Donges, Yong Zou, Norbert Marwan, and J¨ urgen Kurths. The backbone of the climate network. Europhysics Letters (EPL), 87(4):48007, 2009

    2009

  99. [108]

    Rainfall dynamics in an ecologically vulnerable area using applied algebraic topology methods

    Miroslav Andjelkovi´ c, Slobodan Maleti´ c, Tatijana Stosic, and Borko Stosic. Rainfall dynamics in an ecologically vulnerable area using applied algebraic topology methods. Chaos, Solitons & Fractals, 182:114782, 2024

    2024

  100. [109]

    Emergence of scaling in random networks.Science, 286(5439):509–512, 1999

    Albert-L´ aszl´ o Barab´ asi and R´ eka Albert. Emergence of scaling in random networks.Science, 286(5439):509–512, 1999

    1999

  101. [110]

    Complex network analysis of teaching practices

    Woon Peng Goh, Dennis Kwek, David Hogan, and Siew Ann Cheong. Complex network analysis of teaching practices. EPJ Data Science , 3:1–16, 2014

    2014

  102. [111]

    Temporal and spatial correlation patterns of air pollutants in chinese cities

    Yue-Hua Dai and Wei-Xing Zhou. Temporal and spatial correlation patterns of air pollutants in chinese cities. PloS one, 12(8):e0182724, 2017

    2017

  103. [112]

    Modeling latent topics in social media using dynamic exploratory graph analysis: The case of the right-wing and left-wing trolls in the 2016 us elections

    Hudson Golino, Alexander P Christensen, Robert Moulder, Seohyun Kim, and Steven M Boker. Modeling latent topics in social media using dynamic exploratory graph analysis: The case of the right-wing and left-wing trolls in the 2016 us elections. Psychometrika, pages 1–32, 2022

    2016

  104. [113]

    Network structure of the wisconsin schizotypy scales–short forms: Examining psychometric network filtering approaches

    Alexander P Christensen, Yoed N Kenett, Tomaso Aste, Paul J Silvia, and Thomas R Kwapil. Network structure of the wisconsin schizotypy scales–short forms: Examining psychometric network filtering approaches. Behavior Research Methods, 50:2531–2550, 2018

    2018

  105. [114]

    Disrupted modularity and local connectivity of brain functional networks in childhood-onset schizophrenia

    Aaron F Alexander-Bloch, Nitin Gogtay, David Meunier, Rasmus Birn, Liv Clasen, Francois Lalonde, Rhoshel Lenroot, Jay Giedd, and Edward T Bullmore. Disrupted modularity and local connectivity of brain functional networks in childhood-onset schizophrenia. Frontiers in systems n...

    2010

  106. [115]

    How semantic memory structure and intelligence contribute to creative thought: A network science approach

    Mathias Benedek, Yoed N Kenett, Konstantin Umdasch, David Anaki, Miriam Faust, and Aljoscha C Neubauer. How semantic memory structure and intelligence contribute to creative thought: A network science approach. Thinking & Reasoning, 23(2):158–183, 2017

    2017

  107. [116]

    Christensen, Hudson Golino, and Paul J

    Alexander P. Christensen, Hudson Golino, and Paul J. Silvia. A psychometric network perspective on the validity and validation of personality trait questionnaires. European Journal of Personality, 34(6):1095–1108, 2018

    2018

  108. [117]

    Comparing community detection algorithms in psychometric networks: A monte carlo simulation

    Alexander P Christensen, Luis Eduardo Garrido, Kiero Guerra-Pe˜ na, and Hudson Golino. Comparing community detection algorithms in psychometric networks: A monte carlo simulation. Behavior Research Methods, 56(3):1485–1505, 2024

    2024

  109. [118]

    Estimating the stability of psychological dimensions via bootstrap exploratory graph analysis: A monte carlo simulation and tutorial

    Alexander P Christensen and Hudson Golino. Estimating the stability of psychological dimensions via bootstrap exploratory graph analysis: A monte carlo simulation and tutorial. Psych, 3(3):479–500, 2021

    2021

  110. [119]

    Psychological and neural responses to architectural interiors

    Alexander Coburn, Oshin Vartanian, Yoed N Kenett, Marcos Nadal, Franziska Hartung, Information Filtering Networks 48 Gregor Hayn-Leichsenring, Gorka Navarrete, Jos´ e L Gonz´ alez-Mora, and Anjan Chatterjee. Psychological and neural responses to architectural interiors. Cortex...

    2020

  111. [120]

    Investigating the structure of semantic networks in low and high creative persons

    Yoed N Kenett, David Anaki, and Miriam Faust. Investigating the structure of semantic networks in low and high creative persons. Frontiers in human neuroscience, 8:407, 2014

    2014

  112. [121]

    Simulated visual hallucinations in virtual reality enhance cognitive flexibility.Scientific reports, 12(1):4027, 2022

    Clara Rastelli, Antonino Greco, Yoed N Kenett, Chiara Finocchiaro, and Nicola De Pisapia. Simulated visual hallucinations in virtual reality enhance cognitive flexibility.Scientific reports, 12(1):4027, 2022

    2022

  113. [122]

    Mapping the creative personality: A psychometric network analysis of highly creative artists and scientists

    Qunlin Chen, Alexander P Christensen, Yoed N Kenett, Zhiting Ren, David M Condon, Robert M Bilder, Jiang Qiu, and Roger E Beaty. Mapping the creative personality: A psychometric network analysis of highly creative artists and scientists. Creativity Research Journal, 35(3):455–...

    2023

  114. [123]

    Aesthetic emotions are affected by context: a psychometric network analysis

    Yoed N Kenett, Eileen R Cardillo, Alexander P Christensen, and Anjan Chatterjee. Aesthetic emotions are affected by context: a psychometric network analysis. Scientific Reports , 13(1):20985, 2023

    2023

  115. [124]

    Increasing outcome measurement precision: Network analysis of items on the outcome questionnaire-45

    Tim Kaiser, David M Erekson, and Benjamin M Ogles. Increasing outcome measurement precision: Network analysis of items on the outcome questionnaire-45. Psychotherapy, 2024

    2024

  116. [125]

    A topological criterion for filtering information in complex brain networks

    Fabrizio De Vico Fallani, Vito Latora, and Mario Chavez. A topological criterion for filtering information in complex brain networks. PLoS computational biology, 13(1):e1005305, 2017

    2017

  117. [126]

    Networktoolbox: Methods and measures for brain, cognitive, and psychometric network analysis in r

    Alexander P Christensen. Networktoolbox: Methods and measures for brain, cognitive, and psychometric network analysis in r. R J., 10(2):422, 2018

    2018

  118. [127]

    Toward reliable network neuroscience for mapping individual differences

    Chao Jiang, Richard Betzel, Ye He, Yin-Shan Wang, Xiu-Xia Xing, and Xi-Nian Zuo. Toward reliable network neuroscience for mapping individual differences. bioRxiv, 2021:442886, 2021

    2021

  119. [128]

    Unveiling the cognitive network organization through cognitive performance.Scientific Reports, 14(1):11645, 2024

    Anna Borne, C Lemaitre, Christine Bulteau, Monica Baciu, and Marcela Perrone-Bertolotti. Unveiling the cognitive network organization through cognitive performance.Scientific Reports, 14(1):11645, 2024

    2024

  120. [129]

    Graph theory enables drug repurposing–how a mathematical model can drive the discovery of hidden mechanisms of action

    Ruggero Gramatica, Tiziana Di Matteo, Stefano Giorgetti, Massimo Barbiani, Dorian Bevec, and Tomaso Aste. Graph theory enables drug repurposing–how a mathematical model can drive the discovery of hidden mechanisms of action. PloS one, 9(1):e84912, 2014

    2014

Pith tools

Reviewed August 16, 2026 · model on record in the stance chip above.