Research
On-device research index

arXiv research

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.

168,695 papers · 148 categories

Trend · papers per month

22456789 · May 202619922001200920172026
48 results for branch length

Improved phylogenetic tree reconstruction using flexible branch length distributions.

problem Inefficient Markov chain Monte Carlo methods for large sequence datasets.
method Variational Bayesian phylogenetic inference with semi-implicit branch length distributions.
result Proposed method improves marginal likelihood estimation and branch length posterior approximation.

Improved phylogenetic inference with normalizing flows.

problem Limitations of current diagonal Lognormal branch length approximation in VBPI.
method Proposes VBPI-NF using normalizing flows to handle non-Euclidean branch length space.
result Significantly improves phylogenetic posterior estimation on real data.

Improved phylogenetic inference using VBPI-Mixtures for tree topology and branch length.

problem Multimodality of tree-topology posterior distributions in phylogenetic inference.
method VBPI-Mixtures algorithm that uses mixture learning within the BBVI framework.
result VBPI-Mixtures captures tree-topology distributions better than VBPI.

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…

2018-05-28abs ↗pdf ↗

We define sink marks for branched complexes and find conditions for them to determine a branched surface structure. These will be used to construct branched surfaces in knot and tangle complements. We will extend Delman's theorem and prove that a Montesinos knot KK of length at least 3 has a persistently laminar branc…

2010-08-16abs ↗pdf ↗

Branching Flows generates sequences of varying lengths using binary trees.

problem Generating sequences of unknown lengths or fixed elements.
method A generative modeling framework that evolves states over binary trees, controlling sequence length.
result Branching Flows can generate sequences of varying lengths and mix different types of state spaces.

We prove existence and a.e. regularity of an area minimizing soap film with a bound on energy spanning a given Jordan curve in R^3. The energy of a film is defined to be the sum of its surface area and the length of its singular branched set. The class of surfaces over which area is minimized includes images of disks, …

2004-03-20abs ↗pdf ↗

For a branched cover between two closed orientable surfaces, the Riemann-Hurwitz formula relates the Euler characteristics of the surfaces, the total degree of the cover, and the total length of the partitions of the degree given by the local degrees at the preimages of the branching points. A very old problem asks whe…

2007-09-13abs ↗pdf ↗

\noindent Given a Riemann surface MM, the \emph{complexity} of a branched cover of MM to the Riemann sphere S2S^2, of degree dd and with branching set of cardinality n3n \geq 3, is defined as dd times the hyperbolic area of the complement of its branching set in S2S^2. A branched cover p ⁣:MS2p \colon M \to S^2 of degre…

2011-10-28abs ↗pdf ↗

The study introduces hyperbolic angles in Lorentzian spaces and characterizes curvature bounds.

problem Characterizing timelike curvature bounds in Lorentzian spaces.
method Synthetic geometric framework of Lorentzian (pre-)length spaces, introduction of hyperbolic angles, and angle monotonicity condition.
result Characterization of timelike curvature bounds with an angle monotonicity condition.

This paper extends the work in [Suzuki, 1996] and presents an efficient depth-first branch-and-bound algorithm for learning Bayesian network structures, based on the minimum description length (MDL) principle, for a given (consistent) variable ordering. The algorithm exhaustively searches through all network structures…

2013-01-16abs ↗pdf ↗

A new variational method speeds up Bayesian phylogenetic inference.

problem Slow and inefficient MCMC methods in Bayesian phylogenetic inference.
method Combining subsplit Bayesian networks with variational inference for efficient tree topology and branch length estimation.
result Variational approach provides competitive performance with significantly fewer iterations.

We consider surface branch data with base surface the sphere, odd degree d, three branching points, and two partitions of d of the form (2,...,2,1) and (2,...,2,2h+1). If the third partition has length L, this datum satisfies the Riemann-Hurwitz necessary condition for realizability if h-L is odd and at least -1. For s…

2019-03-23abs ↗pdf ↗

Researchers create coordinates for hyperbolic surfaces, proving a magic formula.

problem Constructing coordinates for hyperbolic structures on genus-2 surfaces.
method Developed Fenchel-Nielsen coordinates and Wolpert's magic formula analogues.
result Found Darboux charts for the Goldman symplectic form on branched hyperbolic structures.

