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

Trend · papers per month

6.3%12.5%18.8%25.0% · Jul 199319922001200920172026
48 results for linking matrix

We show some properties of a Seifert matrix of an nn-component Brunnian link. In particular, we give a necessary and sufficient condition for a matrix to be a Seifert matrix of a 2-component Brunnian link up to S-equivalence.

2006-01-30abs ↗pdf ↗

A checkerboard graph of a special diagram of an oriented link is made a directed, edge-weighted graph in a natural way so that a principal minor of its Laplacian matrix is a Seifert matrix of the link. Doubling and weighting the edges of the graph produces a second Laplacian matrix such that a principal minor is an Ale…

2018-09-18abs ↗pdf ↗

Study Alexander matrices for link quandles and their relation to knot invariants.

problem Understanding Alexander matrices for link quandles and their applications to knot invariants.
method Investigate ff-twisted Alexander matrices and their connection to quandle cocycle invariants.
result Show that ff-twisted Alexander invariants of knot quandles are stronger than those of knot groups.

In a recent work of Ayaka Shimizu[5]^{[5]}, she defined an operation named region crossing change on link diagrams, and showed that region crossing change is an unknotting operation for knot diagrams. In this paper, we prove that region crossing change on a 2-component link diagram is an unknotting operation if and only…

2011-01-06abs ↗pdf ↗

The data in many disciplines such as social networks, web analysis, etc. is link-based, and the link structure can be exploited for many different data mining tasks. In this paper, we consider the problem of temporal link prediction: Given link data for times 1 through T, can we predict the links at time T+1? If our da…

2010-05-21abs ↗pdf ↗

The ubiquitous proliferation of online social networks has led to the widescale emergence of relational graphs expressing unique patterns in link formation and descriptive user node features. Matrix Factorization and Completion have become popular methods for Link Prediction due to the low rank nature of mutual node fr…

2016-01-28abs ↗pdf ↗

We study the linking numbers in a rational homology 3-sphere and in the infinite cyclic cover of the complement of a knot. They take values in Q\Bbb Q and in Q(Z[t,t1]){Q}({\Bbb Z}[t,t^{-1}]) respectively, where Q(Z[t,t1]){Q}({\Bbb Z}[t,t^{-1}]) denotes the quotient field of Z[t,t1]{\Bbb Z}[t,t^{-1}]. It is known that the modulo-Z\Bbb Z

2001-11-19abs ↗pdf ↗

Extends classical results to virtual links, proving new properties of alternating and semi-alternating virtual links.

problem Classical results for virtual links, focusing on alternating and semi-alternating links.
method Inequality relating link determinant and crossing number, matrix-tree theorem, Tait conjectures for virtual and welded links.
result Alexander polynomial of almost classical alternating virtual links is alternating.

The paper proposes DEA to make graph neural networks fairer in link prediction.

problem Graph neural networks can unfairly prioritize certain social groups in link prediction.
method Drop Edges and Adapt (DEA) fine-tuning strategy with covariance constraints.
result DEA improves fairness and accuracy in link prediction tasks.

Simplified KR polynomial for bipartite links reduces to tensor products of vector spaces.

problem Complexity reduction of Khovanov-Rozansky polynomial for bipartite links.
method Local reduction of matrix factorizations to planar cycles and simplification to vector spaces.
result KR polynomial for bipartite links simplifies to tensor products of vector spaces.

Starting from considering deeper relationship between conjugacy classes and irreducible representations of a finite group GG, we find some quite simple RR-matrice defined by using finite groups. This construction produces many sets (or topological spaces) admitting braid group actions. We introduce conceptions "exten…

2018-09-24abs ↗pdf ↗

Homogeneous links were introduced by Peter Cromwell, who proved that the projection surface of these links, that given by the Seifert algorithm, has minimal genus. Here we provide a different proof, with a geometric rather than combinatorial flavor. To do this, we first show a direct relation between the Seifert matrix…

2011-02-04abs ↗pdf ↗

Paper proposes a new method to improve clustering ensemble performance.

problem Improving clustering ensemble performance by refining co-association matrix.
method Low-rank tensor approximation to derive coherent-link matrix and refine co-association matrix.
result The proposed method achieves breakthrough in clustering performance compared to state-of-the-art methods.

To a presentation of an oriented link as the closure of a braid we assign a complex of bigraded vector spaces. The Euler characteristic of this complex (and of its triply-graded cohomology groups) is the HOMFLYPT polynomial of the link. We show that the dimension of each cohomology group is a link invariant.

2005-05-03abs ↗pdf ↗

