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

Trend · papers per month

6.7%13.3%20.0%26.7% · Feb 199519922001200920182026
48 results for graphlet degree vectors

GoT-WAVE improves temporal network alignment by 25% accuracy and 64% speed.

problem Finding conserved network regions in temporal networks.
method Using graphlet-orbit transitions (GoTs) as a dynamic node similarity measure within DynaWAVE.
result GoT-WAVE outperforms DynaWAVE in accuracy and speed on synthetic networks.

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 …

2017-02-01abs ↗pdf ↗

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…

2018-02-23abs ↗pdf ↗

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 …

2015-06-13abs ↗pdf ↗

GraphMoE generates random graphs using neural networks and graphlets.

problem Learning generative models for random graphs.
method GraphMoE uses a neural network trained with graphlets and subgraph counts to match the distribution of random graphs.
result GraphMoE can generate graphs that mimic various real-world datasets and fool graph classifiers.

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…

2017-01-06abs ↗pdf ↗

Improved protein structure classification using weighted graphlets and deep neural networks.

problem Protein structure classification for function prediction.
method Developed a weighted network and graphlet-based measure, combined with a deep neural network.
result Significantly improved performance on 36 real datasets compared to existing methods.

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…

2016-10-04abs ↗pdf ↗

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…

2016-08-18abs ↗pdf ↗

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…

2012-04-29abs ↗pdf ↗

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…

2018-04-12abs ↗pdf ↗

This paper describes an equivalence of the canonical category of N\mathbb N-manifolds of degree 22 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…

2017-07-21abs ↗pdf ↗

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…

2017-04-28abs ↗pdf ↗

The paper proposes a new model to analyze directed networks and accurately estimate community memberships.

problem Modeling and estimating community memberships in directed networks with heterogeneous degrees.
method Directed Degree Corrected Mixed Membership (DiDCMM) model and DiMSC algorithm.
result The proposed DiMSC algorithm is asymptotically consistent and provides error bounds for community membership vectors.

The paper studies submanifolds of fixed degree with constraints on variations.

problem Variations of submanifolds of fixed degree in a graded manifold.
method Formulates area functional and associated variational vector fields, derives partial differential equations, and computes Euler-Lagrange equations.
result Mean curvature operator can be of third order when deformability condition holds.

Characterizes differential forms and vector fields with constant coefficients on manifolds.

problem Understanding constant coefficient differential forms and vector fields on manifolds.
method Analyzes differential forms and vector fields of specific degrees, proving obstructions and characterizing solutions to partial differential systems.
result Characterizes differential forms and vector fields with constant coefficients of various degrees on smooth manifolds.

For any compact oriented manifold MM, we show that that the top degree multi-vector fields transverse to the zero section of topTM\wedge^{\text{top}}TM 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…

2002-09-26abs ↗pdf ↗

Constructing transitive nilpotent Lie algebras from dilations and analyzing their prolongations.

problem Understanding the derivations of Tanaka prolongations of transitive nilpotent Lie algebras.
method Constructing transitive nilpotent Lie algebras from dilations and analyzing their prolongations.
result Derivations of degree 0 are given by vector fields of degree 0, and the Tanaka prolongation recovers the whole algebra of polynomial vectors defined by the dilation.

Improves community detection in directed networks with theoretical guarantees.

problem Degree heterogeneity affects community detection in directed networks.
method Introduced D-SCORE algorithm and established theoretical guarantees for Directed-DCBM.
result Established theoretical guarantees and provided improvements for D-SCORE.

We construct the full linearisation functor which takes a graded bundle of degree kk (a particular kind of graded manifold) and produces a kk-fold vector bundle. We fully characterise the image of the full linearisation functor and show that we obtain a subcategory of kk-fold vector bundles consisting of symmetric $…

2015-12-08abs ↗pdf ↗

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…

2013-06-10abs ↗pdf ↗

Develops differential KO-character to determine real vector bundles in multiples of 8.

problem Determining real vector bundles in multiples of 8.
method Constructs eta-invariants and differential KO-character to determine differential KO-theory.
result Eta-invariants and index invariants completely determine differential KO-theory in degree (0 mod 8).

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…

2014-04-04abs ↗pdf ↗

Vector bundles and double vector bundles, or 22-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…

2016-11-28abs ↗pdf ↗

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…

2015-03-03abs ↗pdf ↗

The paper studies a method to sample nodes from a massive graph using personalized PageRank.

problem Sampling from a massive network is expensive and impractical; the paper provides an alternative.
method The paper introduces a crawling method to approximate the personalized PageRank vector without querying the entire graph.
result The adjusted personalized PageRank vector can effectively select nodes within the same block as the seed node.

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…

2003-05-14abs ↗pdf ↗

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…

2017-03-09abs ↗pdf ↗