arXiv research

The stochastic block model is a powerful tool for inferring community structure from network topology. However, it predicts a Poisson degree distribution within each community, while most real-world networks have a heavy-tailed degree distribution. The degree-corrected block model can accommodate arbitrary degree distr…

Simply-connected surfaces of general type for n≥5.

Extends graph degree theorem to simplicial closure of Auter space.

The problem of finding all minimal surfaces presented in parametric form as polynomials of certain degree is discussed by many authors. It is known that the classical Enneper surface is (up to position in space and homothety) the only polynomial minimal surface of degree 3 in isothermal parameters. In higher degrees th…

Generalizes Hopf degree theorem to nontrivial bundles.

The study constructs balanced and rigid curves on specific types of hypersurfaces and complete intersections.

The paper explores how different network architectures learn logical functions under GOTU, finding that a min-degree-interpolator is learned.

We study the degree of polynomial representations of knots. We obtain the lexicographic degree for two-bridge torus knots and generalized twist knots. The proof uses the braid theoretical method developed by Orevkov to study real plane curves, combined with previous results from [KP10] and [BKP14]. We also give a sharp…

For harmonic maps of degree 2, a similar quantitative stability estimate does not hold uniformly.

The degree of certain holomorphic 2-spheres is bounded.

We study generalizations of finite-type knot invariants obtained by replacing the crossing change in the Vassiliev skein relation by some other local move, analyzing in detail the band-pass and doubled-delta moves. Using braid-theoretic techniques, we show that, for a large class of local moves, generalized Goussarov's…

New measure for nonrationality of toric quasifolds.

Upper bounds on map degrees for various manifold types.

Study integrable geodesic flows on 2-surfaces with high-degree polynomial first integrals.

Homotopy classes of nanowords and nanophrases are combinatorial generalizations of virtual knots and links. Goussarov, Polyak and Viro defined finite type invariants for virtual knots and links via semi-virtual crossings. We extend their definition to nanowords and nanophrases. We study finite type invariants of low de…

As it is well-known, all Vassiliev invariants of degree one of a knot $K\subset R^3$ are trivial. There are nontrivial Vassiliev invariants of degree one, when the ambient space is not $R^3$. Recently, T. Fiedler introduced such invariants of a knot in an $R^1$-fibration over a surface $F$. They take values in the free…

A new distribution family extends the $\alpha$-stable distribution with a degree of freedom parameter.

Measures neural network complexity via effective degrees of freedom.

Solves generalized twisted rabbit problems for higher degree polynomials.

The paper constructs simplicial maps of any degree on spheres, solving a long-standing problem.

Homology groups of spaces of nonsingular polynomial embeddings ${\bf R}^1 \to {\bf R}^n$ of degrees $\le 4$ are calculated. A general algebraic technique of such calculations for spaces of polynomial knots of arbitrary degrees is described.

In this paper, we adapt the differential signature construction to the equivalence problem for complex plane algebraic curves under the actions of the projective group and its subgroups. Given an action of a group $G$, a signature map assigns to a plane algebraic curve another plane algebraic curve (a signature curve) …

We prove duality theorems for twisted Reidemeister torsions and twisted Alexander polynomials generalizing the results of Turaev. As a corollary we determine the parity of the degrees of twisted Alexander polynomials of 3-manifolds in many cases.

FairACE improves fairness in GNNs by balancing node performance across degree groups.

The degree-$d$ Chow parameters of a Boolean function $f: \{-1,1\}^n \to \mathbb{R}$ are its degree at most $d$ Fourier coefficients. It is well-known that degree-$d$ Chow parameters uniquely characterize degree-$d$ polynomial threshold functions (PTFs) within the space of all bounded functions. In this paper, we prove …

This paper finds all prime alternating knots with minimal warping degree two.

Graph data widely exist in many high-impact applications. Inspired by the success of deep learning in grid-structured data, graph neural network models have been proposed to learn powerful node-level or graph-level representation. However, most of the existing graph neural networks suffer from the following limitations…

