arXiv research

This paper improves robust cluster enumeration for RES data.

A major challenge in cluster analysis is that the number of data clusters is mostly unknown and it must be estimated prior to clustering the observed data. In real-world applications, the observed data is often subject to heavy tailed noise and outliers which obscure the true underlying structure of the data. Consequen…

We present a scheme for online, unsupervised state discovery and detection from streaming, multi-featured, asynchronous data in high-frequency financial markets. Online feature correlations are computed using an unbiased, lossless Fourier estimator. A high-speed maximum likelihood clustering algorithm is then used to f…

We derive a new Bayesian Information Criterion (BIC) by formulating the problem of estimating the number of clusters in an observed data set as maximization of the posterior probability of the candidate models. Given that some mild assumptions are satisfied, we provide a general BIC expression for a broad class of data…

New approach for learning large Bayesian networks using feature clustering and compression.

Criterion for stopping conjugacy class enumeration in triangle groups.

In 2006, Fock and Goncharov constructed a nice basis of the ring of regular functions on the moduli space of framed ${\rm PGL}_2$-local systems on a punctured surface $S$. The moduli space is birational to a cluster $\mathcal{X}$-variety, whose positive real points recover the enhanced Teichmüller space of $S$. Their b…

Survey of robust clustering methods for hotspot detection.

We announce a solution to several enumeration problems in topology of surfaces. This includes an enumeration of homotopy classes of sections of locally trivial fiber bundles over surfaces and a computation of non-abelian 1-cohomology of surfaces.

Enumerated all genus two handlebody-knots with seven crossings.

The article enumerates doubly symmetric diagrams for knots up to 18 crossings.

