GoT-WAVE improves temporal network alignment by 25% accuracy and 64% speed.
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.
Trend · papers per month
Graph-based methods are known to be successful in many machine learning and pattern classification tasks. These methods consider semi-structured data as graphs where nodes correspond to primitives (parts, interest points, segments, etc.) and edges characterize the relationships between these primitives. However, these …
CNN estimates graphlet counts efficiently from historic graphs.
Exploratory analysis over network data is often limited by the ability to efficiently calculate graph statistics, which can provide a model-free understanding of the macroscopic properties of a network. We introduce a framework for estimating the graphlet count---the number of occurrences of a small subgraph motif (e.g…
Enhances graph-based pattern recognition by preserving structural information.
From social science to biology, numerous applications often rely on graphlets for intuitive and meaningful characterization of networks at both the global macro-level as well as the local micro-level. While graphlets have witnessed a tremendous success and impact in a variety of domains, there has yet to be a fast and …
GraphMoE generates random graphs using neural networks and graphlets.
Graphlets are induced subgraphs of a large network and are important for understanding and modeling complex networks. Despite their practical importance, graphlets have been severely limited to applications and domains with relatively small graphs. Most previous work has focused on exact algorithms, however, it is ofte…
Improved protein structure classification using weighted graphlets and deep neural networks.
A faster graph kernel using optical random features.
Repelling random walks improve graph-based sampling efficiency.
Previous work in network analysis has focused on modeling the mixed-memberships of node roles in the graph, but not the roles of edges. We introduce the edge role discovery problem and present a generalizable framework for learning and extracting edge roles from arbitrary graphs automatically. Furthermore, while existi…
Massively parallel architectures such as the GPU are becoming increasingly important due to the recent proliferation of data. In this paper, we propose a key class of hybrid parallel graphlet algorithms that leverages multiple CPUs and GPUs simultaneously for computing k-vertex induced subgraph statistics (called graph…
This paper introduces a novel graph-analytic approach for detecting anomalies in network flow data called GraphPrints. Building on foundational network-mining techniques, our method represents time slices of traffic as a graph, then counts graphlets -- small induced subgraphs that describe local topology. By performing…
Consider a linear regression model where the design matrix X has n rows and p columns. We assume (a) p is much large than n, (b) the coefficient vector beta is sparse in the sense that only a small fraction of its coordinates is nonzero, and (c) the Gram matrix G = X'X is sparse in the sense that each row has relativel…
Experimental determination of protein function is resource-consuming. As an alternative, computational prediction of protein function has received attention. In this context, protein structural classification (PSC) can help, by allowing for determining structural classes of currently unclassified proteins based on thei…
This paper describes an equivalence of the canonical category of -manifolds of degree 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…
This paper presents a general graph representation learning framework called DeepGL for learning deep node and edge representations from large (attributed) graphs. In particular, DeepGL begins by deriving a set of base features (e.g., graphlet features) and automatically learns a multi-layered hierarchical graph repres…
The paper proposes a new model to analyze directed networks and accurately estimate community memberships.
The paper studies submanifolds of fixed degree with constraints on variations.
In this paper, we investigate the relative Gel'fand-Kalinin-Fuks cohomology groups of the formal Hamiltonian vector fields on R^4. In the case of formal Hamiltonian vector fields on R^2, we computed the relative Gel'fand-Kalinin-Fuks cohomology groups of weight <20 in the paper by Mikami-Nakae-Kodama. The main strategy…
Injectivity result for light ray transform on Lorentzian manifolds.
Characterizes differential forms and vector fields with constant coefficients on manifolds.
For any compact oriented manifold , we show that that the top degree multi-vector fields transverse to the zero section of are classified, up to orientation preserving diffeomorphism, in terms of the topology of the arrangement of its zero locus and a finite number of numerical invariants. Th…
Constructing transitive nilpotent Lie algebras from dilations and analyzing their prolongations.
Improves community detection in directed networks with theoretical guarantees.
We construct the full linearisation functor which takes a graded bundle of degree (a particular kind of graded manifold) and produces a -fold vector bundle. We fully characterise the image of the full linearisation functor and show that we obtain a subcategory of -fold vector bundles consisting of symmetric $…
The classification of continuous, translation invariant Minkowski valuations which are contravariant (or covariant) with respect to the complex special linear group is established in a 2-dimensional complex vector space. Every such valuation is given by the sum of a valuation of degree of homogeneity 1 and 3. In dimens…
Develops differential KO-character to determine real vector bundles in multiples of 8.
Measures incompleteness of financial markets using asset rank and acceptance set dimension.
We adapt the notions of stability of holomorphic vector bundles in the sense of Mumford-Takemoto and Hermitian-Einstein metrics in holomorphic vector bundles for canonically polarized framed manifolds, i.e. compact complex manifolds X together with a smooth divisor D such that K_X \otimes [D] is ample. It turns out tha…
The Lagrangian description of mechanical systems and the Legendre Transformation (considered as a passage from the Lagrangian to the Hamiltonian formulation of the dynamics) for point-like objects, for which the infinitesimal configuration space is TM, is based on the existence of canonical symplectic isomorphisms of d…
We introduce Dolbeault cohomology valued characteristic classes of Higgs bundles over complex manifolds. Flat vector bundles have characteristic classes lying in odd degree de Rham cohomology and a theorem of Reznikov says that these must vanish in degrees three and higher over compact Kähler manifolds. We provide a si…
We compute the cohomology with group ring coefficients of the complement of a finite collection of affine hyperplanes in a finite dimensional complex vector space. It is nonzero in exactly one degree, namely the degree equal to the rank of the hyperplane arrangement.
Vector bundles and double vector bundles, or -fold vector bundles, arise naturally for instance as base spaces for algebraic structures such as Lie algebroids, Courant algebroids and double Lie algebroids. It is known that all these structures possess a unified description using the language of super\-geometry and g…
New equivalences found between graded supermanifolds and vector bundles.
Two pseudo-Riemannian metrics are called projectively equivalent if their unparametrized geodesics coincide. The degree of mobility of a metric is the dimension of the space of metrics that are projectively equivalent to it. We give a complete list of possible values for the degree of mobility of Riemannian and Lorentz…
A new method joins two arcs with a degree of freedom.
We give an explicit formula for the projectively invariant quantization map between the space of symbols of degree three and the space of third-order linear differential operators, both viewed as modules over the group of diffeomorphisms and the Lie algebra of vector fields on a manifold.
We give a method to construct stable vector bundles whose rank divides the degree over curves of genus bigger than one. The method complements the one given by Newstead. Finally, we make some systematic remarks and observations in connection with rationality of moduli spaces of stable vector bundles.
Discover new identities linking hypersurface mean curvatures.
For a unit vector field on a closed immersed Euclidean hypersurface , , we exhibit a nontrivial lower bound for its energy which depends on the degree of the Gauss map of the immersion. When the hypersurface is the unit sphere , immersed with degree one, this lower bound correspond…
Topological degrees of continuous mappings between manifolds of even dimension are studied in terms of index theory of pseudo-differential operators. The index formalism of non-commutative geometry is used to derive analytic integral formulas for the index of a 0:th order pseudo-differential operator twisted by a Hölde…
The paper studies a method to sample nodes from a massive graph using personalized PageRank.
New algorithm learns PTFs with noisy data efficiently.
We provide a variational description of any Liouville (i.e. volume preserving) autonomous vector fields on a smooth manifold. This is obtained via a ``maximal degree'' variational principle; critical sections for this are integral manifolds for the Liouville vector field. We work in coordinates and provide explicit for…
Introduces homogeneity supermanifolds for studying graded structures.
In reinforcement learning, the state of the real world is often represented by feature vectors. However, not all of the features may be pertinent for solving the current task. We propose Feature Selection Explore and Exploit (FS-EE), an algorithm that automatically selects the necessary features while learning a Factor…