Paper refines generating function for 2-bridge knot groups.
problem Determining the number of epimorphisms between 2-bridge knot groups.
method Refined generating function considering genus and crossing number.
result Improved formula for epimorphisms between 2-bridge knot groups.
A new diffusion method approximates Schrödinger bridge with improved convergence.
problem Approximating Schrödinger bridge with Langevin diffusion.
method Leveraging Langevin diffusion to approximate Schrödinger bridge.
result The difference between the two approximations is proportional to the score function.
Hasse-Weil zeta functions of SL_2-character varieties of arithmetic two bridge link groups are determined. Special values of the zeta functions at s=0,1,2 are also investigated.
New approach uses negative controls to estimate causal parameters without completeness conditions.
problem Estimating causal parameters when not all confounders are observed.
method Identification strategy based on minimax learning formulations for general function classes.
result Avoids completeness conditions and uniqueness assumptions on bridge functions.
Paper defines Farey Recursive Functions and explores their properties.
problem Understanding recursive functions on rationals.
method Defined and studied Farey Recursive Functions using Farey graph.
result Farey Recursive Functions naturally connect to 2-bridge knots and links.
New method simulates diffusion bridges using score matching.
problem Simulating diffusion bridges for statistical inference.
method Backward time representation, variational formulation, score matching.
result Effective approximation of diffusion bridges.
Suppose that there exists an epimorphism from the knot group of a 2-bridge knot K onto that of another knot K′. In this paper, we study the relationship between their crossing numbers c(K) and c(K′). Especially it is shown that c(K) is greater than or equal to 3c(K′) and we estimate how many knot groups …
This work bridges stochastic interpolants to infinite-dimensional Hilbert spaces.
problem Limited flexibility in generating arbitrary distributions for function-valued data.
method Establishes a rigorous framework for stochastic interpolants in infinite-dimensional Hilbert spaces.
result Achieves state-of-the-art results in conditional generation for complex PDE-based benchmarks.
A theorem of Jorgensen and Thurston implies that the volume of a hyperbolic 3-manifold is bounded below by a linear function of its Heegaard genus. Heegaard surfaces and bridge surfaces often exhibit similar topological behavior; thus it is natural to extend this comparison to ask whether a (g,b)-bridge surface for a…
New methods identify causal effects without needing complete proxy variables.
problem Identifying causal effects in the presence of unmeasured confounders.
method Partial identification methods that do not require completeness of proxy variables.
result Obtain bounds on causal effects using available proxy variables.
We calculate the Kauffman bracket skein module (KBSM) of the complement of all two-bridge links. For a two-bridge link, we show that the KBSM of its complement is free over the ring $\BC[t^{\pm 1}]$ and when reducing t=−1, it is isomorphic to the ring of regular functions on the character variety of the link group.
New method for evaluating policies in complex decision-making models with hidden variables.
problem Evaluating policies in partially observable Markov decision processes with hidden confounders.
method Introduces novel identification methods and minimax estimation techniques for linking target policy's value and observed data distribution.
result Proposes three estimators for off-policy evaluation in POMDPs with latent confounders, demonstrating their effectiveness through nonasymptotic and asymptotic analysis.
We show that the bridge number of a t bridge knot in S3 with respect to an unknotted genus t surface is bounded below by a function of the distance of the Heegaard splitting induced by the t bridges. It follows that for any natural number n, there is a tunnel number one knot in S3 that is not (1,n).
New algorithm learns bridged diffusion processes without time-reversals.
problem Learning bridged diffusion processes efficiently and accurately.
method Score matching with Doob's h-transform, avoiding time-reversals.
result Outperforms existing methods in learning bridged diffusion processes.
This is the third of three papers that refine and extend portions of our earlier preprint, "The depth of a knot tunnel." Together, they rework the entire preprint. In this paper, we use the theory of tunnel number 1 knots that we introduced in "The tree of knot tunnels" to strengthen the Tunnel Leveling Theorem of H. G…
In this paper we study the problem of stopping a Brownian bridge X in order to maximise the expected value of an exponential gain function. In particular, we solve the stopping problem sup0≤τ≤1E[eXτ] which was posed by Ernst and Shepp in their paper [Commun. Stoch. Anal., 9 (3), 20…
FKEE estimates expectations without samples, using diffusion bridges and PINNs.
problem Estimating expectations without large sample sizes.
method Diffusion bridge models and Feynman-Kac operator approximation using PINNs.
result Significantly reduces variance and improves efficiency.
A generalized bridge is the law of a stochastic process that is conditioned on N linear functionals of its path. We consider two types of representations of such bridges: orthogonal and canonical. The orthogonal representation is constructed from the entire path of the underlying process. Thus, future knowledge of the …
Study evaluates policies in partially observable environments without full model specification.
problem Evaluating policies in partially observable environments without full model specification.
method Developed non-parametric identification and recursive fitted-Q-evaluation algorithm.
result Established finite-sample error bounds for policy value estimation.
We show that the distance of a link K with respect to a bridge surface of any genus determines a lower bound on the genus of essential surfaces and Heegaard surfaces in the manifolds that result from non-trivial Dehn surgeries on the knot. In particular, knots with high bridge distance do not admit non-trivial non-hy…
TreeDSB solves mOT problems on tree-structured costs for Wasserstein barycenters.
problem Optimal transport with multiple marginals and tree-structured quadratic costs.
method Tree-based Diffusion Schrödinger Bridge (TreeDSB) for continuous and dynamic solutions.
result TreeDSB efficiently computes Wasserstein barycenters in high dimensions.
Defines a strict order on plat presentation classes for links.
problem Ordering and classification of link presentation classes.
method Dehornoy order applied to braid group classes.
result Induces a strict total order on bridge isotopy classes of n-bridge positions.
The theory of tunnel number 1 knots detailed in our previous paper, The tree of knot tunnels, provides a non-negative integer invariant called the depth of the tunnel. We give various results related to the depth invariant. Noting that it equals the minimum number of Goda-Scharlemann-Thompson tunnel moves needed to con…
Paper develops geometry for Kleinian groups using Farey polynomials.
problem Understanding the geometry of Kleinian groups generated by parabolic elements.
method Sakuma-Weeks triangulations and Farey recursive polynomials.
result Simple recursive algorithm to determine link complement geometry.
ADVI speeds up Bayesian inference for bridge regression models.
problem Slow MCMC for large datasets in bridge regression.
method Automatic Differentiation Variational Inference (ADVI) for Bayesian inference.
result ADVI implementation speeds up inference for large datasets.
In this paper, we introduce an extension of a Brownian bridge with a random length by including uncertainty also in the pinning level of the bridge. The main result of this work is that unlike for deterministic pinning point, the bridge process fails to be Markovian if the pining point distribution is absolutely contin…
Study finds optimal martingale coupling between two distributions with minimal entropy.
problem Finding the optimal martingale coupling between two distributions with minimal relative entropy.
method Solving a dual problem to find the log-density of the optimal coupling, which represents the marginal and martingale constraints.
result The log-density of the optimal coupling is given by a triplet of real functions representing the marginal and martingale constraints.
New method estimates Schrödinger bridge potentials via empirical risk minimization.
problem Estimating Schrödinger bridge potentials from samples.
method Rewriting Schrödinger system as a fixed-point equation and estimating the potential via empirical risk minimization.
result Uniform concentration of empirical risk around population counterpart under sub-Gaussian assumptions.
The paper optimizes bridge-type estimators for sparse models using pathwise methods.
problem Sparse parametric models with adaptive coefficients and multiple penalties.
method Pathwise optimization with accelerated proximal gradient descent and blockwise alternating optimization.
result Efficient computation of the full solution path for adaptive bridge estimators.
FDBM models use fractional Brownian motion to model complex stochastic processes.
problem Capturing memory effects and long-range dependencies in stochastic processes.
method Developed a generative diffusion bridge framework using a Markovian approximation of fractional Brownian motion.
result FDBM outperforms standard models in predicting future states and unpaired data translation.
Generative AI connects to Schrödinger bridge problems with soft constraints for stability.
problem Stability issues in generative AI due to hard terminal constraints.
method Soft-constrained Schrödinger bridge formulation and convergence analysis.
result Existence and convergence of optimal solutions as penalty grows.
Loosely speaking, the Volume Conjecture states that the limit of the n-th colored Jones polynomial of a hyperbolic knot, evaluated at the primitive complex n-th root of unity is a sequence of complex numbers that grows exponentially. Moreover, the exponential growth rate is proportional to the hyperbolic volume of the …
The study bounds slopes for Dehn fillings of two-bridge knots with hyperbolic representations.
problem Bounding slopes for Dehn fillings of two-bridge knots with hyperbolic representations.
method Combining the Riley polynomial with Khoi's surgery-slope formula, and analyzing meridian and longitude translation parameters.
result The set of surgery slopes admitting hyperbolic PSL(2,R) representations is bounded. This paper confirms a bound for folded ribbonlength of 2-bridge knots.
problem Bounding the folded ribbonlength of 2-bridge knots.
method Investigated the folded ribbonlength of 2-bridge knots and proved a linear upper bound.
result The folded ribbonlength of a 2-bridge knot K is bounded above by 2c(K)+2. New discretization scheme for Wasserstein gradient flows using Schrödinger bridges.
problem Computing Wasserstein gradient flows efficiently and without score functions.
method Iterated Schrödinger bridge approximation with particle-based Sinkhorn algorithm.
result The scheme converges to Wasserstein gradient flows for certain flows, including heat flow.
ASBS improves sampling from Boltzmann distributions without importance weighting.
problem Sampling from Boltzmann distributions with known energies but unknown samples.
method Adjoint Schrödinger Bridge Sampler using kinetic-optimal transportation.
result ASBS achieves scalable and efficient sampling without importance weighting.
New examples of knots with special bridge positions found.
problem Understanding special types of bridge positions for knots.
method Derived examples of knots with unperturbed weakly reducible non-minimal bridge positions.
result Connected sum of unperturbed bridge positions is unperturbed (a new conjecture).
Paper bridges ordinary-label and complementary-label learning frameworks.
problem Combining complementary-label learning with ordinary-label learning.
method Integrates loss functions for one-versus-all and pairwise classification.
result Derives classification risk and error bound for additivity and duality loss functions.
The paper provides examples of keen weakly reducible bridge spheres for links in b-bridge position.
problem Characterizing and finding examples of keen weakly reducible bridge spheres.
method Analyzing bridge spheres and their properties in terms of compressing disks and width complex.
result Infinitely many examples of keen weakly reducible bridge spheres for links in b-bridge position.
Exact formulas for volumes of specific knot cone-manifolds.
problem Finding exact volumes of cone-manifolds with two-bridge knots.
method Provided exact integral formulas using Chebyshev polynomials and algebraic equations.
result Exact formulas for hyperbolic and spherical volumes of cone-manifolds.
We compute the bridge spectra of cables of 2-bridge knots. We also give some results about bridge spectra and distance of Montesinos knots.
We describe a method of encoding various types of link diagrams, including those with classical, flat, rigid, welded, and virtual crossings. We show that this method may be used to encode link diagrams, up to equivalence, in a notation whose length is a cubic function of the number of 'riser marks'. For classical knots…
Generative model for time series using Schrödinger bridge.
problem Creating synthetic time series data with temporal dynamics.
method Schrödinger bridge approach for entropic interpolation via optimal transport.
result The method generates synthetic time series that respect temporal dynamics.
Any 2-bridge knot in the 3-sphere has a bridge sphere from which any other bridge surface can be obtained by stabilization, meridional stabilization, perturbation and proper isotopy.
Suppose a knot in a 3-manifold is in n-bridge position. We consider a reduction of the knot along a bridge disk D and show that the result is an (n−1)-bridge position if and only if there is a bridge disk E such that (D,E) is a cancelling pair. We apply this to an unknot K, in n-bridge position with re…
We define and compare several natural ways to compute the bridge number of a knot diagram. We study bridge numbers of crossing number minimizing diagrams, as well as the behavior of diagrammatic bridge numbers under the connected sum operation. For each notion of diagrammatic bridge number considered, we find crossing …
New method finds infinitely many surface knots with specific bridge numbers.
problem Finding numerical invariants for surface links.
method Colorings of surface links by keis to prove bridge number existence.
result Existence of infinitely many surface knots with bridge number n for n ≥ 4.
New methods optimize transport and sampling for neural networks.
problem Designing effective training losses for neural networks.
method Optimal transport and stochastic optimal control through Schrödinger bridge problem.
result Valid training losses can be designed with numerical advantages.