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

Trend · papers per month

109217326434 · Jun 202019922001200920172026
48 results for bounded degrees

The entropy-degree theorem applies to Alexandrov spaces with curvature constraints.

problem Geometric obstructions and volume bounds in singular spaces.
method Developed new degree theorem for Alexandrov spaces using integral currents.
result Entropy-volume minimization prevents metric singularities in Gromov-Hausdorff limits.

The resilience of low-degree Rademacher chaos is studied, providing probabilistic lower bounds.

problem Understanding how much a Rademacher chaos can withstand adversarial sign-flips without significant probability changes.
method Probabilistic lower-bound guarantees for the resilience of Rademacher chaos of arbitrary degree.
result Probabilistic lower-bound guarantees for the resilience of Rademacher chaos of arbitrary degree, especially meaningful for constant degree.

Using an idea of Doug Lind, we give a lower bound for the Perron-Frobenius degree of a Perron number that is not totally-real. As an application, we prove that there are cubic Perron numbers whose Perron-Frobenius degrees are arbitrary large; a result known to Lind, McMullen and Thurston. A similar result is proved for…

2017-11-18abs ↗pdf ↗

It is known that the maximal homological degree of the Khovanov homology of a knot gives a lower bound of the minimal positive crossing number of the knot. In this paper, we show that the maximal homological degree of the Khovanov homology of a cabling of a knot gives a lower bound of the minimal positive crossing numb…

2017-01-17abs ↗pdf ↗

We prove diameter bounds for graphs having positive Ricci-curvature bound in Bakry-Emery sense. One result using only curvature and maximal vertex degree is sharp in case of hypercubes. The other result depends on an additional dimension bound, but is independent of the vertex degree. In particular, the second result i…

2016-08-28abs ↗pdf ↗

Graphs with bounded degrees and non-negative Ollivier-Ricci curvature have subexponential growth and diffusive random walk.

problem Understanding geometric properties of graphs with non-negative Ollivier-Ricci curvature.
method Analyzing the geometric properties of graphs with non-negative Ollivier-Ricci curvature, proving subexponential growth and diffusive random walk.
result For graphs with bounded degrees and non-negative Ollivier-Ricci curvature, the average log-volume growth and random walk displacement are subexponential.

Paper connects free-energy and low-degree hardness in high-dimensional statistics.

problem High-dimensional statistical inference problems are computationally hard.
method Defines a free-energy criterion and connects it to low-degree hardness.
result Establishes connection between free-energy and low-degree hardness for Gaussian models.

Christoffel function characterizes the corruption a bounded-degree certificate cannot remove in robust halfspace learning.

problem Robust halfspace learning under malicious noise
method Sum-of-Squares degree of outlier-removal certificate
result Christoffel function bounds the corruption a bounded-degree certificate cannot remove

Survey on using low-degree polynomials to assess statistical tasks complexity.

problem Understanding the complexity of statistical tasks using polynomial functions.
method Applying low-degree polynomials to measure the complexity of statistical tasks, including detection, recovery, and estimation.
result Low-degree polynomials provide a framework to predict and explain statistical-computational tradeoffs.

New method uses almost orthonormal bases to prove low-degree lower bounds in complex statistical models.

problem Proving statistical-computational gaps in high-dimensional models with planted structures.
method Constructing an almost orthonormal polynomial basis under the planted distribution.
result Established new low-degree lower bounds for various complex models.

New bound on Jones polynomial for specific positive links.

problem Finding bounds on the Jones polynomial for positive links.
method Using previous results on positive fibered links, we found a new bound for a specific family of positive links.
result We provided a bound on the maximum degree of the Jones polynomial for positive links with a specific coefficient.

Sharp upper bound for quasi polynomial degree of manifold configuration spaces.

problem Determining the exact degree of quasi-polynomial homology groups of configuration spaces.
method Analyzing extremal homology groups of unordered configuration spaces of manifolds.
result The upper bound for the degree of quasi-polynomials is sharp for every manifold.

