Related papers: Sussing Merger Trees: A proposed Merger Tree data …
In this work we answer an open question asked by Johnson--Scoville. We show that each merge tree is represented by a discrete Morse function on a path. Furthermore, we present explicit constructions for two different but related kinds of…
Federated learning has emerged as a promising distributed learning paradigm that facilitates collaborative learning among multiple parties without transferring raw data. However, most existing federated learning studies focus on either…
Designers of statistical machine translation (SMT) systems have begun to employ tree-structured translation models. Systems involving tree-structured translation models tend to be complex. This article aims to reduce the conceptual…
In this paper we present novel algorithmic techniques with a O(H(N)+N/H(N)) time complexity for performing several types of queries and updates on general rooted trees, binary search trees and lists of size N. For rooted trees we introduce…
Consider the space of continuous functions on a geometric tree $X$ whose persistent homology gives rise to a finite generic barcode $D$. We show that there are exactly as many path connected components in this space as there are merge trees…
Modern TEM instrumentation can probe a wide range of structural, optical, and chemical properties with unprecedented resolution. However, each of these properties must be recorded in independent datasets using different detector modes with…
We use large volume, high resolution, N-body simulations of 3 different $\Lambda$CDM models, with different clustering strengths, to generate dark matter halo merging histories. Over the reliable range of halo masses, roughly galaxy groups…
Binary jumbled pattern matching asks to preprocess a binary string $S$ in order to answer queries $(i,j)$ which ask for a substring of $S$ that is of length $i$ and has exactly $j$ 1-bits. This problem naturally generalizes to…
The dynamical state and morphological features of galaxies and galaxy clusters, and their high-redshift precursors, are tightly connected with their assembly history, encoding crucial information about the formation and evolution of such…
I provide notes on the NFW, Einasto, Sersic, and other mass profiles which provide good fits to simulated dark matter halos (S3). I summarize various published c(M) relations: halo concentration as a function of mass (S1). The definition of…
Multimodal image registration plays a key role in creating digital patient models by combining data from different imaging techniques into a single coordinate system. This process often involves multiple sequential and interconnected…
Peca suggested in a recent paper on the arxiv to consider binary butterfly trees and their Horton-Strahler numbers. The trees are obtained by glueing two binary trees together in a special way; the results are again binary trees but with a…
The fermion mass textures are discussed in the context of F-theory SU(5) GUT. The tree-level up, down and charged lepton Yukawa couplings are computed in terms of the integrals of overlapping wavefunctions at the intersection points of…
We use a suite of high-resolution N-body simulations to study the properties, abundance and clustering of high mass halos at high redshift, including their mass assembly histories and mergers. We find that the analytic form which best fits…
In this work we study the interleaving distance between merge trees from a combinatorial point of view. We use a particular type of matching between trees to obtain a novel formulation of the distance. With such formulation, we tackle the…
We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…
We present a method to numerically estimate the densities of a discretely sampled data based on binary space partitioning tree. We start with a root node containing all the particles and then recursively divide each node into two nodes each…
A descriptive summary is given of the results to-date from the framed standard model (FSM) which: (i) assigns geometric meaning to the Higgs field and to fermion generations, hence offering an explanation for the observed mass and mixing…
Term unification plays an important role in many areas of computer science, especially in those related to logic. The universal mechanism of grammar-based compression for terms, in particular the so-called Singleton Tree Grammars (STG),…
A merge tree is a fundamental topological structure used to capture the sub-level set (and similarly, super-level set) topology in scalar data analysis. The interleaving distance is a theoretically sound, stable metric for comparing merge…