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.

169,181 papers · 148 categories

Trend · papers per month

20406080 · Jul 202619922001200920182026
48 results for signed count

A Gauss diagram is a simple, combinatorial way to present a knot. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting (with signs and multiplicities) subdiagrams of certain combinatorial types. These formulas generalize the calculation of a linking number by coun…

2012-09-03abs ↗pdf ↗

Paper solves curvature prescription on unit ball with sign-changing functions.

problem Prescribing mean curvature on the unit ball with sign-changing functions.
method Negative gradient flow method to realize ff as mean curvature.
result Proves that a sign-changing function ff can be realized as the boundary mean curvature of a conformal metric.

CSNE embeds signed networks by separating structural and fine-grained information.

problem Improving sign prediction in signed networks using inaccurate or incomplete balance theories.
method Conditional Signed Network Embedding (CSNE) models structural and fine-grained information separately, integrating them rigorously.
result CSNE outperforms state-of-the-art on sign prediction tasks, and MaxEnt priors are competitive in resource-constrained settings.

A new test statistic counts tree co-occurrences to detect edge correlation between networks.

problem Detecting edge correlation between networks using latent vertex correspondence.
method The test statistic is based on counting co-occurrences of signed trees for a family of non-isomorphic trees.
result The test runs in n2+o(1)n^{2+o(1)} time and succeeds with high probability for large nn.

We study the quandle counting invariant for a certain family of finite quandles with trivial orbit subquandles. We show how these invariants determine the linking number of classical two-component links up to sign.

2006-08-21abs ↗pdf ↗

We show that a generic real projective n-dimensional hypersurface of degree 2n-1 contains "many" real lines, namely, not less than (2n-1)!!, which is approximately the square root of the number of complex lines. This estimate is based on the interpretation of a suitable signed count of the lines as the Euler number of …

2012-01-13abs ↗pdf ↗

The paper introduces DP algorithms using random projections and sign random projections for improved privacy in machine learning.

problem Improving differential privacy in machine learning applications.
method Developed algorithms based on random projections and sign random projections, focusing on individual differential privacy (iDP) and standard differential privacy (DP).
result DP-SignOPORP and iDP-SignRP achieve superior performance in differential privacy, especially for small epsilon values.

The paper generalizes knot signatures to tori using representations and invariants.

problem Generalizing knot signatures to tori and defining new invariants.
method Defining a signed count of irreducible representations for tori complements and relating it to known invariants.
result Defines a new invariant for tori that recovers known invariants and connects to Floer homology.

We define an integer valued invariant for two-component links in S^3 by counting projective SU(2) representations of the link group having non-trivial second Stiefel-Whitney class. We show that our invariant is, up to sign, the linking number of the link. Our construction generalizes that of X.-S. Lin who defined a sim…

2009-07-06abs ↗pdf ↗

Study Euler and Chern classes of tautological line bundles on polygon moduli spaces.

problem Understanding topological properties of flexible polygon configurations.
method Analyzing tautological line bundles and their classes on moduli spaces.
result Interpretation of intersection numbers as signed counts of triangular configurations.

We study the following question: given a set P of 3d-2 points and an immersed curve G in the real plane R^2, all in general position, how many real rational plane curves of degree d pass through these points and are tangent to this curve. We count each such curve with a certain sign, and present an explicit formula for…

2010-11-07abs ↗pdf ↗

We derive a gauge theoretic invariant of integral homology 3-spheres which counts gauge orbits of irreducible, perturbed flat SU(3) connections with sign given by spectral flow. To compensate for the dependence of this sum on perturbations, the invariant includes contributions from the reducible, perturbed flat orbits.…

1998-09-22abs ↗pdf ↗

The famous Whitney formula relates the winding number of the smooth generic curve in the real plane to the number of its self-intersection points counted with appropriate signs. We extend this formula to smooth immersions of R^n to R^{2n}. Then use this result together with the general technique of Laplace integrals to…

1998-01-10abs ↗pdf ↗

Given a smooth, closed, oriented 4-manifold X and alpha in H_2(X,Z) such that alpha.alpha > 0, a closed 2-form w is constructed, Poincare dual to alpha, which is symplectic on the complement of a finite set of unknotted circles. The number of circles, counted with sign, is given by d = (c_1(s)^2 -3sigma(X) -2chi(X))/4,…

2004-01-15abs ↗pdf ↗

Consider the standard symplectic $(\RR^{2n}, ω_0)$, a point $p\in\RR^{2n}$ and an immersed closed orientable hypersurface $Σ\subset\RR^{2n}\minus\{p\}$, all in general position. We study the following passage/tangency question: how many lines in $\RR^{2n}$ pass through pp and tangent to ΣΣ parallel to the 1-dimension…

2013-09-04abs ↗pdf ↗

