arXiv research

Complete criterion for VoI in multi-decision influence diagrams established.

We optimize large Random Forests into faster, smaller decision diagrams.

Improves reliability diagrams for probabilistic forecasts.

We present a new algorithm for exactly solving decision making problems represented as influence diagrams. We do not require the usual assumptions of no forgetting and regularity; this allows us to solve problems with simultaneous decisions and limited information. The algorithm is empirically shown to outperform a sta…

FCM clustering adapts to persistence diagrams for topological data analysis.

dtControl uses decision trees to represent controllers efficiently and explainably.

We describe a bottom-up framework, based on the identification of appropriate order parameters and determination of phase diagrams, for understanding progressively refined agent-based models and simulations of financial markets. We illustrate this framework by starting with a deterministic toy model, whereby $N$ indepe…

We study the geometry of deep (neural) networks (DNs) with piecewise affine and convex nonlinearities. The layers of such DNs have been shown to be {\em max-affine spline operators} (MASOs) that partition their input space and apply a region-dependent affine mapping to their input to produce their output. We demonstrat…

This paper surveys fairness notions in ML and recommends the most suitable one for real-world scenarios.

We study the dynamics of a version of the batch minority game, with random external information and with different types of inhomogeneous decision noise (additive and multiplicative), using generating functional techniques à la De Dominicis. The control parameters in this model are the ratio $α=p/N$ of the number $p$ o…

The paper refines transformations of lattice diagrams and introduces dotted diagrams.

This note explains how to transform Heegaard diagrams into framed link diagrams.

New minimal link diagrams found, including torus links and homogeneous ones.

The dynamics of minority games with agents trading on different time scales is studied via dynamical mean-field theory. We analyze the case where the agents' decision-making process is deterministic and its stochastic generalization with finite heterogeneous learning rates. In each case, we characterize the macroscopic…

Algorithm converts Kirby diagrams to trisection diagrams for 4-manifolds.

Kernelized Taylor diagram visualizes data populations with fewer assumptions.

A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative.In this paper, we introduce a method of converting a virtual link diagram to a normal virtual link diagram by use of the double covering …

Study categorizes knots and links as rigid or shaky based on Reidemeister moves.

Twisted graph diagrams are virtual graph diagrams with bars on edges. A bijection between abstract graph diagrams and twisted graph diagrams is constructed. Then a polynomial invariant of Yamada-type is developed which provides a lower bound for the virtual crossing number of virtual graph diagrams.

A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative. Normal virtual links have some properties similar to classical links.In this paper, we introduce a method of converting a virtual link d…

Persistence diagrams are important descriptors in Topological Data Analysis. Due to the nonlinearity of the space of persistence diagrams equipped with their {\em diagram distances}, most of the recent attempts at using persistence diagrams in machine learning have been done through kernel methods, i.e., embeddings of …

Problems on region choices for knot and link diagrams solved using Alexander numbering.

Table of symmetric diagrams for knots up to 10 crossings.

Domestic violence (DV) is a global social and public health issue that is highly gendered. Being able to accurately predict DV recidivism, i.e., re-offending of a previously convicted offender, can speed up and improve risk assessment procedures for police and front-line agencies, better protect victims of DV, and pote…

The presence of slipknots in configurations of proteins and DNA has been shown to affect their functionality, or alter it entirely. Historically, polymers are modeled as polygonal chains in space. As an alternative to space curves, we provide a framework for working with subknots inside of knot diagrams via knotoid dia…

Proves minimal crossing diagrams for specific spatial graphs.

Rectangular diagrams help analyze foliations in 3-sphere.

Bankwitz characterized an alternating diagram representing the trivial knot. A non-alternating diagram is called almost alternating if one crossing change makes the diagram alternating. We characterize an almost alternaing diagram representing the trivial knot. As a corollary we determine an unknotting number one alter…

The paper explores when specific knot operations simplify diagrams.

Gauss diagrams' properties can change with Hamiltonian cycle choice.

In many settings (e.g., robotics) demonstrations provide a natural way to specify tasks; however, most methods for learning from demonstrations either do not provide guarantees that the artifacts learned for the tasks, such as rewards or policies, can be safely composed and/or do not explicitly capture history dependen…

New estimate of semimeander complexity for knots with more than 10 crossings.

Paper proves link diagrams can be realized for some but not all types of links.

GridPyM handles grid diagrams for knot theory.

There is a well-known way to describe a link diagram as a (signed) plane graph, called its Tait graph. This concept was recently extended, providing a way to associate a set of embedded graphs (or ribbon graphs) to a link diagram. While every plane graph arises as a Tait graph of a unique link diagram, not every embedd…

The study improves inequalities for link diagrams and introduces weak rectangular diagrams.

In this paper, a link diagram is said to be minimal if no Reidemeister move I or II can be applied to it to reduce the number of crossings. We show that for an arbitrary diagram D of a link without a trivial split component, a minimal diagram obtained by applying Reidemeister moves I and II to D is unique. The proof al…

Algorithm for recognizing and performing Reidemeister moves in Gauss diagrams.

Standard trisection diagrams found for Mazur type 4-manifolds.

By using the cohomology theory of quandles, quandle cocycle invariants and shadow quandle cocycle invariants are defined for oriented links and surface-links via broken surface diagrams. By using symmetric quandles, symmetric quandle cocycle invariants are also defined for unoriented links and surface-links via broken …

Minimal grid diagrams for 12-crossing prime knots identified.

The paper introduces triple grid diagrams to construct Lagrangian surfaces in complex projective space.

A virtual link diagram is called mod $m$ almost classical if it admits an Alexander numbering valued in integers modulo $m$, and a virtual link is called mod $m$ almost classical if it has a mod $m$ almost classical diagram as a representative. In this paper, we introduce a method of constructing a mod $m$ almost class…

Algorithm constructs Kirby diagrams for 4D open books.

Study minimum ribbonlength of immersed flat knots and links.

For an oriented virtual link, L.H. Kauffman defined the f-polynomial (Jones polynomial). The supporting genus of a virtual link diagram is the minimal genus of a surface in which the diagram can be embedded. In this paper we show that the span of the f-polynomial of an alternating virtual link L is determined by the nu…

Study shows that splitting links requires an arbitrarily large number of extra crossings.

The paper examines circle graphs of Gauss diagrams and finds counterexamples to previous descriptions.