New inequality for odd-degree flexible curves using surface doubling.

problem Bounding the number of non-empty ovals of odd-degree flexible curves.
method Defining an Arnold surface for odd-degree flexible curves and using it to derive a Viro--Zvonilov-type inequality.
result Upper bound on the number of non-empty ovals of odd-degree flexible curves.

We study the degree of polynomial representations of knots. We obtain the lexicographic degree for two-bridge torus knots and generalized twist knots. The proof uses the braid theoretical method developed by Orevkov to study real plane curves, combined with previous results from [KP10] and [BKP14]. We also give a sharp…

2014-11-21abs ↗pdf ↗

We develop an algebro-analytic framework for the systematic study of the continuous bounded cohomology of Lie groups in large degree. As an application, we examine the continuous bounded cohomology of PSL(2,R) with trivial real coefficients in all degrees greater than two. We prove a vanishing result for strongly reduc…

2018-11-19abs ↗pdf ↗

Expander graphs have been a focus of attention in computer science in the last four decades. In recent years a high dimensional theory of expanders is emerging. There are several possible generalizations of the theory of expansion to simplicial complexes, among them stand out coboundary expansion and topological expand…

2014-08-27abs ↗pdf ↗

New method explains computational barriers in high-dimensional statistical models.

problem Understanding detection-recovery gaps in high-dimensional inference.
method Combining algorithmic contiguity and cross-validation reduction to obtain conditional computational lower bounds.
result Mild control of low-degree advantage is sufficient to explain computational barriers for recovery.

In this work we present a new local to global criterion for proving a form of high dimensional expansion, which we term cosystolic expansion. Applying this criterion on Ramanujan complexes, yields for every dimension, an infinite family of bounded degree complexes with the topological overlapping property. This answer …

2015-10-03abs ↗pdf ↗

Learn low-degree functions with few random queries.

problem Learning low-degree functions from limited random queries.
method Learn bounded functions f:{1,1}no[1,1]f:\{-1,1\}^n o[-1,1] of degree at most dd with L2L_2-accuracy ε\varepsilon and confidence 1δ1-δ from log(fracnδ)εd1Cd3/2logd\log( frac{n}δ)\,\varepsilon^{-d-1} C^{d^{3/2}\sqrt{\log d}} random queries.
result Learn low-degree functions efficiently with logarithmic number of random queries.

The extreme degrees of the colored Jones polynomial of any link are bounded in terms of concrete data from any link diagram. It is known that these bounds are sharp for semi-adequate diagrams. One of the goals of this paper is to show the converse; if the bounds are sharp then the diagram is semi-adequate. As a result,…

2013-11-23abs ↗pdf ↗

The colored HOMLFY polynomial is an important knot invariant depending on two variables aa and qq. We give bounds on the degree in both aa and qq generalizing Morton's bounds \cite{Mo86} for the ordinary HOMFLY polynomial. Our bounds suggest that the degree detects certain incompressible surfaces in the knot comple…

2014-12-31abs ↗pdf ↗

We propose a novel method for network inference from partially observed edges using a node-specific degree prior. The degree prior is derived from observed edges in the network to be inferred, and its hyper-parameters are determined by cross validation. Then we formulate network inference as a matrix completion problem…

2016-02-07abs ↗pdf ↗

A fundamental problem in network data analysis is to test Erdös-Rényi model G(n,a+b2n)\mathcal{G}\left(n,\frac{a+b}{2n}\right) versus a bisection stochastic block model G(n,an,bn)\mathcal{G}\left(n,\frac{a}{n},\frac{b}{n}\right), where a,b>0a,b>0 are constants that represent the expected degrees of the graphs and nn denotes the number o…

2018-07-12abs ↗pdf ↗

For a single cusped hyperbolic 3-manifold, Hodgson proved that there are only finitely many Dehn fillings of it whose trace fields have bounded degree. In this paper, we conjecture the same for manifolds with more cusps, and give the first positive results in this direction. For example, in the 2-cusped case, if a mani…

2013-05-03abs ↗pdf ↗