Results 1 to 10 of about 45 (42)
Randomly Stopped Sums with Generalized Subexponential Distribution
Let {ξ1,ξ2,…} be a sequence of independent possibly differently distributed random variables, defined on a probability space (Ω,F,P) with distribution functions {Fξ1,Fξ2,…}. Let η be a counting random variable independent of sequence {ξ1,ξ2,…}.
Jūratė Karasevičienė, Jonas Šiaulys
doaj +3 more sources
In this paper, we find conditions under which distribution functions of randomly stopped minimum, maximum, minimum of sums and maximum of sums belong to the class of generalized subexponential distributions.
Jūratė Karasevičienė, Jonas Šiaulys
doaj +2 more sources
Product Convolution of Generalized Subexponential Distributions
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
A note on product-convolution for generalized subexponential distributions
In this paper, we consider the stability property of the class of generalized subexponential distributions with respect to product-convolution. Assuming that the primary distribution is in the class of generalized subexponential distributions, we find conditions for the second distribution in order that their product-convolution belongs to the class of
Konstantinides, Dimitrios +2 more
openaire +2 more sources
A general framework for subexponential discrete logarithm algorithms [PDF]
A large family of cryptographic systems is based on the difficulty of the discrete logarithm problem: Given a group \(G\) and some element \(a\in G\) and \(b\) such that \(b \in \langle a\rangle\) find an integer \(n\) with \(a^n = b\). Groups used for this purpose include the multiplicative group of finite fields, the class group of number fields ...
Enge, Andreas, Gaudry, Pierrick
openaire +2 more sources
A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs [PDF]
Subexponential parameterized algorithms are known for a wide range of natural problems on planar graphs, but the techniques are usually highly problem specific. The goal of this paper is to introduce a framework for obtaining n^{O(\sqrt{k})} time algorithms for a family of graph modification problems that includes problems that can be seen as ...
Marx, Dániel +3 more
openaire +2 more sources
Tails in generalized Jackson networks with subexponential service-time distributions [PDF]
We give the exact asymptotics of the tail of the stationary maximal dater in generalized Jackson networks with subexponential service times. This maximal dater, which is an analogue of the workload in an isolated queue, gives the time taken to clear all customers present at some time t when stopping all arrivals that take place later than t. We use the
Baccelli, François +2 more
openaire +2 more sources
Infinite divisibility and generalized subexponentiality
The authors study O-subexponential distributions. A one-sided distribution \(\mu\) is O-subexponen\-tial if \[ \limsup_{x\to\infty}(\mu\ast\mu)(x,\infty)/\mu(x,\infty)
Shimura, Takaaki, Watanabe, Toshiro
openaire +3 more sources
The local asymptotic estimation for the supremum of a random walk with generalized strong subexponential summands [PDF]
26 ...
Wang, Yuebao +3 more
openaire +2 more sources
General nonexact oracle inequalities for classes with a subexponential envelope
We show that empirical risk minimization procedures and regularized empirical risk minimization procedures satisfy nonexact oracle inequalities in an unbounded framework, under the assumption that the class has a subexponential envelope function. The main novelty, in addition to the boundedness assumption free setup, is that those inequalities can ...
Mendelson, Shahar, Lecué, Guillaume
openaire +5 more sources

