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

2825658471,129 · Jun 202019922001200920172026
48 results for branch data

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 ↗

Branched covers between Riemann surfaces are associated with certain combinatorial data, and Hurwitz existence problem asks whether given data satisfying those combinatorial constraints can be realized by some branched cover. We connect recent development in spherical conic metrics to this old problem, and give a new m…

2018-05-08abs ↗pdf ↗

Prove realizability of genus-0 branch data for tetrahedral coverings of the sphere.

problem Prove realizability of genus-0 branch data for tetrahedral coverings of the sphere.
method Use an explicit combinatorial description of coverings via dessins d'enfants.
result Prove realizability for a broader class of branch data with more critical values.

Paper introduces branched signature model for efficient computation and data-driven applications.

problem Efficient computation and data-driven modeling of branched rough paths.
method Develops a universal approximation theorem and constructs an extension map to realize branched signatures.
result Explicit construction of branched signatures via an extension map for efficient computation.

Characterizes representations for complex projective structures with specific branch data.

problem Understanding representations of surface groups as holonomy of complex projective structures.
method Computing holonomies for spherical metrics and affine structures with prescribed conical angles.
result Computed holonomies for spherical metrics and affine structures with specific conical angles.

Efficiently models tree-like data with coupled branches using HMMs.

problem Modeling sequential data with coupled branches in biological systems.
method Developed a dynamic programming algorithm for tree-based HMMs with coupled branches.
result Efficiently solves likelihood, decoding, and parameter learning problems for tree-based HMMs with coupled branches.

We continue our computation, using a combinatorial method based on Gronthendieck's dessins d'enfant, of the number of (weak) equivalence classes of surface branched covers matching certain specific branch data. In this note we concentrate on data with the surface of genus g as source surface, the sphere as target surfa…

2018-07-29abs ↗pdf ↗

We desingularize a branch point pp of a minimal disk F0(D)F_0(\mathbb{D}) in R4\mathbb{R}^4 through immersions FtF_t's which have only transverse double points and are branched covers of the plane tangent to F0(D)F_0(\mathbb{D}) at pp. If F0F_0 is a topological embedding and thus defines a knot in a sphere/cylinder around …

2015-03-24abs ↗pdf ↗

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 ↗

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.

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 ↗

Let ΛΛ be a collection of partitions of a positive integer dd of the form (a1,,ap),(b1,,bq),(m1+1,1,,1),,(ml+1,1,,1),(a_1,\cdots, a_p),\,(b_1,\cdots, b_q),\,(m_1+1,1,\cdots,1),\cdots, (m_l+1,1,\cdots,1), where (m1,,ml)(m_1,\cdots, m_l) is a partition of p+q2>0p+q-2>0. We prove that there exists a rational function on the Riemann sphere C\overline{\mathbb{C}} with …

2015-10-20abs ↗pdf ↗

Gradient estimation techniques applied to programs with randomness in high energy physics.

problem Differentiating programs with discrete randomness in high energy physics.
method Several gradient estimation techniques, including Stochastic AD method, applied to simplified detector design experiments.
result Development of the first fully differentiable branching program.

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.

We prove that if S is a closed compact surface of negative Euler characteristic, and if R is a quasi-Fuchsian representation in PSL(2,C), then the deformation space M(k,R) of branched projective structures on S with total branching order k and holonomy R is connected, as soon as k>0. Equivalently, two branched projecti…

2012-03-27abs ↗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.

Automated multi-task learning algorithm that optimizes network topology.

problem Over-sharing in multi-task learning leads to over-generalization and suboptimal performance.
method Tree-structured design space with gumbel-softmax sampling for differentiable network splitting.
result End-to-end trainable algorithm that optimizes network topology for multiple objectives across tasks.

New method for ancestral inference in branching processes with random environments.

problem Determining ancestor distribution parameters in branching processes with random environments.
method Generalized method of moments for ancestral inference.
result Limiting distribution of ancestor and offspring estimators decouple and converge to independent Gaussian variables under certain conditions.

Develops a machine learning method for parameter estimation in branching processes models.

problem Parameter evaluation for unevenly distributed sparse and dense regions in stochastic datasets.
method Approximate Bayesian computation based on Isolation Kernel mapping and maxima weighted kernel.
result Effective parameter estimation for cancer cell evolution models using personal data.

New method identifies causal structure in count data using cumulants and path analysis.

problem Challenges in discovering causal structure from count data, especially due to non-identifiability.
method Poisson Branching Structural Causal Model (PB-SCM) with path analysis using high-order cumulants.
result Causal order is identifiable under specific conditions in PB-SCM using cumulant information.

Authors prove a contact structure result using branched covers and overtwisted disks.

problem Proving a contact structure result using branched covers and overtwisted disks.
method Explicitly constructing an overtwisted disk in the pp-fold cyclic branched cover of S3S^3.
result An overtwisted disk is contained in the complement of the branch locus.