Results 11 to 20 of about 676 (93)

Free subexponentiality

open access: yesThe Annals of Probability, 2013
In this article, we introduce the notion of free subexponentiality, which extends the notion of subexponentiality in the classical probability setup to the noncommutative probability spaces under freeness.
Hazra, Rajat Subhra, Maulik, Krishanu
core   +3 more sources

Subexponential LPs Approximate Max-Cut [PDF]

open access: yes2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020
We show that for every $\varepsilon > 0$, the degree-$n^\varepsilon$ Sherali-Adams linear program (with $\exp(\tilde{O}(n^\varepsilon))$ variables and constraints) approximates the maximum cut problem within a factor of $(\frac{1}{2}+\varepsilon')$, for some $\varepsilon'(\varepsilon) > 0$. Our result provides a surprising converse to known lower
Hopkins, Samuel B.   +2 more
openaire   +3 more sources

Subexponential Parameterized Algorithms

open access: yesComputer Science Review, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dorn, F., Fomin, F.V., Thilikos, D.M.
openaire   +3 more sources

Pseudodeterministic constructions in subexponential time [PDF]

open access: yesProceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017
We study pseudodeterministic constructions, i.e., randomized algorithms which output the same solution on most computation paths. We establish unconditionally that there is an infinite sequence $\{p_n\}_{n \in \mathbb{N}}$ of increasing primes and a randomized algorithm $A$ running in expected sub-exponential time such that for each $n$, on input $1 ...
Oliveira, I, Santhanam, R
openaire   +4 more sources

A subexponential algorithm for ARRIVAL

open access: yes, 2021
ISBN:978-3-95977-195 ...
Gärtner, Bernd   +2 more
openaire   +5 more sources

Compound Sums and Subexponentiality [PDF]

open access: yesBernoulli, 1999
An intuitive interpretation of the subexponential distributions is that a sum of two independent random variables can only exceed a large threshold \(x\) if one of the random variables exceeds the threshold \(x\). A special class of the subexponential distributions is the class of distributions with a regularly varying tail.
openaire   +2 more sources

Product Convolution of Generalized Subexponential Distributions

open access: yesMathematics, 2023
Assume that ξ and η are two independent random variables with distribution functions Fξ and Fη, respectively. The distribution of a random variable ξη, denoted by Fξ⊗Fη, is called the product-convolution of Fξ and Fη. It is proved that Fξ⊗Fη is a generalized subexponential distribution if Fξ belongs to the class of generalized subexponential ...
Gustas Mikutavičius, Jonas Šiaulys
openaire   +3 more sources

Reduced Load Equivalence under Subexponentiality [PDF]

open access: yesQueueing Systems, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jelenkovic, P.R.   +2 more
openaire   +2 more sources

Asymptotics of Random Contractions [PDF]

open access: yes, 2010
In this paper we discuss the asymptotic behaviour of random contractions $X=RS$, where $R$, with distribution function $F$, is a positive random variable independent of $S\in (0,1)$. Random contractions appear naturally in insurance and finance.
Anthony G. Pakes   +39 more
core   +1 more source

Subexponential groups in 4–manifold topology [PDF]

open access: yesGeometry & Topology, 2000
We present a new, more elementary proof of the Freedman-Teichner result that the geometric classification techniques (surgery, s-cobordism, and pseudoisotopy) hold for topological 4-manifolds with groups of subexponential growth. In an appendix Freedman and Teichner give a correction to their original proof, and reformulate the growth estimates in ...
Krushkal, Vyacheslav S, Quinn, Frank
openaire   +4 more sources

Home - About - Disclaimer - Privacy