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.

168,742 papers · 148 categories

Trend · papers per month

9.5%18.9%28.4%37.9% · May 201919922001200920172026
48 results for graphical hypergeometric networks

Study spherical Fourier transform on hypergeometric type harmonic manifolds.

problem Spherical Fourier transform on harmonic Hadamard manifolds.
method Representation of spherical functions by Gauss hypergeometric functions.
result Inversion formula, convolution rule, and Plancherel theorem are derived.

Harmonic manifolds of hypergeometric type have entropy bounds related to real hyperbolic spaces.

problem Bounding the volume entropy of harmonic manifolds of hypergeometric type.
method Normalized Ricci curvature and entropy analysis.
result Upper and lower bounds for volume entropy of harmonic manifolds of hypergeometric type.

Proposes a differentiable hypergeometric distribution for learning group importance.

problem Learning the sizes of subsets in applications like clustering and weakly-supervised learning.
method Introduces a reparameterizable hypergeometric distribution to model group sizes and learn their relative importance.
result Outperforms previous methods in weakly-supervised learning and clustering.

Estimates unknown population sizes using the hypergeometric distribution.

problem Estimating discrete distributions with unknown population sizes and category sizes.
method Proposes a novel solution using the hypergeometric likelihood, accounting for a data generating process with a latent variable.
result Empirically demonstrates superior performance in estimating population sizes and learning latent spaces compared to other methods.

This paper establishes certain existence and classification results for solutions to SU(n)SU(n) Toda systems with three singular sources at 0, 1, and \infty. First, we determine the necessary conditions for such an SU(n)SU(n) Toda system to be related to an nnth order hypergeometric equation. Then, we construct solutions …

2016-10-11abs ↗pdf ↗

Study of line congruences for Appell's rank-4 hypergeometric functions.

problem Understanding line congruences for Appell's rank-4 hypergeometric functions.
method Derived original formulae for Laplace transform of rank-4 system, applied to geometry of surfaces defined by these functions.
result Natural line congruences for Laplace transforms of Appell's rank-4 functions form a W-congruence.

The aim of this text is to establish some relations between Markov chains in Dirichlet Environments on directed graphs and certain hypergeometric integrals associated with a particular arrangement of hyperplanes. We deduce from these relations and the computation of the connexion obtained by moving one hyperplane of th…

2005-10-11abs ↗pdf ↗

We first show that hypergeometric functions appear naturally as spectral functions when applying pseudo-differential calculus to decipher heat kernel asymptotic in the situation where the symbol algebra is noncommutative. Such observation leads to a unified (works for arbitrary dimension) method of computing the modula…

2017-11-05abs ↗pdf ↗

We derive a factorization of the Alexander polynomial of the 4-strand Turk's head knot using hypergeometric representations.

problem Deriving a factorization of the Alexander polynomial of the 4-strand Turk's head knot
method Using the reduced Burau representation and multivariable resultant elimination over reciprocal constraints
result Deriving a factorization of the Alexander polynomial in terms of Chebyshev polynomials

New groups discovered with unique properties in a specific space.

problem Finding new discrete subgroups with special properties in a mathematical space.
method Proved by showing groups play ping-pong on cones, related to crooked surfaces.
result Infinite family of discrete subgroups with remarkable properties in Sp4(R){Sp}_4(\mathbb{R}).

In this article we show the duality between tensor networks and undirected graphical models with discrete variables. We study tensor networks on hypergraphs, which we call tensor hypernetworks. We show that the tensor hypernetwork on a hypergraph exactly corresponds to the graphical model given by the dual hypergraph. …

2017-10-04abs ↗pdf ↗

We propose Graphical Generative Adversarial Networks (Graphical-GAN) to model structured data. Graphical-GAN conjoins the power of Bayesian networks on compactly representing the dependency structures among random variables and that of generative adversarial networks on learning expressive dependency functions. We intr…

2018-04-10abs ↗pdf ↗

Graphical normalizing flows use Bayesian networks to improve normalizing flows' interpretability and performance.

problem Improving the interpretability and performance of normalizing flows.
method Revisiting normalizing flows as probabilistic graphical models, proposing graphical normalizing flows with either prescribed or learnable graph structures.
result Graphical conditioners lead to competitive white box density estimators.

Undirected graphical models, or Markov networks, are a popular class of statistical models, used in a wide variety of applications. Popular instances of this class include Gaussian graphical models and Ising models. In many settings, however, it might not be clear which subclass of graphical models to use, particularly…