This is the third paper in a series devoted to enumerating the prime alternating knots and links. This paper establishes a method for enumerating the prime alternating links. It is shown that one may choose any prime alternating link diagram of a given minimal crossing size and by applications of just two operators (T …

Constructive approach to Lie algebra gradings, computing maximal and enumerating all gradings.

Enumerating all 3-manifold triangulations of a given size is a difficult but increasingly important problem in computational topology. A key difficulty for enumeration algorithms is that most combinatorial triangulations must be discarded because they do not represent topological 3-manifolds. In this paper we show how …

This is the second of a part series devoted to enumerating prime alternating knots and links. In Part I, we introduced four operators on knots and showed that if these operators are applied to the set of all prime alternating knots of n crossings, the set of all prime alternating knots of n+1 crossings is obtained. In …

The second author and Norbury initiated the enumeration of lattice points in the Deligne-Mumford compactifications of moduli spaces of curves. They showed that the enumeration may be expressed in terms of polynomials, whose top and bottom degree coefficients store psi-class intersection numbers and orbifold Euler chara…

Dual decomposition provides a tractable framework for designing algorithms for finding the most probable (MAP) configuration in graphical models. However, for many real-world inference problems, the typical decomposition has a large integrality gap, due to frustrated cycles. One way to tighten the relaxation is to intr…

In low-dimensional topology, many important decision algorithms are based on normal surface enumeration, which is a form of vertex enumeration over a high-dimensional and highly degenerate polytope. Because this enumeration is subject to extra combinatorial constraints, the only practical algorithms to date have been v…

Causal graphs, such as directed acyclic graphs (DAGs) and partial ancestral graphs (PAGs), represent causal relationships among variables in a model. Methods exist for learning DAGs and PAGs from data and for converting DAGs to PAGs. However, these methods are significantly limited in that they only output a single cau…

In conventional prediction tasks, a machine learning algorithm outputs a single best model that globally optimizes its objective function, which typically is accuracy. Therefore, users cannot access the other models explicitly. In contrast to this, multiple model enumeration attracts increasing interests in non-standar…

New method finds 198,846 toric-colorable seeds of Picard number 5.

Many key algorithms in 3-manifold topology involve the enumeration of normal surfaces, which is based upon the double description method for finding the vertices of a convex polytope. Typically we are only interested in a small subset of these vertices, thus opening the way for substantial optimization. Here we give an…

Given a presentation for a rack $\mathcal R$, we define a process which systematically enumerates the elements of $\mathcal R$. The process is modeled on the systematic enumeration of cosets first given by Todd and Coxeter. This generalizes and improves the diagramming method for $n$-quandles introduced by Winker. We p…

We present a technique for the enumeration of all isotopically distinct ways of tiling a hyperbolic surface of finite genus, possibly nonorientable and with punctures and boundary. This provides a generalization of the enumeration of Delaney-Dress combinatorial tiling theory on the basis of isotopic tiling theory. To a…

We study active learning (AL) based on Gaussian Processes (GPs) for efficiently enumerating all of the local minimum solutions of a black-box function. This problem is challenging due to the fact that local solutions are characterized by their zero gradient and positive-definite Hessian properties, but those derivative…

We describe rational knots with any of the possible combinations of the properties (a)chirality, (non-)positivity, (non-)fiberedness, and unknotting number one (or higher), and determine exactly their number for a given number of crossings in terms of their generating functions. We show in particular how Fibonacci numb…

This paper deals with the enumeration of the higher order non-trivial compositions of the differential operations and the directional derivative in the space $R^n$ ($n \geq 3$). We present the recurrences for a counting the higher order non-trivial compositions.

Let M be a compact, hyperbolizable 3-manifold with nonempty incompressible boundary and let AH(π_1(M)) denote the space of (conjugacy classes of) discrete faithful representations of π_1(M) into PSL 2 (C). The components of the interior MP(π_1(M)) of AH(π_1(M)) (as a subset of the appropriate representation variety) ar…

The study enumerates virtual quandles up to isomorphism.

The face pairing graph of a 3-manifold triangulation is a 4-valent graph denoting which tetrahedron faces are identified with which others. We present a series of properties that must be satisfied by the face pairing graph of a closed minimal P^2-irreducible triangulation. In addition we present constraints upon the co…

The paper addresses the $k$-tangle enumeration problem. We introduce a notion of cascade diagram for $k$-tangle projections. An effective enumeration algorithm for projections is proposed based on cascade representation. Tangles projections with up to 12 crossings are tabulated. We provide also pictures of alternating …

We enumerate the small-volume manifolds that can be obtained by Dehn filling on Mom-2 and Mom-3 manifolds as defined by Gabai, Meyerhoff, and the author. In so doing we complete the proof that the Weeks manifold is the minimum-volume compact hyperbolic 3-manifold, as well as enumerating the 10 smallest one-cusped hyper…

We define a decomposition of link projections whose pieces we call atoroidal graphs. We describe a surgery operation on these graphs and show that all atoroidal graphs can be generated by performing surgery repeatedly on a family of well known link projections. This gives a method of enumerating atoroidal graphs and he…

Experiments in particle physics produce enormous quantities of data that must be analyzed and interpreted by teams of physicists. This analysis is often exploratory, where scientists are unable to enumerate the possible types of signal prior to performing the experiment. Thus, tools for summarizing, clustering, visuali…

We describe an algorithm for the enumeration of (candidates of) vertex-transitive combinatorial $d$-manifolds. With an implementation of our algorithm, we determine, up to combinatorial equivalence, all combinatorial manifolds with a vertex-transitive automorphism group on $n\leq 13$ vertices. With the exception of act…

Following the work of Cano and Diaz, we consider a continuous analog of lattice path enumeration. This allows us to define a continuous version of any discrete object that counts certain types of lattice paths. We define continuous versions of binomials and multinomials, and describe some identities and partial differe…

Origami structures are enumerated and shown to be quantum modular.

We consider here 6-regular plane graphs whose faces have size 1, 2 or 3. In Section 2 a practical enumeration method is given that allowed us to enumerate them up to 53 vertices. Subsequently, in Section 3 we enumerate all possible symmetry groups of the spheres that showed up. In Section 4 we introduce a new Goldberg-…

Drawing together techniques from combinatorics and computer science, we improve the census algorithm for enumerating closed minimal P^2-irreducible 3-manifold triangulations. In particular, new constraints are proven for face pairing graphs, and pruning techniques are improved using a modification of the union-find alg…

New framework for 3D spatial topology enumeration and identification.

The enumeration of normal surfaces is a crucial but very slow operation in algorithmic 3-manifold topology. At the heart of this operation is a polytope vertex enumeration in a high-dimensional space (standard coordinates). Tollefson's Q-theory speeds up this operation by using a much smaller space (quadrilateral coord…

Directed acyclic graphs are the basic representation of the structure underlying Bayesian networks, which represent multivariate probability distributions. In many practical applications, such as the reverse engineering of gene regulatory networks, not only the estimation of model parameters but the reconstruction of t…

An i-hedrite is a 4-regular plane graph with faces of size 2, 3 and 4. We do a short survey of their known properties and explain some new algorithms that allow their efficient enumeration. Using this we give the symmetry groups of all i-hedrites and the minimal representative for each. We also review the link of 4-hed…

We introduce a novel mechanism to tighten the local polytope relaxation for MAP inference in Markov random fields with low state space variables. We consider a surjection of the variables to a set of hyper-variables and apply the local polytope relaxation over these hyper-variables. The state space of each individual h…

Permutations linked to knots and links, with unknots counted by Schröder numbers.

To enumerate 3-manifold triangulations with a given property, one typically begins with a set of potential face pairing graphs (also known as dual 1-skeletons), and then attempts to flesh each graph out into full triangulations using an exponential-time enumeration. However, asymptotically most graphs do not result in …

Frequently, knots are enumerated by their crossing number. However, the number of knots with crossing number $c$ grows exponentially with $c$, and to date computer-assisted proofs can only classify diagrams up to around twenty crossings. Instead, we consider diagrams enumerated by bridge number, following the lead of S…

We present enumerations of a class of maps on Klein bottle which give rise to semi-equivelar maps. Semi-equivelar maps are generalizations of equivelar maps. There are eleven types of semi-equivelar maps on the Klein bottle. These are of the types $\{3^{6}\}$, $\{4^{4}\}$, $\{6^{3}\}$, $\{3^{3},$ $4^{2}\}$, $\{3^{2},$ …