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

87174261348 · Jun 202019922001200920172026
48 results for Graph Cartesian Product

The Cartesian subgroup in graph products of groups is studied with bounds and algorithms.

problem Understanding the structure of Cartesian subgroups in graph products of groups.
method Theory of polyhedral products, lower and upper bounds, algorithm for small presentations.
result Bounds on the number of relations and deficiency in presentations of Cartesian groups.

COMBO optimizes Bayesian Optimization for combinatorial search spaces.

problem Optimizing objectives on combinatorial search spaces with high-order interactions.
method COMBO uses a combinatorial graph and ARD diffusion kernel with Horseshoe prior for efficient modeling and variable selection.
result COMBO outperforms state-of-the-art methods consistently across various benchmarks.

The study bounds the effective diameter of graphs with positive Ollivier curvature.

problem Bounding the effective diameter of graphs with positive Ollivier curvature.
method Introducing reflective graphs and proving discrete Bonnet Myers theorem.
result The effective diameter bound is attained only for specific graphs.

Many signals on Cartesian product graphs appear in the real world, such as digital images, sensor observation time series, and movie ratings on Netflix. These signals are "multi-dimensional" and have directional characteristics along each factor graph. However, the existing graph Fourier transform does not distinguish …

2017-12-21abs ↗pdf ↗

Study on balanced Hermitian structures on Lie algebras twisted by representations.

problem Conditions for balanced and locally conformally balanced Hermitian structures on Lie algebras.
method Analysis of Hermitian structures on twisted cartesian products of Lie algebras.
result Classification of six-dimensional balanced Hermitian twisted cartesian products Lie algebras.

We study the Ollivier-Ricci curvature of graphs as a function of the chosen idleness. We show that this idleness function is concave and piecewise linear with at most 33 linear parts, with at most 22 linear parts in the case of a regular graph. We then apply our result to show that the idleness function of the Cartes…

2017-04-14abs ↗pdf ↗

The paper explores curvatures on graphs and their implications for Ricci flatness.

problem Comparing and understanding different curvature notions on graphs and their implications for Ricci flatness.
method Analyzing Ollivier Ricci curvature and Bakry-Émery curvature on combinatorial graphs, investigating graph products, and proving curvature properties.
result Non-negativity of Ollivier Ricci curvature implies non-negativity of Bakry-Émery curvature under specific conditions.

The decomposability of a Cartesian product of two nondecomposable manifolds into products of lower dimensional manifolds is studied. For 3-manifolds we obtain an analog of a result due to Borsuk for surfaces, and in higher dimensions we show that similar analogs do not exist unless one imposes further restrictions such…

2017-11-30abs ↗pdf ↗

We show that the Cartesian product of three hereditarily infinite dimensional compact metric spaces is never hereditarily infinite dimensional. It is quite surprising that the proof of this fact (and this is the only proof known to the author) essentially relies on algebraic topology.

2012-12-12abs ↗pdf ↗

New curvature tensor and matrices for connection graphs derived from Bakry-Émery curvature.

problem Deriving Buser-type bounds on eigenvalues of connection Laplacians.
method Reformulation of Bakry-Émery curvature through curvature matrices and tensor representations.
result Extension of curvature matrices to connection graphs, addressing eigenfunction challenges.