Given a hyperbolic 3-manifold with torus boundary, we bound the change in volume under a Dehn filling where all slopes have length at least 2π. This result is applied to give explicit diagrammatic bounds on the volumes of many knots and links, as well as their Dehn fillings and branched covers. Finally, we use this res…

2006-12-06abs ↗pdf ↗

We view closed orientable 3-manifolds as covers of S^3 branched over hyperbolic links. For a p-fold cover M \to S^3, branched over a hyperbolic link L, we assign the complexity p Vol(S^3 minus L) (where Vol is the hyperbolic volume). We define an invariant of 3-manifolds, called the link volume and denoted LV, that ass…

2012-05-07abs ↗pdf ↗

Analytic convex bodies' Poincaré series extended holomorphically.

problem Analytic continuation of Poincaré series for convex bodies.
method Analytic continuation of Laplace transforms, holomorphic functions, and resolvent of multiplication operators.
result Poincaré series continues holomorphically to a conical neighborhood of the right half-plane, removing countable cuts and points.

The paper extends completeness notions to low-regularity spacetimes.

problem Defining completeness conditions for spacetimes with low-regularity metrics.
method Extending Beem's completeness notions to Lorentzian length spaces and proving relationships between them.
result Equivalence of completeness conditions for globally hyperbolic C1C^{1}-spacetimes under certain conditions.

Study on moduli spaces of branched projective structures on surfaces.

problem Characterizing and understanding moduli spaces of branched projective structures.
method Analytic and geometric methods to study the moduli spaces of branched projective structures.
result The moduli space of marked branched projective structures is a complex analytic space with specific dimensions and singular points.

We define a laminar branched surface to be a branched surface satisfying the following conditions: (1) Its horizontal boundary is incompressible; (2) there is no monogon; (3) there is no Reeb component; (4) there is no sink disk (after eliminating trivial bubbles in the branched surface). The first three conditions are…

2002-03-31abs ↗pdf ↗

We consider finite-sheeted, regular, possibly branched covering spaces of compact surfaces with boundary and the associated liftable and symmetric mapping class groups. In particular, we classify when either of these subgroups coincides with the entire mapping class group of the surface. As a consequence, we construct …

2018-04-27abs ↗pdf ↗

Given a branched covering of degree d between closed surfaces, it determines a collection of partitions of d, the branch data. In this work we show that any branch data are realized by an indecomposable primitive branched covering on a connected close surface N with Euler's characteristic less than or equal to 0. This …

2007-07-19abs ↗pdf ↗

We present a method for the reconstruction of networks, based on the order of nodes visited by a stochastic branching process. Our algorithm reconstructs a network of minimal size that ensures consistency with the data. Crucially, we show that global consistency with the data can be achieved through purely local consid…

2010-06-04abs ↗pdf ↗

This article introduces the degenerate special Lagrangian equation (DSL) and develops the basic analytic tools to construct and study its solutions. The DSL governs geodesics in the space of positive graph Lagrangians in Cn.\mathbb{C}^n. Existence of geodesics in the space of positive Lagrangians is an important step in…

2015-06-26abs ↗pdf ↗

Techniques for constructing codimension 2 embeddings and immersions of the 2 and 3-fold branched covers of the 3 and 4-dimensional spheres are presented. These covers are in braided form, and it is in this sense that they are folded. More precisely the composition of the embedding (or immersion) and the canonical proje…

2013-01-17abs ↗pdf ↗

New examples show transverse knots are determined by their branched covers.

problem Transverse knots and their isotopy classes.
method Constructing and analyzing non-isotopic transverse knots with contactomorphic cyclic branched covers.
result Transverse isotopy classes of many transverse knots are determined by the contactomorphism type of their cyclic branched covers.

We establish a calculus for branched spines of 3-manifolds by means of branched Matveev-Piergallini moves and branched bubble-moves. We briefly indicate some of its possible applications in the study and definition of State-Sum Quantum Invariants.

2004-02-29abs ↗pdf ↗

Quantized Coulomb branches linked to skein algebras.

problem Understanding the relationship between quantized Coulomb branches and skein algebras.
method Association of quantized Coulomb branches to surfaces, description of relationship for specific surfaces, formulation of a conjecture.
result A conjecture linking quantized Coulomb branches and skein algebras.