The L-move for classical braids extends naturally to trivalent braids. We follow the L-move approach to the Markov Theorem, to prove a one-move Markov-type theorem for trivalent braids. We also reformulate this L-Move Markov theorem and prove a more algebraic Markov-type theorem for trivalent braids. Along the way, we …
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,742 papers · 148 categories
Trend · papers per month
48 results for “Markov moves”
Let denote the classical braid group on strands and let the {\em mixed braid group} be the subgroup of comprising braids for which the first strands form the identity braid. Let . We will describe explicit algebraic moves on such that equivale…
Knot theory in handlebodiesmath.GT
We consider oriented knots and links in a handlebody of genus through appropriate braid representatives in , which are elements of the braid groups . We prove a geometric version of the Markov theorem for braid equivalence in the handlebody, which is based on the -moves. Using this we then prove tw…
Framed Braid Equivalencesmath.GT
New framed moves extend classical knot theory results.
problem Extending classical knot theory to framed braids.
method Introduced framed versions of L-moves, Hilden, Pure Hilden groups, and framed versions of the Birman theorem.
result Proved a framed version of the Birman theorem for framed links in plat representation.
Efficient reinforcement learning for simultaneous-move zero-sum games using optimistic value iteration.
problem Learning optimal strategies in simultaneous-move zero-sum Markov games with function approximation.
method Developed an optimistic variant of least-squares minimax value iteration algorithm for offline and online settings.
result Achieved an upper bound of on duality gap and regret.
In this paper we prove a Markov Theorem for virtual braids and for some analogs of this structure. The virtual braid group is the natural companion in the category of virtual knots, just as the Artin braid group is the natural companion to classical knots and links. In this paper we follow the L--move methods to prove …
It is shown that two braids represent transversally isotopic links if and only if one can pass from one braid to another by conjugations in braid groups, positive Markov moves, and their inverses.
A Markov theorem for plat closure of surface braids in Dunwoody and periodic Takahashi manifoldsmath.GT
The article finds equivalence moves for links in specific manifolds using plat closure of braids.
problem Finding equivalence moves for links in Dunwoody and periodic Takahashi manifolds.
method Representing manifolds with Heegaard splitting and braids, determining equivalence moves algorithmically and computing them explicitly.
result Explicit computation of equivalence moves for some cases.
We prove Alexander- and Markov-type theorems for virtual spatial trivalent graphs and virtual trivalent braids. We provide two versions for the Markov-type theorem: one uses an algebraic approach similar to the case of classical braids and the other one is based on L-moves.
In this paper we first give a one-move version of Markov's braid theorem for knot isotopy in that sharpens the classical theorem. Then a relative version of Markov's theorem concerning a fixed braided portion in the knot. We also prove an analogue of Markov's theorem for knot isotopy in knot complements. Finally …
Alexander's and Markov's theorems state that any link type in is represented by a closed braid and that such representations are related by some elementary operations called Markov moves. We generalize the notion of a braid to that in 4-dimensional space and establish an analogue of these theorems.
The aim of this text is to establish some relations between Markov chains in Dirichlet Environments on directed graphs and certain hypergeometric integrals associated with a particular arrangement of hyperplanes. We deduce from these relations and the computation of the connexion obtained by moving one hyperplane of th…
Specialized knot theory theorems for strongly involutive links.
problem Classical Alexander and Markov theorems for links.
method Equivariant closure map for strongly involutive links.
result Surjective equivariant closure map up to equivalence of strongly involutive links.
The paper defines plat closures for spherical braids and shows links in can be realized this way.
problem Defining and analyzing plat closures for spherical braids in .
method Defining plat closures, associating residual permutations, and presenting moves on spherical braids.
result The number of components of the plat closure link of a spherical braid is equal to the number of disjoint cycles in its residual permutation.
Some remarks on twin groupsmath.GR
Study on twin groups with algorithm and properties.
problem Properties and algorithm of twin groups.
method Algorithm for equivalence under Markov moves, properties of R-infinity and co-Hopfian.
result Twin groups have -property and are not co-Hopfian for .
Study of pseudo knots, links, and knotoids with braiding and L-moves.
problem Missing crossing information in knots and links.
method Introducing pseudo knots, pseudo tied links, pseudo knotoids, and L-moves.
result Formulated new theorems for pseudo knots, links, and knotoids.
The Markov Theorem Without Stabilization (MTWS) established the existence of a calculus of braid isotopies that can be used to move between closed braid representatives of a given oriented link type without having to increase the braid index by stabilization. Although the calculus is extensive there are three key isoto…
Every link in R^3 can be represented by a one-vertex ribbon graph. We prove a Markov type theorem on this subset of link diagrams.
The Markov Theorem Without Stabilization (MTWS) (see math.GT/0310279) established the existence of a calculus of braid isotopies that can be used to move between closed braid representatives of a given oriented link type without having to increase the braid index by stabilization. Although the calculus is extensive the…
New PDMP samplers tackle variable selection in models.
problem Jointly explore model space and parameter space.
method Develop reversible jump PDMP samplers.
result New samplers mix better and are more efficient.
Moving Target Monte Carlostat.CO
New algorithm MTMC reduces MCMC evaluation costs.
problem High-dimensional sampling with intractable posterior evaluations.
method Iteratively updated approximation of posterior distribution for acceptance rate.
result Approximation converges to true posterior as iterations increase.
We propose a framework to study the optimal liquidation strategy in a limit order book for large-tick stocks, with spread equal to one tick. All order book events (market orders, limit orders and cancellations) occur according to independent Poisson processes, with parameters depending on price move directions. Our goa…
We propose a purely algebraic approach to construct invariants of transversal links in the standard contact structure on the 3-sphere generalizing Jones' approach to invariant of usual links. The only geometry used is the analogue of Alexander and Markov theorems. More precisely, we construct a trace on a certain cubic…
A new sampler improves the inference of causal structures from observational data.
problem Inferring causal relationships from observational data when DAGs are Markov equivalent.
method Developed a non-reversible Markov chain, Causal Zig-Zag sampler, targeting Markov Equivalence Classes of DAGs.
result The sampler improves mixing and offers efficient algorithms for DAG inference.
A plane curve is a knot diagram in which each crossing is replaced by a 4-valent vertex, and so are dual to a subset of planar quadrangulations. The aim of this paper is to introduce a new tool for sampling diagrams via sampling of plane curves. At present the most efficient method for sampling diagrams is rejection sa…
Improved sampling for network community detection.
problem Inefficient sampling from network partition posterior distributions.
method Merge-split Markov chain Monte Carlo for efficient sampling.
result Significantly improved mixing time and correct sampling.
The paper computes the Kauffman bracket skein module of via braids.
problem Computing the Kauffman bracket skein module of .
method Two methods: extending a universal invariant to via braid band moves and a diagrammatic approach.
result The Kauffman bracket skein module of is not torsion-free and its free part is generated by the unknot.
Developing feature selection algorithms that move beyond a pure correlational to a more causal analysis of observational data is an important problem in the sciences. Several algorithms attempt to do so by discovering the Markov blanket of a target, but they all contain a forward selection step which variables must pas…
Dynamics of the major USA market indices DJIA, S&P, Nasdaq, and NYSE is analyzed from the point of view of the random walking problem with two-step correlations of the market moves. The parameters characterizing the stochastic dynamics are determined empirically from the historical quotes for the daily, weekly, and mon…
Developed algebraic theory of bonded braids, proving Markov theorem.
problem Studied bonded knots and their algebraic properties.
method Introduced bonded braid monoid, proved Alexander and Markov theorems.
result Every bonded knot is the closure of a bonded braid, and equivalent knots have related braid representatives.
A parametrization of hypergraphs based on the geometry of points in is developed. Informative prior distributions on hypergraphs are induced through this parametrization by priors on point configurations via spatial processes. This prior specification is used to infer conditional independence models or M…
Combines local and global samplers for efficient sampling.
problem Limited learning accuracy in regions with little data.
method Explore-Exploit Markov chain Monte Carlo strategy ()
result Proves -uniform geometric ergodicity of .
Khovanov and Rozansky's categorification of the HOMFLY-PT polynomial is invariant under braidlike isotopies for any link diagram and Markov moves for braid closures. To define HOMFLY-PT homology, they required a link to be presented as a braid closure, because they did not prove invariance under the other oriented Reid…
In order to obtain a Markov theorem without stabilization, Birman and Menasco introduced the notion of exchange related braids. In this paper I study the way the Fiedler polynomial distinguishes conjugacy classes of some particular braided knots. I introduce the Kauffman bracket in the solid torus. Its Taylor expansion…
We introduce a new braid-theoretic framework with which to understand the Legendrian and transversal classification of knots, namely a Legendrian Markov Theorem without Stabilization which induces an associated transversal Markov Theorem without Stabilization. We establish the existence of a nontrivial knot-type specif…
Time Series Analysis in Machine Learningastro-ph.IM
Time series analysis is a key component of machine learning, with applications in various fields.
problem Time series analysis in machine learning
method Basic concepts, classical statistical models, modern machine learning approaches
result Machine learning techniques for time series analysis
We show how to speed up Sequential Monte Carlo (SMC) for Bayesian inference in large data problems by data subsampling. SMC sequentially updates a cloud of particles through a sequence of distributions, beginning with a distribution that is easy to sample from such as the prior and ending with the posterior distributio…
New method uses reinforcement learning to sample from complex data structures efficiently.
problem Constructing reliable samples from high-dimensional polytopes for goodness-of-fit tests.
method Markov decision process and reinforcement learning for sampling.
result Demonstrated scalable tools from linear algebra for theoretical guarantees in non-linear algebra context.
Paper develops efficient algorithms for zero-sum Markov games with general function classes.
problem Challenging settings in zero-sum Markov games with parameterized value functions or models.
method Developed new model-free and model-based algorithms for decoupled and coordinated settings.
result Improved sample complexity and regret bounds for various settings.
Due to physiological variation, patients diagnosed with the same condition may exhibit divergent, but related, responses to the same treatments. Hidden Parameter Markov Decision Processes (HiP-MDPs) tackle this transfer-learning problem by embedding these tasks into a low-dimensional space. However, the original formul…
Braidoidsmath.GT
Braidoids generalize the classical braids and form a counterpart theory to the theory of planar knotoids, just as the theory of braids does for the theory of knots. In this paper, we introduce basic notions of braidoids, a closure operation for braidoids, we prove an analogue of the Alexander theorem, that is, an algor…
New method for computing Kauffman bracket skein module of lens spaces using unoriented braids.
problem Computing Kauffman bracket skein module of lens spaces for .
method Developed a braid theoretic approach via unoriented braids, introducing a new algebra and invariant.
result Computed the Kauffman bracket skein module of lens spaces and extended to .
Software estimates inequality in random systems with changing communities.
problem Measuring inequality in systems with dynamic interactions and random attributes.
method Piecewise homogeneous Markov chain for changing points, copula function for multivariate distribution, Monte Carlo algorithm for entropy estimation.
result Estimates Random Theil's Entropy to measure inequality in random systems.
Paper defines doodles on closed surfaces, unifying classical and virtual theories.
problem Classifying doodles on closed surfaces, especially non-orientable ones.
method Introducing twisted virtual doodles, defining twin groups, and proving Alexander- and Markov-type theorems.
result Unified theory of doodles, showing trivial center and residually finite properties.
Learning to Unknotmath.GT
The UNKNOT problem solved using natural language processing and machine learning.
problem Determining if a knot is the unknot.
method Braid word representation, binary classification, Reformer and shared-QK Transformer networks, reinforcement learning, Markov moves, braid relations.
result Reformer and shared-QK Transformer networks outperform fully-connected networks in predicting the unknot.
A multi-task GP model tracks time-varying transition probabilities between two states.
problem Tracking time-varying transition probabilities between 'moves' and 'pauses' states.
method Kernel-based multi-task Gaussian Process model with time-variability and constraints.
result Enforces constraints while learning transition probabilities.
Logarithmic regret for continuous-time reinforcement learning.
problem Continuous-time Markov decision processes with unknown transition probabilities and holding times.
method Upper confidence reinforcement learning, mean holding time estimation, stochastic comparison of point processes.
result Logarithmic regret bound achieved in finite time.
Optimal algorithm for two-player zero-sum games with linear parameterization.
problem Finding Nash Equilibrium in two-player zero-sum Markov games with linear transition.
method Nash-UCRL algorithm, Coarse Correlated Equilibrium, Optimism-in-Face-of-Uncertainty.
result Proves regret bound, matching lower bound up to logarithmic factors.