Page 1 Next

Displaying 1 – 20 of 68

Showing per page

Calculation of the detection properties in the binary symmetrical channel

Rychtář, Adam, Klapka, Štěpán, Kárná, Lucie (2021)

Programs and Algorithms of Numerical Mathematics

One of the important parts of railway signalling systems design is the safety of communication, achievable - among others - with the error detecting code. Getting evidence of quantitative safety targets, especially the probability of undetected error of the code, is a surprisingly complicated issue. We've analysed 2048 irreducible self-adjoint generator polynomials of the degree 32. More than 70 of these have a maximum probability of failure lower than the standard codes generally used. In this...

Canonical distributions and phase transitions

K.B. Athreya, J.D.H. Smith (2000)

Discussiones Mathematicae Probability and Statistics

Entropy maximization subject to known expected values is extended to the case where the random variables involved may take on positive infinite values. As a result, an arbitrary probability distribution on a finite set may be realized as a canonical distribution. The Rényi entropy of the distribution arises as a natural by-product of this realization. Starting with the uniform distributionon a proper subset of a set, the canonical distribution of equilibriumstatistical mechanics may be used to exhibit...

Capacity bounds for the CDMA system and a neural network: a moderate deviations approach

Matthias Löwe, Franck Vermet (2009)

ESAIM: Probability and Statistics

We study two systems that are based on sums of weakly dependent Bernoulli random variables that take values ± 1 with equal probabilities. We show that already one step of the so-called soft decision parallel interference cancellation, used in the third generation of mobile telecommunication CDMA, is able to considerably increase the number of users such a system can host. We also consider a variant of the well-known Hopfield model of neural networks. We show that this variant proposed by Amari...

Change-point estimation from indirect observations. 1. Minimax complexity

A. Goldenshluger, A. Juditsky, A. B. Tsybakov, A. Zeevi (2008)

Annales de l'I.H.P. Probabilités et statistiques

We consider the problem of nonparametric estimation of signal singularities from indirect and noisy observations. Here by singularity, we mean a discontinuity (change-point) of the signal or of its derivative. The model of indirect observations we consider is that of a linear transform of the signal, observed in white noise. The estimation problem is analyzed in a minimax framework. We provide lower bounds for minimax risks and propose rate-optimal estimation procedures.

Change-point estimation from indirect observations. 2. Adaptation

A. Goldenshluger, A. Juditsky, A. Tsybakov, A. Zeevi (2008)

Annales de l'I.H.P. Probabilités et statistiques

We focus on the problem of adaptive estimation of signal singularities from indirect and noisy observations. A typical example of such a singularity is a discontinuity (change-point) of the signal or of its derivative. We develop a change-point estimator which adapts to the unknown smoothness of a nuisance deterministic component and to an unknown jump amplitude. We show that the proposed estimator attains optimal adaptive rates of convergence. A simulation study demonstrates reasonable practical...

Currently displaying 1 – 20 of 68

Page 1 Next