2013-01-17abs ↗pdf ↗

The aim of this chapter is twofold. In the first part we will provide a brief overview of the mathematical and statistical foundations of graphical models, along with their fundamental properties, estimation and basic inference procedures. In particular we will develop Markov networks (also known as Markov random field…

2010-05-06abs ↗pdf ↗

Deep networks can approximate score functions in high-dimensional graphical models efficiently.

problem Approximation efficiency of score functions by deep neural networks in high-dimensional graphical models like Markov random fields.
method Variational inference denoising algorithms and efficient neural network representation.
result Efficient sample complexity bound for diffusion-based generative modeling when score functions are learned by deep neural networks.

rags2ridges simplifies graphical modeling of high-dimensional data.

problem Graphical modeling of high-dimensional precision matrices.
method Modular framework for extraction, visualization, and analysis of Gaussian graphical models.
result Provides a one-stop-shop for graphical modeling of high-dimensional precision matrices.

Paper introduces MGLasso for multiscale graph inference in clustering and network analysis.

problem Graphical models in high-dimensional data analysis need to handle clustering and sparsity simultaneously.
method MGLasso combines clustering and graph inference through a convex relaxation of k-means and hierarchical clustering. It uses CONESTA for regularization.
result MGLasso improves network interpretability by estimating graphs at multiple scales.

Bayesian method for estimating functional graphical models from neuroimaging data.

problem Estimating dependence structures from functional data in neuroscience.
method Fully Bayesian regularization scheme, including direct Bayesian analog of functional graphical lasso and graphical horseshoe.
result Insight into brain compensation after traumatic brain injury.

Explicit computation of Kontsevich weights for symplectic Poisson structures.

problem Computing weights of Kontsevich graphs in symplectic Poisson structures.
method Detailed explicit computation using hypergeometric functions and simpler formulas.
result Explicit expressions for curvature weights and their simplification in cotangent bundles.

In the genus one case, we make explicit some constructions of Veech on flat surfaces and generalize some geometric results of Thurston about moduli spaces of flat spheres as well as some equivalent ones but of an analytico-cohomological nature of Deligne-Mostow, which concern the monodromy of Appell-Lauricella hypergeo…

2016-05-08abs ↗pdf ↗

This paper develops a nonparametric model for complex network data.

problem Capturing conditional independence structure in multivariate data with heterogeneous graph structures.
method Integrates network embedding with nonparametric graphical model estimation, solving a linear equation system.
result The proposed method effectively recovers heterogeneous graph structures without distributional assumptions.

In this paper we develop a methodology to analyze and compare multiple global networks. We focus our analysis on the relation between human migration and trade. First, we identify the subset of products for which the presence of a community of migrants significantly increases trade intensity. To assure comparability ac…

2013-10-14abs ↗pdf ↗

A graphical model is a statistical model that is associated to a graph whose nodes correspond to variables of interest. The edges of the graph reflect allowed conditional dependencies among the variables. Graphical models admit computationally convenient factorization properties and have long been a valuable tool for t…

2016-06-07abs ↗pdf ↗

We provide a classification of graphical models according to their representation as subfamilies of exponential families. Undirected graphical models with no hidden variables are linear exponential families (LEFs), directed acyclic graphical models and chain graphs with no hidden variables, including Bayesian networks …

2013-01-30abs ↗pdf ↗

Paper compares two methods for inferring network structures in presence of latent confounders.

problem Inferring network structures in presence of latent confounders.
method Gaussian graphical models with latent variables (LVGGM) and PCA-based removal of confounding (PCA+GGM).
result Proposes a new method combining strengths of LVGGM and PCA+GGM, proving consistency and convergence rate.

This work presents an exact solution to the generalized Heston model, where the model parameters are assumed to have linear time dependence The solution for the model in expressed in terms of confluent hypergeometric functions.

2014-02-23abs ↗pdf ↗

Profile graphical models represent multivariate dependence under varying risk factors.

problem Capturing varying conditional independence structures across different levels of a risk factor.
method Introducing a novel class of graphical models (profile graphical models) that represent multivariate dependence under varying risk factors, and developing a Bayesian approach for learning shared sparsity structures.
result Demonstrated enhanced ability to capture subject-specific differences in protein network data from acute myeloid leukemia.

Neural network method estimates covariate-dependent graphical models with statistical guarantees.

problem Estimating graph structure from covariate-dependent data.
method Neural network approach that allows flexible functional dependency on covariates.
result Theoretical PAC guarantees for the method's performance.