The paper improves NBR for count data using elastic-net regularization, achieving consistency and weak signal detection.

problem Sparse negative binomial regression for count data with non-asymptotic advantages.
method Elastic-net estimator with oracle inequalities derived under Compatibility Factor Condition and Stabil Condition.
result Sign consistency and grouping effect with high probability, and true variable set recovery under certain conditions.

The study counts critical points of Steklov eigenfunctions on manifolds.

problem Counting critical points of Steklov eigenfunctions on manifolds.
method Established an identity relating indexes of eigenfunctions and their restrictions to the boundary, and used it to count critical points.
result A precise count of interior critical points of Steklov eigenfunctions in terms of manifold's Euler characteristic and boundary sign changes.

Analysis of DPPs and k-DPPs via spectral decomposition reveals identifiable parameters and non-identifiability gaps.

problem Identifying parameters of DPPs and k-DPPs through spectral decomposition.
method Spectral decomposition of the covariance matrix, analysis of invariances, and counting arguments.
result Identifiability of parameters changes fundamentally for k-DPPs, with specific invariances and non-identifiability gaps.

Study reveals limits of detecting local geometry in random graphs.

problem Detecting local geometry in random graphs with hidden communities.
method Introduced model and used information-theoretic and computational limits to investigate detection.
result Detection threshold determined at d=Θ~(k2k6/n3)d = \widetildeΘ(k^2 \vee k^6/n^3) for fixed pp.

Probabilistic theory counts intersections in Riemannian spaces.

problem Counting intersections in Riemannian homogeneous spaces.
method Introduces probabilistic intersection ring HE(M)\mathrm{H}_{\mathbb E}(M), a graded commutative and associative real Banach algebra.
result Probabilistic intersection ring structure defined for spheres, real projective space, and complex projective space.

Characterizes components of representations space for punctured surfaces.

problem Characterizing connected components of representations space.
method Using relative Euler classes, signs of peripheral elements, and generalized Milnor-Wood inequality.
result Counted total number of connected components of type-preserving representations.

Results are obtained on extending flat vector bundles or equivalently general representations from the fundamental group of S, a connected subsurface of the connected boundary of a compact, connected, oriented 3-dimensional manifold, to the whole manifold M. These are applied to representations of fundamental groups of…

2014-05-22abs ↗pdf ↗

New spin on Hurwitz theory connects to Gromov-Witten theory and topological recursion.

problem Counting ramified covers with sign from theta characteristics.
method Using polynomiality properties and spectral curves, proving equivalence to ELSV formula.
result Spin Hurwitz numbers are computed via ELSV formula involving Chiodo class.

Study on signed graphs with random signs, focusing on community detection.

problem Community detection in signed stochastic block models.
method Strong concentration inequalities for adjacency and Laplacian matrices, applied to signed Laplacian matrix.
result The sign of the first eigenvector of the Laplacian matrix defines a weakly consistent estimator for balanced community detection.

SELO model predicts link signs better than SDGNN using subgraph encoding and linear optimization.

problem Inferring the sign of links in signed networks with limited sign data.
method Subgraph Encoding via Linear Optimization (SELO) approach to learn edge embeddings.
result SELO model outperforms state-of-the-art methods on multiple real-world signed networks.

We argue that the standard graph Laplacian is preferable for spectral partitioning of signed graphs compared to the signed Laplacian. Simple examples demonstrate that partitioning based on signs of components of the leading eigenvectors of the signed Laplacian may be meaningless, in contrast to partitioning based on th…

2017-01-05abs ↗pdf ↗

Novel GNN for signed and directed networks using magnetic signed Laplacian.

problem Efficiently modeling signed and directed networks for tasks like clustering and link prediction.
method Introduced a magnetic signed Laplacian for directed signed graphs, used it to construct a spectral GNN.
result Demonstrated effective performance on tasks involving signed and directional information.

Improved node classification in signed social networks using diffuse interface methods.

problem Classifying nodes in signed social networks (positive and negative interactions).
method Diffuse interface methods based on Ginzburg-Landau functional and extended graph Laplacian.
result Performance improvement in real signed social networks, outperforming state of the art.

Sign equivariant networks improve model expressiveness for spectral geometric learning.

problem Limited expressiveness of sign invariant models for tasks like graph link prediction.
method Developed sign equivariant neural network architectures based on new analytic sign equivariant polynomials.
result Sign equivariant models achieve theoretical benefits in spectral geometric learning tasks.

ExCIR provides efficient, consistent, and scalable explainability for complex models.

problem Complex models lack transparency and require efficient, stable, and scalable explainability methods.
method ExCIR uses correlation-aware feature attribution with robust centering and groupwise aggregation.
result ExCIR delivers trustworthy agreement with global baselines and full model rankings, reduces runtime, and scales to large datasets.