Boundary touching probability and nested-path exponent for nonsimple CLE

In this paper, we consider a distributed detection scenario where a number of remote sensors is linked to a decision fusion center by a fading multiaccess channel. The communication is assumed to be noncoherent meaning that channel gains are unknown at both sensors and the fusion center. Each sensor makes a binary local decision and communicates it to the fusion center simultaneously. We investigate the detection performance of the system in terms of error probability and error exponent under both Rayleigh and Rician fading scenarios. We reveal that on-off keying is the most energy efficient modulation scheme when the channel is subject to Rayleigh fading and that optimizing the modulation scheme can lead to a gain in error exponent under Rician fading scenario. Under both fading scenarios, optimal decision fusion rules can be reduced to simple threshold tests.

We present new series data for both high- and low-density bond and site percolation on the square lattice. The series have been obtained by the finite-lattice method, and in all cases extend pre-existing series. An analysis of these series gives refined estimates of critical points, critical exponents and amplitudes for bond and site animals, and for the percolation probability and mean-size exponents.

A three-dimensional downward leader model incorporating geometric and physical characteristics

An efficient numerical method of studying nonresonant stellarator divertors was introduced in Boozer and Punjabi [Phys. Plasmas 25, 092505 (2018)]. This method is used in this paper to study a different magnetic field model of a nonresonant divertor. The most novel and interesting finding of this study is that diffusive magnetic field lines can be distinguished from lines that exit through the primary and the secondary turnstile, and that below some diffusive velocity, all lines exit through only the primary turnstile. The footprints of each family are stellarator symmetric and have a fixed location on the wall for all velocities. The probability exponent of the primary turnstile is d1 = 9/4 and that of the secondary turnstile is d2 = −3/2. This study also addresses the issues of an inadequate separation of the chamber walls from the outermost confining magnetic surface and a marginal step size of the numerical integrations that could compromise the interpretation of the earlier results [Boozer and Punjabi, Phys. Plasmas 25, 092505 (2018)]. The previous value of d1 = 2 is within the error bar of d1 = 9/4 estimated here.

The problem of multiple hypothesis testing (HT) for arbitrarily varying sources (AVS) is considered. The achievable error probability exponents (reliabilities) region is derived, optimal decision schemes are described. The result extends the known ones by Fu and Shen and by Tuncel. The Chernoff bounds for AVS binary and M-ary HT are specified via indication of a Sanov theorem for those sources.

In quantum illumination, the signal mode of light, entangled with an idler mode, is dispatched towards a suspected object bathed in thermal noise and the returning mode, along with the stored idler mode, is measured to determine the presence or absence of the object. In this process, entanglement is destroyed but its benefits in the form of classical correlations and enlarged Hilbert space survive. Here, we propose the use of probe state hyperentangled in two degrees of freedom - polarization and frequency, to achieve a significant 12dB performance improvement in error probability exponent over the best known quantum illumination procedure in the low noise regime. We present a simple receiver model using four optical parametric amplifiers (OPA) that exploits hyperentanglement in the probe state to match the performance of the feed-forward sum-frequency generator (FF-SFG) receiver in the high noise regime. By replacing each OPA in the proposed model with a FF-SFG receiver, further 3dB improvement in the performance of a lone FF-SFG receiver can be seen.

We construct a random coding bound for E-capacity region of the discrete memoryless broadcast channel with confidential messages (BCC). When error probability exponents are going to zero, the limit of this bound coincides with the capacity region of the BCC obtained by Csiszar and Korner. The notion of E-capacity region is used also for estimation of equivocation rate.