arXiv research

This paper clarifies vine copula structures using graph and matrix representations.

New method finds significant high-order interactions efficiently.

Optimal trend-following strategy uses simple EMA, avoiding complex cherry-picked signals.

Study finds cherry-picking load shaping strategies outperforms others in reducing grid CO2 emissions.

We describe a natural way to plant cherry- and plumtrees at prescribed generic locations in an orchard.

Bayesian context trees capture complex dependencies in categorical sequences.

In this paper we prove that if we consider the standard real metric on simplicial rooted trees then the category Tower-Set of inverse sequences can be described by means of the bounded coarse geometry of the naturally associated trees. Using this we give a geometrical characterization of Mittag-Leffler property in inve…

The curve graph and related graphs are hyperbolic and have quasi-tree fibers.

nTreeClus clusters categorical sequences using tree-based learners and k-mers.

We show that the Korevaar-Schoen limit of the sequence of equivariant harmonic maps corresponding to a sequence of irreducible $SL_2({\mathbb C})$ representations of the fundamental group of a compact Riemannian manifold is an equivariant harmonic map to an ${\mathbb R}$-tree which is minimal and whose length function …

Prediction suffix trees (PST) provide an effective tool for sequence modelling and prediction. Current prediction techniques for PSTs rely on exact matching between the suffix of the current sequence and the previously observed sequence. We present a provably correct algorithm for learning a PST with approximate suffix…

In this paper we give a sufficient and necessary condition for two rooted trees with the same plucking polynomial. Furthermore, we give a criteria for a sequence of non-negative integers to be realized as a rooted tree.

We iterate Manolescu's unoriented skein exact triangle in knot Floer homology with coefficients in the field of rational functions over $\mathbb{Z}/2\mathbb{Z}$. The result is a spectral sequence which converges to a stabilized version of delta-graded knot Floer homology. The $(E_2,d_2)$ page of this spectral sequence …

In this paper, we study the dynamics of degenerating sequences of rational maps on Riemann sphere $\hat{\mathbb{C}}$ using $\mathbb{R}$-trees. Given a sequence of degenerating rational maps, we give two constructions for limiting dynamics on $\mathbb{R}$-trees: one geometric and one algebraic. The geometric constructio…

PhyloGFN uses GFlowNets to infer phylogenetic trees from sequence data.

Proves convergence of gradient Ricci shrinkers with uniform bounds.

Phylogenetic tree inference using deep DNA sequencing is reshaping our understanding of rapidly evolving systems, such as the within-host battle between viruses and the immune system. Densely sampled phylogenetic trees can contain special features, including "sampled ancestors" in which we sequence a genotype along wit…

Multistage Defer Trees improve model accuracy while maintaining interpretability.

The paper proposes a method to infer differentiation trees from RNA velocity data.

We propose a model for tagging unstructured texts with an arbitrary number of terms drawn from a tree-structured vocabulary (i.e., an ontology). We treat this as a special case of sequence-to-sequence learning in which the decoder begins at the root node of an ontological tree and recursively elects to expand child nod…

Many common sequential data sources, such as source code and natural language, have a natural tree-structured representation. These trees can be generated by fitting a sequence to a grammar, yielding a hierarchical ordering of the tokens in the sequence. This structure encodes a high degree of syntactic information, ma…

We prove that two links related by a surgery along a connected, strict graph clasper of degree n are C_n-equivalent, i.e, related by a sequence of surgeries along strict tree claspers of degree n.

Graph-to-Tree Neural Networks improve structured input-output translation in tasks like semantic parsing and math word problems.

The Jones polynomial can be expressed in terms of spanning trees of the graph obtained by checkerboard coloring a knot diagram. We show there exists a complex generated by these spanning trees whose homology is the reduced Khovanov homology. The spanning trees provide a filtration on the reduced Khovanov complex and a …

It is conjectured that the Khovanov homology of a knot is invariant under mutation. In this paper, we review the spanning tree complex for Khovanov homology, and reformulate this conjecture using a matroid obtained from the Tait graph (checkerboard graph) G of a knot diagram K. The spanning trees of G provide a filtrat…

