The Experts below are selected from a list of 102786 Experts worldwide ranked by ideXlab platform
Sergey A Denisov - One of the best experts on this subject based on the ideXlab platform.
-
the sharp corner formation in 2d euler dynamics of patches infinite double Exponential Rate of merging
Archive for Rational Mechanics and Analysis, 2015Co-Authors: Sergey A DenisovAbstract:For the 2D Euler dynamics of patches, we investigate the convergence to the singular stationary solution in the presence of a regular strain. It is proved that the Rate of merging can be double Exponential infinitely in time and the estimates we obtain are sharp.
-
the sharp corner formation in 2d euler dynamics of patches infinite double Exponential Rate of merging
arXiv: Analysis of PDEs, 2012Co-Authors: Sergey A DenisovAbstract:For the 2d Euler dynamics of patches, we investigate the convergence to the singular stationary solutions in the presence of a regular strain. It is proved that the Rate of merging can be made double Exponential for all time.
Matthias Meiners - One of the best experts on this subject based on the ideXlab platform.
-
Exponential Rate of almost sure convergence of intrinsic martingales in supercritical branching random walks
Journal of Applied Probability, 2010Co-Authors: Alexander Iksanov, Matthias MeinersAbstract:We provide sufficient conditions which ensure that the intrinsic martingale in the supercritical branching random walk converges Exponentially fast to its limit. We include in particular the case of Galton-Watson processes so that our results can be seen as a generalization of a result given in the classical treatise by Asmussen and Hering (1983). As an auxiliary tool, we prove ultimate versions of two results concerning the Exponential renewal measures which may be of interest in themselves and which correct, generalize, and simplify some earlier works.
-
Exponential Rate of almost sure convergence of intrinsic martingales in supercritical branching random walks
arXiv: Probability, 2009Co-Authors: Alexander Iksanov, Matthias MeinersAbstract:We provide sufficient conditions which ensure that the intrinsic martingale in the supercritical branching random walk converges Exponentially fast to its limit. The case of Galton-Watson processes is particularly included so that our results can be seen as a generalization of a result given in the classical treatise by Asmussen and Hering. As an auxiliary tool, we prove ultimate versions of two results concerning the Exponential renewal measures which may be interesting on its own and which correct, generalize and simplify some earlier works.
Neri Merhav - One of the best experts on this subject based on the ideXlab platform.
-
a large deviations approach to secure lossy compression
IEEE Transactions on Information Theory, 2017Co-Authors: Nir Weinberger, Neri MerhavAbstract:A Shannon cipher system for memoryless sources in which distortion is allowed at the legitimate decoder is considered. The source is compressed using a secured Rate distortion code, which satisfies a constraint on the compression Rate, as well as a constraint on the Exponential Rate of the excess-distortion probability at the legitimate decoder. Secrecy is measured by the Exponential Rate of the exiguous-distortion probability at the eavesdropper, rather than by the traditional measure of equivocation. The perfect-secrecy exponent is defined as the maximal exiguous-distortion exponent achievable when the key Rate is unlimited. The reproduction-based estimate exponent is defined as the maximal exiguous-distortion exponent achievable for a genie-aided eavesdropper, which knows the secret key. Under limited key Rate, it is proved that the maximal achievable exiguous-distortion exponent is equal to the minimum between the key Rate plus the reproduction-based estimate exponent, and the perfect-secrecy exponent. The result is generalized to a fairly general class of variable key-Rate and coding-Rate codes.
-
a large deviations approach to secure lossy compression
International Symposium on Information Theory, 2016Co-Authors: Nir Weinberger, Neri MerhavAbstract:A Shannon cipher system for memoryless sources is considered, in which distortion is allowed at the legitimate decoder. The source is compressed using a Rate distortion code secured by a shared key, which satisfies a constraint on the compression Rate, as well as a constraint on the Exponential Rate of the excess-distortion probability at the legitimate decoder. Secrecy is measured by the Exponential Rate of the exiguous-distortion probability at the eavesdropper, rather than by the traditional measure of equivocation. The perfect secrecy exponent is defined as the maximal exiguous-distortion exponent achievable when the key Rate is unlimited. Under limited key Rate, it is proved that the maximal achievable exiguous-distortion exponent is equal to the minimum between the average key Rate and the perfect secrecy exponent, for a fairly general class of variable key Rate codes.
Alexander Iksanov - One of the best experts on this subject based on the ideXlab platform.
-
Exponential Rate of almost sure convergence of intrinsic martingales in supercritical branching random walks
Journal of Applied Probability, 2010Co-Authors: Alexander Iksanov, Matthias MeinersAbstract:We provide sufficient conditions which ensure that the intrinsic martingale in the supercritical branching random walk converges Exponentially fast to its limit. We include in particular the case of Galton-Watson processes so that our results can be seen as a generalization of a result given in the classical treatise by Asmussen and Hering (1983). As an auxiliary tool, we prove ultimate versions of two results concerning the Exponential renewal measures which may be of interest in themselves and which correct, generalize, and simplify some earlier works.
-
Exponential Rate of almost sure convergence of intrinsic martingales in supercritical branching random walks
arXiv: Probability, 2009Co-Authors: Alexander Iksanov, Matthias MeinersAbstract:We provide sufficient conditions which ensure that the intrinsic martingale in the supercritical branching random walk converges Exponentially fast to its limit. The case of Galton-Watson processes is particularly included so that our results can be seen as a generalization of a result given in the classical treatise by Asmussen and Hering. As an auxiliary tool, we prove ultimate versions of two results concerning the Exponential renewal measures which may be interesting on its own and which correct, generalize and simplify some earlier works.
Nir Weinberger - One of the best experts on this subject based on the ideXlab platform.
-
a large deviations approach to secure lossy compression
IEEE Transactions on Information Theory, 2017Co-Authors: Nir Weinberger, Neri MerhavAbstract:A Shannon cipher system for memoryless sources in which distortion is allowed at the legitimate decoder is considered. The source is compressed using a secured Rate distortion code, which satisfies a constraint on the compression Rate, as well as a constraint on the Exponential Rate of the excess-distortion probability at the legitimate decoder. Secrecy is measured by the Exponential Rate of the exiguous-distortion probability at the eavesdropper, rather than by the traditional measure of equivocation. The perfect-secrecy exponent is defined as the maximal exiguous-distortion exponent achievable when the key Rate is unlimited. The reproduction-based estimate exponent is defined as the maximal exiguous-distortion exponent achievable for a genie-aided eavesdropper, which knows the secret key. Under limited key Rate, it is proved that the maximal achievable exiguous-distortion exponent is equal to the minimum between the key Rate plus the reproduction-based estimate exponent, and the perfect-secrecy exponent. The result is generalized to a fairly general class of variable key-Rate and coding-Rate codes.
-
a large deviations approach to secure lossy compression
International Symposium on Information Theory, 2016Co-Authors: Nir Weinberger, Neri MerhavAbstract:A Shannon cipher system for memoryless sources is considered, in which distortion is allowed at the legitimate decoder. The source is compressed using a Rate distortion code secured by a shared key, which satisfies a constraint on the compression Rate, as well as a constraint on the Exponential Rate of the excess-distortion probability at the legitimate decoder. Secrecy is measured by the Exponential Rate of the exiguous-distortion probability at the eavesdropper, rather than by the traditional measure of equivocation. The perfect secrecy exponent is defined as the maximal exiguous-distortion exponent achievable when the key Rate is unlimited. Under limited key Rate, it is proved that the maximal achievable exiguous-distortion exponent is equal to the minimum between the average key Rate and the perfect secrecy exponent, for a fairly general class of variable key Rate codes.