We study the Bakry-Émery curvature function KG,x:(0,]R\mathcal{K}_{G,x}:(0,\infty]\to \mathbb{R} of a vertex xx in a locally finite graph GG systematically. Here KG,x(N)\mathcal{K}_{G,x}(\mathcal{N}) is defined as the optimal curvature lower bound K\mathcal{K} in the Bakry-Émery curvature-dimension inequality $CD(\mathcal{K},\ma…

2016-06-05abs ↗pdf ↗

The paper reformulates Bakry-Émery curvature on graphs using eigenvalues.

problem Analyzing curvature on weighted graphs.
method Reformulating curvature as the smallest eigenvalue of a rank one perturbation of the curvature matrix.
result The curvature function is analytic, strictly monotone increasing, and concave until a threshold, after which it is constant.

Efficiently infers sparse networks from count data with reduced memory usage.

problem Sparse network inference for count data with high dimensions and dependencies.
method Improved Bigraphical Lasso using eigenvalue decomposition of Cartesian product graph.
result Reduced computational complexity from O(n2p2)O(n^2p^2) to O(n2+p2)O(n^2 + p^2).

Characterizes graphs with Lin-Lu-Yau curvature at least one and explores bone-idle graphs.

problem Characterizing graphs with specific curvature properties.
method Study of Ollivier-Ricci curvature and Lin-Lu-Yau curvature, exploration of regular graphs, and exact formula derivation.
result Characterizes edges that are bone-idle in regular graphs and provides a complete characterization of 4-regular bone-idle graphs.

We study an extention of total variation denoising over images to over Cartesian power graphs and its applications to estimating non-parametric network models. The power graph fused lasso (PGFL) segments a matrix by exploiting a known graphical structure, GG, over the rows and columns. Our main results shows that for …

2018-05-25abs ↗pdf ↗

We prove that if a compact nilmanifold Γ\GΓ\backslash G is endowed with a Vaisman structure, then GG is isomorphic to the Cartesian product of the Heisenberg group with R\mathbb{R}.

2016-05-09abs ↗pdf ↗

We make an estimation of the value of the Gromov norm of the Cartesian product of two surfaces. Our method uses a connection between these norms and the minimal size of triangulations of the products of two polygons. This allows us to prove that the Gromov norm of this product is between 32 and 52 when both factors hav…

2004-07-12abs ↗pdf ↗

A free action of the direct product of two copies of the symmetric group on 3 elements on the cartesian product of two copies of the 3-sphere is constructed. This nonlinear action is constructed using surgery. The action provides a counterexample to a conjecture of Lewis made in 1968.

1998-06-06abs ↗pdf ↗

In this note we derive enumerative formulas for several types of labelled acyclic directed graphs by slight modifications of the familiar recursive formula for simple acyclic digraphs. These considerations are motivated by, and based upon, recent combinatorial results in geometric topology obtained by S.Choi, who estab…

2008-04-15abs ↗pdf ↗

Scalable Gaussian processes with latent Kronecker structure for large datasets.

problem Limited scalability of Gaussian processes for large datasets.
method Leveraging latent Kronecker structure, projecting kernel matrix onto latent Kronecker product, using iterative linear system solvers and pathwise conditioning.
result Outperforms state-of-the-art sparse and variational GPs on real-world datasets with up to five million examples.

We study homogenous Weyl connections with non-positive sectional curvatures. The Cartesian product S1×M\mathbb S^1 \times M carries canonical families of Weyl connections with such a property, for any Riemmanian manifold MM. We prove that if a homogenous Weyl connection on a manifold, modeled on a unimodular Lie group, …

2015-06-26abs ↗pdf ↗

Let B be a fiber bundle with compact fiber F over a compact Riemannian n-manifold M. There is a natural Riemannian metric on the total space B consistent with the metric on M. With respect to that metric, the volume of a rectifiable section s:M--> B is the mass of the image s(M) as a rectifiable n-current in B. Theorem…

2004-03-28abs ↗pdf ↗

EiGLasso speeds up sparse Kronecker-sum covariance estimation.

problem Sparse Kronecker-sum inverse covariance estimation challenges in scalability and parameter identification.
method Newton's method combined with eigendecomposition of sample and feature graphs, approximating Hessian for speed.
result Two to three orders-of-magnitude speed-up on simulated and real-world data.

New limits of minimal surface systems have surprising large interior parts.

problem Minimal surface system limits with large interior vertical and non-minimal portions.
method Construction of limits with smallest possible dimension and codimension.
result Limits of minimal surface systems can have surprising large interior parts.

CAN approximates explicit feature interactions for CTR prediction.

problem Learning explicit feature interactions from sparse features.
method Co-Action Network approximates explicit pairwise feature interactions without introducing too many additional parameters.
result CAN outperforms state-of-the-art CTR models and the cartesian product method.

Generalized are the investigated in other works of the author transports along paths in fibre bundles to transports along arbitrary maps in them. Their structure and some properties are studied. Special attention is paid to the linear case and the case when the map's domain is a Cartesian product of two sets. Also cons…

1997-09-20abs ↗pdf ↗

A simplified proof for embedding higher-dimensional complexes into manifolds.

problem Embedding higher-dimensional complexes into manifolds with constraints.
method A short and accessible proof for the Patak-Tancer theorem.
result A simplified proof for the Heawood inequality in higher dimensions.

Differential chains are a proper subspace of de Rham currents given as an inductive limit of Banach spaces endowed with a geometrically defined strong topology. Boundary is a continuous operator, as are operators that dualize to Hodge star, Lie derivative, pullback and interior product. Partitions of unity exist in thi…

2012-10-16abs ↗pdf ↗