The Goeritz matrix of a link is obtained from the Jacobian matrix of a modified Dehn presentation associated to a diagram using Fox's free differential calculus. When the diagram is special the Seifert matrix can also be determined from the presentation.

2018-08-30abs ↗pdf ↗

We use topological methods to prove a semicontinuity property of the Hodge spectra for analytic germs defined on an isolated surface singularity. For this we introduce an analogue of the Seifert matrix (the fractured Seifert matrix), and of the Levine--Tristram signatures associated with it, defined for null-homologous…

2013-08-23abs ↗pdf ↗

The Kashaev conjecture is proven for classical signatures and Alexander polynomials of links.

problem Proving the Kashaev conjecture for signatures and Alexander polynomials.
method Relating Kashaev's matrix to Gordon-Litherland's work and Kauffman's model.
result Proven Alexander polynomial and classical signature parts of the conjecture for arbitrary links, and full conjecture for definite knots.

Develops a new causal model for path-dependent link prediction.

problem Existing causal models assume fixed node factors, but real-world links can depend on existing ones.
method Introduces causal lifting and structural pairwise embeddings for path-dependent link prediction.
result Validated on three scenarios, demonstrating improved accuracy for causal link prediction.

Knot Theory is currently a very broad field. Even a long survey can only cover a narrow area. Here we concentrate on the path from Goeritz matrices to quasi-alternating links. On the way, we often stray from the main road and tell related stories, especially if they allow as to place the main topic in a historical cont…

2009-09-06abs ↗pdf ↗

The ``Links-Gould invariant'' is a two-variable Laurent polynomial invariant of oriented (1,1) tangles, which is derived from the representation of the braid generator associated with the one-parameter family of four dimensional representations with highest weights (0,0|a) of the quantum superalgebra U_q[gl(2|1)]. We u…

1999-09-13abs ↗pdf ↗

Latent topic models have been successfully applied as an unsupervised topic discovery technique in large document collections. With the proliferation of hypertext document collection such as the Internet, there has also been great interest in extending these approaches to hypertext [6, 9]. These approaches typically mo…

2012-06-13abs ↗pdf ↗

The Reshetikhin-Turaev sl(N) polynomial of links colored by wedge powers of the defining representation has been categorified via several different approaches. Here, we give a concise introduction to the categorification using matrix factorizations, which is a direct generalization of the Khovanov-Rozansky homology. Fu…

2011-10-10abs ↗pdf ↗

In this paper, a regional knot invariant is constructed. Like the Wirtinger presentation of a knot group, each planar region contributes a generator, and each crossing contributes a relation. The invariant is call a tridle of the link. As in the quandle theory, one can define Alexander quandle and get Alexander polynom…

2017-03-17abs ↗pdf ↗

The estimation of probabilities of network edges from the observed adjacency matrix has important applications to predicting missing links and network denoising. It has usually been addressed by estimating the graphon, a function that determines the matrix of edge probabilities, but this is ill-defined without strong a…

2015-09-29abs ↗pdf ↗

BIDIFAC+ factorizes linked matrices for cancer studies.

problem Integrating multiple omics platforms across various cancer types.
method Flexible approach to simultaneous factorization and decomposition of linked matrices using BIDIFAC+.
result Identifies shared and specific modes of variability across multiple omics platforms and cancer types.

We introduce a matrix representation of a chord on a tangle which leads us to representing tangle chord diagrams as stacks of matrices that we call books. We show that band sum moves, Reidemeister moves as well as orientation changes are implemented on \widetilde{Z}_f - a framed link invariant constructed from the Kont…

2010-10-14abs ↗pdf ↗

This talk is a report on joint work with A. Vaintrob [arXiv:math.CO/0109104 and math.GT/0111102]. It is organised as follows. We begin by recalling how the classical Matrix-Tree Theorem relates two different expressions for the lowest degree coefficient of the Alexander-Conway polynomial of a link. We then state our fo…

2002-11-04abs ↗pdf ↗

We extend the notion of intersection graphs for knots in the theory of finite type invariants to string links. We use our definition to develop weight systems for string links via the adjacency matrix of the intersection graph, and show that these weight systems are related to the weight systems induced by the Conway a…

2003-12-17abs ↗pdf ↗

We explain an algorithm for finding a boundary link Seifert matrix for a given Alexander polynomial. The algorithm depends on several choices and therefore makes it possible to find non-equivalent Seifert matrices for a given Alexander polynomial.

2003-05-28abs ↗pdf ↗

Nonnegative sectional curvature linked to matrix displacement convexity.

problem Nonnegative sectional curvature in Riemannian manifolds.
method Matrix displacement convexity as a criterion for nonnegative sectional curvature.
result Entropy functional matrix displacement convexity implies nonnegative sectional curvature.