A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
PhyloVAE learns tree topologies without supervision.
ARTree uses deep learning to infer tree topologies efficiently.
We introduce the continuum self-similar tree (CSST) and characterize it topologically. We apply this to answer a question of Curien about the topology of the continuum random tree (CRT). We also give a topological characterization of other trees with branch points of finite or infinite valences.
We introduce the concept of community trees that summarizes topological structures within a network. A community tree is a tree structure representing clique communities from the clique percolation method (CPM). The community tree also generates a persistent diagram. Community trees and persistent diagrams reveal topol…
This paper finds efficient algorithms for approximating Markov networks with k-tree topologies.
The paper explores metrics on tree moduli spaces and a new topological group.
Sharp conditions link separators to R-trees for space transformations.
Improved phylogenetic inference using VBPI-Mixtures for tree topology and branch length.
GeoPhy uses geometric gradients to efficiently infer phylogenetic trees from molecular data.
We introduce a method for creating a special type of tree, called a tree position, from a weighted graph. Leaves of the tree correspond to vertices of the original graph, and the tree edges contain information which can be used to partition these vertices. By repeatedly applying reducing operations to the tree position…
Unique CaTherine wheel found for LQG geodesic tree.
Study infers tree topology from customer data using contrastive learning.
Study of projective Fraïssé limits of trees with confluent epimorphisms.
Paper improves tree probability estimation using stochastic optimization and variance reduction.
Paper proposes learnable topological features for efficient phylogenetic inference.
Topological methods improve neuron analysis and tracer injection summary.
This is a survey of the theory of real trees and their applications.
New proof and formula linking fusion trees to quantum knot invariants.
We study the crash dynamics of the Warsaw Stock Exchange (WSE) by using the Minimal Spanning Tree (MST) networks. We find the transition of the complex network during its evolution from a (hierarchical) power law MST network, representing the stable state of WSE before the recent worldwide financial crash, to a superst…
Study topological constraints for minimal hyperbolic surface laminations.
Digital trees have approximate fixed point property, and conditions for products are explored.
To each isolated critical point of a smooth function on a 3-manifold we put in correspondence a tree (graph without cycles). We will prove that functions are topologically equivalent in the neighborhoods of critical points if and only if the corresponding trees are isomorphic. A complete topological invariant of functi…
This paper improves deep forest models with soft routing and topology learning.
We consider certain groups of tree automorphisms as so-called diffeological groups. The notion of diffeology, due to Souriau, allows to endow non-manifold topological spaces, such as regular trees that we look at, with a kind of a differentiable structure that in many ways is close to that of a smooth manifold; a suita…
The main goal of this paper is to study the geometric structures associated with the representation of tensors in subspace based formats. To do this we use a property of the so-called minimal subspaces which allows us to describe the tensor representation by means of a rooted tree. By using the tree structure and the d…
This work introduces novel methods to identify and compare cycles across topological objects.
Solves weighted bi-colored plane tree enumeration and applies to geometric problems.
Bayesian supertrees method uses variational Bayes for overlapping taxon subsets.
Researchers analyze geodesic complexity in robot paths on tree graphs.
Width trees link link invariants and bridge number.
This paper uses two hierarchical techniques, a minimal spanning tree and an ultrametric hierarchical tree, to extract a topological influence map for major currencies from the ultrametric distance matrix for 1996-2001. We find that these two techniques generate a defined and robust scale free network with meaningful ta…
A new metric for comparing measures on tree systems reduces computational burden.
Let G be a finitely generated group. Two simplicial G-trees are said to be in the same deformation space if they have the same elliptic subgroups (if H fixes a point in one tree, it also does in the other). Examples include Culler-Vogtmann's outer space, and spaces of JSJ decompositions. We discuss what features are co…
It is known that all but finitely many leaves of a measured foliated 2-complex of thin type are quasi-isometric to an infinite tree with at most two topological ends. We show that if the foliation is cooriented, and the associated R-tree is self-similar, then a typical leaf has exactly one topological end. We also cons…
We show that the Gromov boundary of the free factor graph for the free group Fn with n>2 generators is the space of equivalence classes of minimal very small indecomposable projective Fn-trees without point stabilizer containing a free factor equipped with a quotient topology. Here two such trees are equivalent if the …
We give a simple algorithm that determines whether a given post-critically finite topological polynomial is Thurston equivalent to a polynomial. If it is, the algorithm produces the Hubbard tree; otherwise, the algorithm produces the canonical obstruction. Our approach is rooted in geometric group theory, using iterati…
The classical Matrix-Tree Theorem allows one to list the spanning trees of a graph by monomials in the expansion of the determinant of a certain matrix. We prove that in the case of three-graphs (that is, hypergraphs whose edges have exactly three vertices) the spanning trees are generated by the Pfaffian of a suitably…
In this paper we determine the topological complexity of configuration spaces of graphs which are not necessarily trees, which is a crucial assumption in previous results. We do this for two very different classes of graphs: fully articulated graphs and banana graphs. We also complete the computation in the case of tre…
We studied the topology of correlation networks among 34 major currencies using the concept of a minimal spanning tree and hierarchical tree for the full years of 2007-2008 when major economic turbulence occurred. We used the USD (US Dollar) and the TL (Turkish Lira) as numeraires in which the USD was the major currenc…
Paper proposes a new method for density estimation using tree tensor-network states.
Paper develops a new method to analyze 3D tree-like objects.
The construction of Mapper has emerged in the last decade as a powerful and effective topological data analysis tool that approximates and generalizes other topological summaries, such as the Reeb graph, the contour tree, split, and joint trees. In this paper, we study the parallel analysis of the construction of Mappe…
New family of triangulated 3-spheres identified from trees.
Mathematical foundation for phylogenetic tree uncertainty quantification.
A cluster tree provides a highly-interpretable summary of a density function by representing the hierarchy of its high-density clusters. It is estimated using the empirical tree, which is the cluster tree constructed from a density estimator. This paper addresses the basic question of quantifying our uncertainty by ass…
In this paper, we investigate the statistical features of the weighted international-trade network. By finding the maximum weight spanning trees for this network we make the extraction of the truly relevant connections forming the network's backbone. We discuss the role of large-sized countries (strongest economies) in…
We consider the detection of activations over graphs under Gaussian noise, where signals are piece-wise constant over the graph. Despite the wide applicability of such a detection algorithm, there has been little success in the development of computationally feasible methods with proveable theoretical guarantees for ge…
We find numerical and empirical evidence for dynamical, structural and topological phase transitions on the (German) Frankfurt Stock Exchange (FSE) in the temporal vicinity of the worldwide financial crash. Using the Minimal Spanning Tree (MST) technique, a particularly useful canonical tool of the graph theory, two tr…