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.
LinkedRNN models linked sequences by capturing both sequential and link information.
New invariant refines Milnor's triple linking number, revealing more information for complex links.
Characterizes sequences from two-component link diagrams.
DEAL model predicts links for new nodes with only attribute info.
Semi-supervised clustering aims to introduce prior knowledge in the decision process of a clustering algorithm. In this paper, we propose a novel semi-supervised clustering algorithm based on the information-maximization principle. The proposed method is an extension of a previous unsupervised information-maximization …
We investigate the geometry of hyperbolic knots and links whose diagrams have a high amount of twisting of multiple strands. We find information on volume and certain isotopy classes of geodesics for the complements of these links, based only on a diagram. The results are obtained by finding geometric information on ge…
A new method predicts links better across various networks.
In online social networks people often express attitudes towards others, which forms massive sentiment links among users. Predicting the sign of sentiment links is a fundamental task in many areas such as personal advertising and public opinion analysis. Previous works mainly focus on textual sentiment classification, …
New method detects essential tori in mixed singularity links.
DyHATR learns dynamic heterogeneous networks for better link prediction.
Recently, link prediction has attracted more attentions from various disciplines such as computer science, bioinformatics and economics. In this problem, unknown links between nodes are discovered based on numerous information such as network topology, profile information and user generated contents. Most of the previo…
Study uses graph Laplacians to analyze surface links.
Improves biomedical entity linking with latent type modeling.
We construct examples of knots that have isomorphic nth-order Alexander modules, but non-isomorphic nth-order linking forms, showing that the linking forms provide more information than the modules alone. This generalizes work of Trotter, who found examples of knots that have isomorphic classical Alexander modules, but…
Inequalities linking entropy, Fisher info, Stein discrepancy, and Wasserstein distance on Riemannian manifolds.
Effectively modelling hidden structures in a network is very practical but theoretically challenging. Existing relational models only involve very limited information, namely the binary directional link data, embedded in a network to learn hidden networking structures. There is other rich and meaningful information (e.…
For a link in the 3-sphere and for a prime , we express the -primary information on the first homology group of -fold branched covers of in terms of its -adic Milnor higher linking invariants, using the completed Alexander module of the pro- completion of the link group of .
Paper introduces symmetric divergence link models for probability distributions.
We describe a presentation for the augmented fundamental rack of a link in the lens space . Using this presentation, the (enhanced) counting rack invariants that have been defined for the classical links are applied to the links in . In this case, the counting rack invariants also include the informatio…
ALPINE predicts links in networks by querying the most informative pairs.
The paper proposes using non-isotropic distances for more accurate trace link recommendation.
It is known that the colored Jones polynomial of a -adequate link has a well-defined tail consisting of stable coefficients, and that the coefficients of the tail carry geometric and topological information on the -adequate link complement. We show that a power series similar to the tail of the colored Jones poly…
It is a natural question to ask whether two links are equivalent by the following moves -- parallel parts of a link are changed to k-times half-twisted parts and if they are, how many moves are needed to go from one link to the other. In particular if k=2 and the second link is a trivial link it is the question about t…
We determine the algebraic structure underlying the geometric complex associated to a link in Bar-Natan's geometric formalism of Khovanov's link homology theory (n=2). We find an isomorphism of complexes which reduces the complex to one in a simpler category. This reduction enables us to specify exactly the amount of i…
New method handles missing data in multimodal brain imaging.
GCN-LASE incorporates link attributes in graph convolutional networks.
We empirically investigated the effects of market factors on the information flow created from N(N-1)/2 linkage relationships among stocks. We also examined the possibility of employing the minimal spanning tree (MST) method, which is capable of reducing the number of links to N-1. We determined that market factors car…
We show that for a large class of hyperbolic knots and links, we can determine bounds on the volume of the link complement from combinatorial information given by a link diagram. Specifically, there is a universal constant C such that if a knot or link admits a prime, twist reduced diagram with at least 2 twist regions…
SDREM models complex network data with deep learning, improving link prediction.
We generalise theorems of Cochran-Lickorish and Owens-Strle to the case of links with more than one component. This enables the use of linking forms on double branched covers, Heegaard Floer correction terms, and Donaldson's diagonalisation theorem to complete the table of unlinking numbers for nonsplit prime links wit…
The paper extends knot polynomials to annular and toroidal pseudo links.
This paper shows how to create surface-links with many triple points.
New invariant for links in 3-sphere computed and computed using diagrams.
Checkerboard surfaces in alternating link complements are used frequently to determine information about the link. However, when many crossings are added to a single twist region of a link diagram, the geometry of the link complement stabilizes (approaches a geometric limit), but a corresponding checkerboard surface in…
It has often been taken as a working assumption that directed links in information networks are frequently formed by "short-cutting" a two-step path between the source and the destination -- a kind of implicit "link copying" analogous to the process of triadic closure in social networks. Despite the role of this assump…
State surfaces are spanning surfaces of links that are obtained from link diagrams guided by the combinatorics underlying Kauffman's construction of the Jones polynomial via state models. Geometric properties of such surfaces are often dictated by simple link diagrammatic criteria, and the surfaces themselves carry imp…
PHLP uses persistent homology to interpret graph link prediction.
This paper extends link invariants using functors on nanophrases.
We explore the complex associated to a link in the geometric formalism of Khovanov's (n=2) link homology theory, determine its exact underlying algebraic structure and find its precise universality properties for link homology functors. We present new methods of extracting all known link homology theories directly from…
The paper extends CF-moves to classify virtual links of any number of components.
Survey of linking information geometry and optimal transport.
Bitcoin's attention is linked to Google Trends data, not general uncertainty.
New neural network predicts user-item relationships in evolving graphs.
Kernel networks' stability edge linked to Fisher Information singularity.
SLiCE learns contextual node embeddings for link prediction in heterogeneous networks.
The paper derives an equation linking WAIC and WBIC for singular models.
Although many successful ensemble clustering approaches have been developed in recent years, there are still two limitations to most of the existing approaches. First, they mostly overlook the issue of uncertain links, which may mislead the overall consensus process. Second, they generally lack the ability to incorpora…
It is shown that, in the 1-jet space of the circle, the swapping and the flyping procedures, which produce topologically equivalent links, can produce nonequivalent legendrian links. Each component of the links considered is legendrian isotopic to the 1-jet of the 0-function, and thus cannot be distinguished by the cla…