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,657 papers · 148 categories

Trend · papers per month

23466992 · Jun 202019922001200920172026
48 results for Markov trace

We define the singular Hecke algebra H(SBn){\mathcal H} (SB_n) as the quotient of the singular braid monoid algebra C(q)[SBn]{\mathbb C} (q) [SB_n] by the Hecke relations σk2=(q1)σk+qσ_k^2 = (q-1) σ_k +q, 1kn11 \le k\le n-1, and define the Markov traces on the sequence {H(SBn)}n=1+\{{\mathcal H}(SB_n)\}_{n=1}^{+\infty} in the same way as for the Marko…

2007-07-03abs ↗pdf ↗

Using the Fourier expansion of Markov traces for Ariki-Koike algebras over Q(q,u1,...,ue)\mathbb{Q}(q,u_{1},...,u_{e}), we give a direct definition of the Alexander polynomials for mixed links. We observe that under the corresponding specialization of a Markov parameter, the Fourier coefficients of Markov traces take quite simple …

2011-12-11abs ↗pdf ↗

In this article, we define and study the affine and cyclotomic Yokonuma-Hecke algebras. These algebras generalise at the same time the Ariki-Koike and affine Hecke algebras and the Yokonuma-Hecke algebras. We study the representation theory of these algebras and construct several bases for them. We then show how we can…

2014-06-12abs ↗pdf ↗

In this paper we represent the classical braids in the Yokonuma--Hecke and the adelic Yokonuma--Hecke algebras. More precisely, we define the completion of the framed braid group and we introduce the adelic Yokonuma--Hecke algebras, in analogy to the pp--adic framed braids and the pp--adic Yokonuma--Hecke algebras in…

2009-09-14abs ↗pdf ↗

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…

2013-07-22abs ↗pdf ↗

Defines new algebras for virtual link invariants, matching known polynomials.

problem Developing new mathematical structures for virtual link invariants.
method Introducing two towers of algebras, VTL and ATL, and determining their presentations and Markov traces.
result The invariants derived from the Markov traces match known polynomials for virtual links.

We prove that the so-called t algebra of braids and ties supports a Markov trace. Further, by using this trace in the Jones' recipe, we define invariant polynomials for classical knots and singular knots. Our invariants have three parameters. The invariant of classical knots is an extension of the Homflypt polynomial a…

2014-08-25abs ↗pdf ↗

The Yokonuma-Hecke algebras are quotients of the modular framed braid group and they support Markov traces. In this paper, which is sequel to Juyumaya and Lambropoulou (2007), we explore further the structures of the pp-adic framed braids and the pp-adic Yokonuma-Hecke algebras constructed in Juyumaya and Lambropoulo…

2009-05-22abs ↗pdf ↗

We classify the Markov traces factoring through the Birman-Wenzl-Murakami (BMW) algebras. For this purpose, we define a common `cover' for the two variations of the BMW-algebra originating from the quantum orthogonal/symplectic duality, which are responsible for the so-called `Dubrovnik' variation of the Kauffman polyn…

2014-03-17abs ↗pdf ↗

This paper is a presentation, where we compute the HOMFLYPT Skein module of singular links in the 3-sphere. This calculation is based on some results previously proved by Rabenda and the author on Markov traces on singular Hecke algebras, as well as on classical techniques that allow to pass from the framework of Marko…

2009-08-27abs ↗pdf ↗

Funar algebra K=K(α,β;k)K_\infty=K_\infty(α,β;k) is the quotient of the group algebra over a ring kk of the braid group BB_\infty by two cubic relations: σ13ασ12+βσ11=0σ_1^3-ασ_1^2+βσ_1-1=0 and another one which involves σ1σ_1 and σ2σ_2. The universal Markov trace on KK_\infty is the quotient map tt of K(α,β,k[u,v])K_\infty(α,β,k[u,v]) to its qu…

2012-06-04abs ↗pdf ↗

In this article we introduce a framization of the Hecke algebra of type B. For this framization we construct a faithful tensorial representation and two linear bases. We finally construct a Markov trace on these algebras and from this trace we derive isotopy invariants for framed and classical knots and links in the so…

2016-03-28abs ↗pdf ↗

The scalable calculation of matrix determinants has been a bottleneck to the widespread application of many machine learning methods such as determinantal point processes, Gaussian processes, generalised Markov random fields, graph models and many others. In this work, we estimate log determinants under the framework o…

2017-04-24abs ↗pdf ↗