(d+1)-colored graphs, i.e. edge-colored graphs that are (d+1)-regular, have already been proved to be a useful representation tool for compact PL d-manifolds, thus extending the theory (known as crystallization theory) originally developed for the closed case. In this context, combinatorially defined PL invariants play…

Enhanced invariant for linkoids using quivers.

Study robustness of polynomial neural networks using algebraic geometry.

Study Kazdan-Warner equations on graphs using Brouwer degree theory.

We study the map degrees between quasitoric 4-manifolds. Our results rely on Theorems proved by Duan and Wang. We determine the set D (M, N) of all possible map degrees from M to N when M and N are certain quasitoric 4-manifolds. The obtained sets of integers are interesting, e. g. those representable as the sum of two…

In this paper, we investigate twist sequences for Kauffman finite-type invariants and Goussarov-Polyak-Viro finite-type invariants. It is shown that one obtains a Kauffman or GPV type of degree $\le n$ if and only if an invariant is a polynomial of degree $\le n$ on every twist lattice of the right form. The main resul…

This paper describes an equivalence of the canonical category of $\mathbb N$-manifolds of degree $2$ with a category of involutive double vector bundles. More precisely, we show how involutive double vector bundles are in duality with double vector bundles endowed with a linear metric. We describe then how special sect…

Formula connects linking coefficients to Kontsevich integral coefficients.

The stochastic block model (SBM) is a popular framework for studying community detection in networks. This model is limited by the assumption that all nodes in the same community are statistically equivalent and have equal expected degrees. The degree-corrected stochastic block model (DCSBM) is a natural extension of S…

Consider a complete orientable manifold with countably many components of bounded dimension. Suppose that its rational homology is infinitely generated in some degree. Then there is no choice of weight function for which the natural map from weighted L^2 cohomology to de Rham cohomology is surjective in that degree.

Regularization aims to improve prediction performance of a given statistical modeling approach by moving to a second approach which achieves worse training error but is expected to have fewer degrees of freedom, i.e., better agreement between training and prediction error. We show here, however, that this expected beha…

In Stochastic blockmodels, which are among the most prominent statistical models for cluster analysis of complex networks, clusters are defined as groups of nodes with statistically similar link probabilities within and between groups. A recent extension by Karrer and Newman incorporates a node degree correction to mod…

The study finds lower bounds for the warping degree of a knot projection.

We apply Murasugi-Tristram inequality to real algebraic curves of odd degree on $RP^2$ with a deep nest, i.e. a nest of the depth $k-1$ where $2k+1$ is the degree. For such curves, the ingredients of the Murasugi-Tristram inequality can be computed (or estimated) inductively using the computations for iterated torus li…

The colored HOMLFY polynomial is an important knot invariant depending on two variables $a$ and $q$. We give bounds on the degree in both $a$ and $q$ generalizing Morton's bounds \cite{Mo86} for the ordinary HOMFLY polynomial. Our bounds suggest that the degree detects certain incompressible surfaces in the knot comple…

New formula recovers degree of colored Jones polynomials for pretzel knots.

Christoffel function characterizes the corruption a bounded-degree certificate cannot remove in robust halfspace learning.

The proliferation of models for networks raises challenging problems of model selection: the data are sparse and globally dependent, and models are typically high-dimensional and have large numbers of latent variables. Together, these issues mean that the usual model-selection criteria do not work properly for networks…

Study shows neural ODEs generalize well on synthetic graphs but struggle with degree heterogeneity and clustering.

The aim of the current paper is to explore the implications on the group $G$ of the non-vanishing of the cohomology in degree one of one of its representation $π$, given some mixing conditions on $π$. In one direction, harmonic cocycles are used to show that the FC-centre should be finite (for mildly mixing unitary rep…

Research examines curves of degree 8 with specific singularities.