This paper extends Alexander invariants to higher-dimensional hypersurface complements.
problem Understanding the topology of higher-dimensional hypersurface complements.
method Defining higher-order Alexander modules and degrees from solvable covers of hypersurface complements.
result Higher-order degrees of hypersurface complements are bounded by a linear combination of local link pairs.
We define new higher-order Alexander modules An(C) and higher-order degrees δn(C) which are invariants of the algebraic planar curve C. These come from analyzing the module structure of the homology of certain solvable covers of the complement of the curve C. These invariants are in the spirit of th…
The study examines higher-order modern portfolio theory with complex critical points and feasible portfolio variety.
problem Understanding the complex critical points and feasible portfolio variety in higher-order modern portfolio theory.
method Established genericity conditions for utility functions with higher-order cumulants, analyzed discriminant loci, and determined the dimension and degree of the feasible portfolio variety.
result The utility function has a constant number of complex critical points under genericity conditions, and the feasible portfolio variety has a determined dimension and degree.
Introduce Collapsed Effective Operators for higher-order structures.
problem Existing spectral operators decompose topology into separate ranks, leaving practitioners to fuse information back to vertices.
method Introduce Collapsed Effective Operators via Schur complementation of a graded Laplacian.
result Preserves positive semi-definiteness, lowers system energy under higher-order connectivity.
Study privacy vs. utility in estimating network parameters with aggregated data.
problem Privacy-preserving estimation of network parameters from aggregated node degrees.
method β model, local and central differential privacy, minimax lower bounds, simple estimators.
result Achieved minimax-optimal risk bounds for parameter estimation under privacy constraints.
The paper extends higher-order operators in higher spin spaces.
problem Generalizing higher-order operators in higher spin spaces.
method Constructing 3rd order fermionic and 4th order bosonic operators in higher spin spaces.
result Fundamental solutions and intertwining operators of 3rd order fermionic and 4th order bosonic operators are presented.
The Milnor degree of a 3-manifold is an invariant that records the maximum simplicity, in terms of higher order linking, of any link in the 3-sphere that can be surgered to give the manifold. This invariant is investigated in the context of torsion linking forms, nilpotent quotients of the fundamental group, Massey pro…
Generative model for hypergraph clustering improves detection of higher-order structure.
problem Detecting clusters in complex relational systems modeled as hypergraphs.
method Poisson degree-corrected hypergraph stochastic blockmodel (DCHSBM) and Louvain-type algorithms.
result AON hypergraph Louvain algorithm efficiently detects higher-order structure in large hypergraphs.
This work improves online SGD's sample complexity for multi-index models by considering higher-order terms.
problem Suboptimal sample complexity for learning multi-index models using online SGD.
method Focus on both second- and higher-order terms to improve sample complexity.
result Online SGD achieves ildeO(dPL−1) samples for multi-index models. We survey various Alexander-type invariants of plane curve complements, with an emphasis on obstructions on the type of groups that can arise as fundamental groups of complements to complex plane curves. Also included are some new computations of higher-order degrees of curves, which are invariants defined in a previou…
We investigate the behavior of the higher-order degrees, db_n, of a finitely presented group G. These db_n are functions from H^1(G;Z) to Z whose values are the degrees certain higher-order Alexander polynomials. We show that if def(G) is at least 1 or G is the fundamental group of a compact, orientable 3-manifold then…
Neural networks can learn from higher-order cumulants efficiently, requiring quadratic samples.
problem Learning from higher-order cumulants in high-dimensional data.
method Spiked cumulant model, polynomial time algorithms, neural networks, random features.
result Neural networks require quadratic samples to learn from higher-order cumulants efficiently, while random features require more samples.
The paper studies inference in hypergraph β-models with multiple layers.
problem Estimating and testing in hypergraph β-models with degree heterogeneity.
method Maximum likelihood estimation and likelihood ratio test for hypergraph β-models with multiple layers.
result The ML estimate and LR test are optimally powerful under the null hypothesis.
This paper improves fMRI analysis by modeling higher-order tensors.
problem Ineffective tensor-based methods in spatially folded fMRI data.
method Higher-order Block Term Decomposition (BTD) applied to 4 or 5 order tensors.
result Demonstrated effectiveness of BTD in fMRI analysis through simulations.
Homology of abelian differentials stabilizes with more zeros.
problem Understanding the homology of abelian differentials with many simple zeros.
method Developed an h-principle for these strata, valid in a range of homological degrees.
result Homology stabilizes in a range where the number of simple zeros is large.
Study describes how conformal metrics behave as Q-curvature changes, forming spherical bubbles.
problem Understanding the asymptotic behavior of conformal metrics with null Q-curvature.
method Analyzes the GJMS operator and uses higher order Bol's inequality to describe the metrics' behavior.
result Normalized conformal metrics form exactly one spherical bubble as λ approaches zero.
LATTE tackles heterogeneous network embedding challenges with layer-stacked attention.
problem Aggregating higher-order indirect relations in heterogeneous networks.
method Layer-stacked ATTention Embedding (LATTE) that decomposes meta relations at each layer.
result LATTE achieves state-of-the-art performance on benchmark datasets.
The paper improves convergence rates of curvature approximations using Regge elements.
problem Improving convergence rates of curvature approximations using Regge elements.
method Investigates the interplay between polynomial degree of curvature lifting and metric tensor degree in Regge finite element space.
result Higher convergence rates are achieved by reducing the polynomial degree of curvature lifting and using linear Regge elements.
We derive a higher-order expansion for rough volatility models.
problem Characterizing and estimating rough volatility models.
method Higher-order asymptotic expansion of characteristic functions.
result Distinct roles of rough and jump dynamics in volatility.
New trapping effect found on degenerate horizons.
problem Understanding degenerate horizons in extreme black holes.
method Wave equation analysis in extremal Reissner-Nordstrom spacetime.
result Degenerate horizons exhibit a global trapping effect.
In all empirical-network studies, the observed properties of economic networks are informative only if compared with a well-defined null model that can quantitatively predict the behavior of such properties in constrained graphs. However, predictions of the available null-model methods can be derived analytically only …
New algorithm learns mixtures of subcubes efficiently, with applications to decision trees.
problem Learning mixtures of subcubes over binary space.
method Higher-order multilinear moments for nO(logk)-time learning. result Polynomial dependence on 1/ε for decision trees with stochastic transitions. We find the complete set of fundamental invariants for systems of ordinary differential equations of order ≥4 under the group of point transformations generalizing similar results for contact invariants of a single ODE and point invariants of systems of the second and the third order. It turns out that starting fr…
A new family of conformal test martingales based on Legendre polynomials for online exchangeability testing.
problem Detecting variance, skewness, and higher-order deviations from uniformity in online data.
method A family of conformal test martingales based on shifted Legendre polynomials.
result The Variational Legendre Jumper reduces exponential scaling to linear time with minimal loss in power.
The international trade network (ITN) has received renewed multidisciplinary interest due to recent advances in network theory. However, it is still unclear whether a network approach conveys additional, nontrivial information with respect to traditional international-economics analyses that describe world trade only i…
The classical abelian invariants of a knot are the Alexander module, which is the first homology group of the the unique infinite cyclic covering space of S^3-K, considered as a module over the (commutative) Laurent polynomial ring, and the Blanchfield linking pairing defined on this module. From the perspective of the…
Link concordance and Whitney towers linked to Milnor invariants.
problem Link concordance and Whitney towers classification.
method Clasper surgeries, Whitney towers, and Milnor invariants.
result Link concordance and Whitney towers classified in terms of Milnor invariants.
Paper analyzes a three-loop linkage, showing it's overconstrained and shaky.
problem Analyzing a three-loop spatial linkage's degree of freedom and configuration space.
method Local analysis of differential degrees of freedom, computation of kinematic tangent cone, and c-space approximation.
result The linkage has a finite degree of freedom 3 and is locally a smooth manifold, making it shaky.
Introduces higher-order clustering coefficients to better understand network structures.
problem Understanding the clustering behavior of higher-order network cliques in complex networks.
method Develops higher-order clustering coefficients as a generalization of traditional clustering coefficients.
result Provides new insights into the structure of real-world networks.
Proves limitations of higher-order optimization for convex problems.
problem Limitations of higher-order optimization methods for convex problems.
method Proves polynomial dependence on approximation guarantee and higher-order smoothness parameters.
result Nesterov's accelerated cubic regularization method is nearly tight.
Graphs improve theorem proving in higher-order logic.
problem Challenges in converting higher-order logic formulas into graph-based representations.
method Used graph neural networks (GNNs) to represent and search higher-order logic.
result GNNs outperform state-of-the-art methods in higher-order theorem proving.
Paper introduces techniques to learn higher-order programs, improving predictive accuracy and reducing learning times.
problem Expressing and learning complex programs in ILP.
method Extending meta-interpretive learning to support higher-order definitions as background knowledge.
result Learning higher-order programs reduces hypothesis space and sample complexity, improving predictive accuracy and reducing learning times.
For certain classes of knots we define geometric invariants called higher-order genera. Each of these invariants is a refinement of the slice genus of a knot. We find lower bounds for the higher-order genera in terms of certain von Neumann ρ-invariants, which we call higher-order signatures. The higher-order genera o…
HONE learns higher-order network embeddings from graph data.
problem Capturing higher-order structures in network data.
method HONE framework based on network motifs, with interchangeable components.
result HONE outperforms other embedding methods by up to 75% in AUC.
Stability of capillary hypersurfaces with higher order mean curvature.
problem Stability of capillary hypersurfaces with constant higher order mean curvature.
method Generalization of classical stability theory for capillary hypersurfaces.
result Results on stability for capillary hypersurfaces with higher order mean curvature.
Study higher order fermionic and bosonic operators on cylinders and Hopf manifolds.
problem Understanding higher order higher spin operators on specific manifolds.
method Analysis of higher order operators on cylinders and Hopf manifolds.
result Construction of kernels for these operators on the studied manifolds.
ISP improves GNN expressivity by stratifying nodes based on graph invariants.
problem Graph Neural Networks struggle with expressivity and structural heterogeneity.
method Invariant-Stratified Propagation (ISP) using ISP-WL and ISPGNN.
result ISP achieves enhanced expressivity beyond 1-WL, with theoretical guarantees and practical improvements.
New methods for faster ranking and link prediction using higher-order motifs.
problem Real-time ranking and link prediction in applications like web search.
method Higher-order ranking and link prediction methods based on closing higher-order network motifs.
result The methods are faster and more efficient than existing methods based on closing triangles.
The paper improves CR Sobolev inequalities and classifies minimizers.
problem Higher-order CR Sobolev inequalities on the CR sphere.
method Improvement through vanishing higher order moments of the volume element.
result New direct proof of minimizers' classification and existence of minimizers in C2k(N). Novel algorithm for decentralized optimization in time-varying networks with delays.
problem Decentralized optimization in networks with communication delays.
method DT-GO algorithm, applicable to general directed graphs, converges to same complexity as centralized SGD.
result Algorithm DT-GO achieves convergence rates for convex and non-convex objectives, similar to centralized SGD.
In this paper we develop a geometric approach to higher order mechanics on graded bundles in both, the Lagrangian and Hamiltonian formalism, via the recently discovered weighted algebroids. We present the corresponding Tulczyjew triple for this higher order situation and derive in this framework the phase equations fro…
A new method predicts higher-order interactions in evolving graphs using simplicial complexes.
problem Predicting higher-order interactions in dynamic graphs with theoretical guarantees.
method Capturing higher-order interactions as simplices, modeling neighborhoods with face-vectors, and developing a nonparametric kernel estimator.
result Our method outperforms existing higher-order prediction methods and is theoretically consistent.
The paper glosses different forms of an introducing of higher order tangent-like functors, especially functors derived from higher order nonholonomic tangent functors. A special attention is devoted to higher order osculating bundles: their identification with higher order tangent bundles is demonstrated as the main re…
Novel higher-order group synchronization for noisy local measurements on hypergraphs.
problem Synchronizing higher-order local measurements on hyperedges to global estimates on nodes.
method Message passing algorithm for global synchronization of higher-order measurements.
result Higher-order method outperforms standard pairwise synchronization methods in certain applications.
Higher-order tangent bundles have geometric structures compatible with their iterated bundle structure.
problem Connection towers and Sasaki metrics on higher-order tangent bundles
method Introduce the notion of a connection tower and study the geometric structures induced by such towers.
result Connection towers determine multiconnections, adapted splittings, and canonical vector bundle structures.
The paper introduces a new concept of higher order approximate differentiability for sets.
problem Characterizing higher order rectifiable sets.
method Introducing the approximate differential of order k for subsets of Euclidean space.
result The approximate differential of order k is a Borel map whose domain is a Borel set.
Study higher-order interactions in networks, proposing link prediction as a new benchmark.
problem Understanding higher-order interactions in complex systems.
method Temporal analysis of 19 datasets, focusing on interactions involving more than two nodes.
result Higher-order interactions are consistent across different systems, with tie strength and edge density influencing their presence.
We use the Frölicher-Nijenhuis formalism to reformulate the inverse problem of the calculus of variations for a system of differential equations of order 2k in terms of a semi-basic 1-form of order k. Within this general context, we use the homogeneity proposed by Crampin and Saunders in [14] to formulate and discuss t…