To every tree we associate a filtered cochain complex. Its cohomology and the corresponding spectral sequence have clear combinatorial description. If a tree is the Dynkin diagram of a simple plane curve singularity, the graded Euler characteristic of this complex coincides with the Alexander polynomial of the link. In…

The Hitchin component is a connected component of the character variety of reductive group homomorphisms from the fundamental group of a closed surface S of genus greater than 1 to the Lie group PSL_m(R). The Teichmuller space of S naturally embeds into the Hitchin component. The limit points in the Thurston compactifi…

A new tree-Wasserstein distance for high-dimensional data with latent feature hierarchy.

This work evaluates and benchmarks calibration metrics for data-driven regression models.

Using the link surgery formula for Heegaard Floer homology we find a spectral sequence from the lattice homology of a plumbing tree to the Heegaard Floer homology of the corresponding 3-manifold. This spectral sequence shows that for graphs with at most two "bad" vertices, the lattice homology is isomorphic to the Heeg…

Various and ubiquitous information systems are being used in monitoring, exchanging, and collecting information. These systems are generating massive amount of event sequence logs that may help us understand underlying phenomenon. By analyzing these logs, we can learn process models that describe system procedures, pre…

Compactness theorem for quasiregular curves proves normality and resolves nodal points.

Paper proves Łojasiewicz inequalities near simple bubble trees on surfaces.

Single tree outperforms random forest in testing accuracy.

Bestvina and Feighn showed that a morphism S --> T between two simplicial trees that commutes with the action of a group G can be written as a product of elementary folding operations. Here a more general morphism between simplicial trees is considered, which allow different groups to act on S and T. It is shown that t…

The kernel method is a potential approach to analyzing structured data such as sequences, trees, and graphs; however, unordered trees have not been investigated extensively. Kimura et al. (2011) proposed a kernel function for unordered trees on the basis of their subpaths, which are vertical substructures of trees resp…

The medical field stands to see significant benefits from the recent advances in deep learning. Knowing the uncertainty in the decision made by any machine learning algorithm is of utmost importance for medical practitioners. This study demonstrates the utility of using Bayesian LSTMs for classification of medical time…

We study a notion of deformation for simplicial trees with group actions (G-trees). Here G is a fixed, arbitrary group. Two G-trees are related by a deformation if there is a finite sequence of collapse and expansion moves joining them. We show that this relation on the set of G-trees has several characterizations, in …

We consider the problem of estimating the evolutionary history of a set of species (phylogeny or species tree) from several genes. It is known that the evolutionary history of individual genes (gene trees) might be topologically distinct from each other and from the underlying species tree, possibly confounding phyloge…

Extractive compression is a challenging natural language processing problem. This work contributes by formulating neural extractive compression as a parse tree transduction problem, rather than a sequence transduction task. Motivated by this, we introduce a deep neural model for learning structure-to-substructure tree …

We introduce autoregressive implicit quantile networks (AIQN), a fundamentally different approach to generative modeling than those commonly used, that implicitly captures the distribution using quantile regression. AIQN is able to achieve superior perceptual quality and improvements in evaluation metrics, without incu…

In this paper, we show that one can naturally associate a limiting dynamical system $F: T\longrightarrow T$ on an $\R$-tree to any degenerating sequence of rational maps $f_n: \hat\C \longrightarrow \hat\C$ of fixed degree. The construction of $F$ is in $2$ steps: first we use barycentric extension to get $\E f_n : \Hy…

ARTree uses deep learning to infer tree topologies efficiently.

Tree-based LSTM improves sequential regression with missing data.

This paper proves a Faber-Krahn inequality for trees with given matching number.

Algorithm transforms weakly negative plumbing trees to negative definite ones.

Self-supervised skip-tree training improves mathematical reasoning in language models.

We study online prediction of bounded stationary ergodic processes. To do so, we consider the setting of prediction of individual sequences and build a deterministic regression tree that performs asymptotically as well as the best L-Lipschitz constant predictors. Then, we show why the obtained regret bound entails the …