Kashaev and Reshetikhin proposed a generalization of the Reshetikhin-Turaev link invariant construction to tangles with a flat connection in a principal G-bundle over the complement of the tangle. The purpose of this paper is to adapt and renormalize their construction to define invariants of G-links using the semi-cyc…

2013-03-20abs ↗pdf ↗

We extend the Framization of the Temperley-Lieb algebra to Coxeter systems of type B\mathtt{B}. We first define a natural extension of the classical Temperley-Lieb algebra to Coxeter systems of type B\mathtt{B} and prove that such an extension supports a unique linear Markov trace function. We then introduce the Fram…

2017-08-07abs ↗pdf ↗

In this paper we study properties of the Markov trace trd{\rm tr}_d and the specialized trace trd,D{\rm tr}_{d,D} on the Yokonuma-Hecke algebras, such as behaviour under inversion of a word, connected sums and mirror imaging. We then define invariants for framed, classical and singular links through the trace ${\rm tr}_{d,…

2015-05-25abs ↗pdf ↗

SHMM models human mobility from GPS and text data, overcoming text sparsity.

problem Modeling human mobility from semantic trace data, especially addressing text sparsity.
method SHMM is a multi-modal spherical hidden Markov model that jointly models location, time, and text embeddings on a unit sphere using vMF distribution.
result SHMM outperforms state-of-the-art models in next location prediction and has lower training cost.

In this paper we introduce a Jones-type invariant for singular knots, using a Markov trace on the Yokonuma--Hecke algebras Yd,n(u){\rm Y}_{d,n}(u) and the theory of singular braids. The Yokonuma--Hecke algebras have a natural topological interpretation in the context of framed knots. Yet, we show that there is a homomorphis…

2009-05-22abs ↗pdf ↗

Defines braids with double lines for links in a surface times circle and connects it to the affine Hecke algebra.

problem Presenting links in a surface times circle using braids with double lines.
method Defines braids with double lines, proves Alexander and Markov theorems, and connects Hecke algebra to affine Hecke algebra.
result The Hecke algebra of braids with double lines is isomorphic to the affine Hecke algebra.

Ray tracing sampler improves neural network sampling efficiency and resilience.

problem Sampling neural network posterior distributions efficiently and robustly.
method Markov Chain Monte Carlo using ray tracing through likelihood space.
result Significantly higher resilience to gradient heating compared to HMC.

We define a finite-dimensional cubic quotient of the group algebra of the braid group, endowed with a (essentially unique) Markov trace which affords the Links-Grould invariant of knots and links. We investigate several of its properties, and state several conjectures about its structure.

2012-03-27abs ↗pdf ↗

We develop a diagrammatic formalism for calculating the Alexander polynomial of the closure of a braid as a state-sum. Our main tools are the Markov trace formulas for the HOMFLY-PT polynomial and Young's semi-normal representations of the Iwahori-Hecke algebras of type A.

2010-02-25abs ↗pdf ↗

The ordinary (or classical) Birman-Wenzl-Murakami algebras were initially conceived as an algebraic framework for the Kauffman link invariant. They also appear as centralizer algebras for representations of quantum universal enveloping algebras of orthogonal or symplectic types. It was shown by Morton and Wassermann th…

2004-11-07abs ↗pdf ↗

Most real-world datasets, and particularly those collected from physical systems, are full of noise, packet loss, and other imperfections. However, most specification mining, anomaly detection and other such algorithms assume, or even require, perfect data quality to function properly. Such algorithms may work in lab c…

2019-04-10abs ↗pdf ↗

We propose a Bayesian nonparametric mixture model for prediction- and information extraction tasks with an efficient inference scheme. It models categorical-valued time series that exhibit dynamics from multiple underlying patterns (e.g. user behavior traces). We simplify the idea of capturing these patterns by hierarc…

2017-06-19abs ↗pdf ↗

We introduce the concept of tied links in the solid torus, which generalize naturally the concept of tied links in S3S^3 previously introduced by Aicardi and Juyumaya. We also define an invariant of these tied links by using skein relations, and subsequently we recover this invariant by using Jones' method over the bt-…

2019-10-23abs ↗pdf ↗

Paper provides convergence guarantees for off-policy NAC with finite sample complexity.

problem Convergence analysis of off-policy natural actor-critic algorithm.
method Finite-sample analysis with Importance Sampling and Q-trace algorithm.
result Converges to global optimal policy with sample complexity O(ε3log2(1/ε))\mathcal{O}(ε^{-3}\log^2(1/ε)).

The aim of this paper is to define two link invariants satisfying cubic skein relations. In the hierarchy of polynomial invariants determined by explicit skein relations they are the next level of complexity after Jones, HOMFLY, Kauffman and Kuperberg's G2G_2 quantum invariants. Our method consists in the study of Mark…

2000-09-27abs ↗pdf ↗

New algorithms for collaborative reinforcement learning with limited communication.

problem Efficiently learning value functions in multi-agent systems with strict information constraints.
method Distributed gradient-based temporal difference algorithms with consensus schemes.
result Parameter estimates converge to ODEs with defined invariant sets under general assumptions.

We prove that the quotients of the group algebra of the braid group introduced by L. Funar in Comm. Math. Phys., 1995, collapses in characteristic distinct from 2. In characteristic 2 we define several quotients of it, which are connected to the classical Hecke and Birman-Wenzl-Murakami quotients, but which admit in ad…

2010-10-07abs ↗pdf ↗

In this paper we introduce the Yokonuma-Temperley-Lieb algebra as a quotient of the Yokonuma-Hecke algebra over a two-sided ideal generated by an expression analogous to the one of the classical Temperley-Lieb algebra. The main theorem provides necessary and sufficient conditions for the Markov trace defined on the Yok…

2010-12-07abs ↗pdf ↗

LIC compiles probabilistic models to generate efficient MCMC proposals.

problem Creating accurate Metropolis-Hastings proposals for Bayesian inference.
method Integrates probabilistic graphical models and neural networks in an open-source framework to optimize proposal distributions.
result LIC produces more efficient and robust MCMC proposals compared to existing methods.

This paper proposes swaps on two important new measures of generalized variance, namely the maximum eigen-value and trace of the covariance matrix of the assets involved. We price these generalized variance swaps for financial markets with Markov-modulated volatilities. We consider multiple assets in the portfolio for …

2019-08-11abs ↗pdf ↗

In this work we introduce the concept of Modular Framization or simply Framization. We construct a framization Fd,nF_{d,n} of the Birman--Wenzl--Murakami algebra, also known as BMW algebra, and start a systematic study of this framization. We show that Fd,nF_{d,n} is finite dimensional and the \lq braid generators\rq\ of t…

2010-07-01abs ↗pdf ↗

The paper uncovers the mathematical structure enabling value decomposition in multi-agent systems.

problem Theoretical justification for why value decomposition works effectively in multi-agent systems remains underexplored.
method The paper introduces the concept of Markov entanglement to measure the underlying structure and demonstrates how it can be used to bound the decomposition error.
result The widely-used class of index policies is weakly entangled and enjoys a sublinear O(N)\mathcal O(\sqrt{N}) scale of decomposition error for NN-agent systems.

The paper computes the Kauffman bracket skein module of S1imesS2S^1 imes S^2 via braids.

problem Computing the Kauffman bracket skein module of S1imesS2S^1 imes S^2.
method Two methods: extending a universal invariant to S1imesS2S^1 imes S^2 via braid band moves and a diagrammatic approach.
result The Kauffman bracket skein module of S1imesS2S^1 imes S^2 is not torsion-free and its free part is generated by the unknot.

Bayesian context trees capture complex dependencies in categorical sequences.

problem Complex, long-range dependencies in categorical sequences are not well captured by simple models.
method Parsimonious Bayesian context trees with model-based agglomerative clustering for efficient inference.
result The proposed framework outperforms existing models on real-world data.

Automata learning techniques automatically generate system models from test observations. These techniques usually fall into two categories: passive and active. Passive learning uses a predetermined data set, e.g., system logs. In contrast, active learning actively queries the system under learning, which is considered…

2019-06-28abs ↗pdf ↗

The paper advances U-statistics in dependent settings, improving spectral estimation and goodness-of-fit tests.

problem Non-asymptotic analysis of U-statistics in dependent Markov chain settings.
method Proved new concentration and exponential inequalities for U-statistics, applied to spectral estimation, online algorithms, and goodness-of-fit tests.
result Established new results for spectral estimation, online algorithms, and goodness-of-fit tests in Markov chain settings.

Markov boundary improves tabular prediction but not as expected.

problem Improving tabular prediction using the Markov boundary.
method Evaluation on a synthetic SCM benchmark with feature counts from 40 to 1000.
result Restricting a regressor to the Markov boundary often improves prediction, but existing discovery and training pipelines do not fully exploit this.