We consider the diameter of a random graph G n p for various ranges of p close to the phase transition point for connectivity. For a disconnected graph G, we use the convention that the diameter of G is the maximum diameter of its connected components. We show that almost surely the diameter of rand
STATISTICAL PROPERTIES OF RANDOM SPARSE ARRAYS
โ Scribed by H. KOOK; P. DAVIES; J.S. BOLTON
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 939 KB
- Volume
- 255
- Category
- Article
- ISSN
- 0022-460X
No coin nor oath required. For personal study only.
โฆ Synopsis
Theoretical models that can be used to predict the range of mainlobe widths and the probability distribution of the peak sidelobe levels of two-dimensionally sparse arrays are presented here. The arrays are considered to comprise microphones that are randomly positioned on a segmented grid of a given size. First, approximate expressions for the mean and variance of the squared magnitude of the aperture smoothing function are formulated for the random arrays considered in the present study. By using the variance function, the mean value and the lower end of the range i.e., the "rst 1 per cent of the mainlobe width distribution, can be predicted with reasonable accuracy. To predict the probability distribution of the peak sidelobe levels, distributions of levels were modelled by using a Weibull distribution at each peak in the sidelobe region of the mean squared magnitude of the aperture smoothing function. The two parameters of the Weibull distribution were estimated from the means and variances of the levels at the corresponding locations. Next, the probability distribution of the peak sidelobe levels were identi"ed by following a procedure in which the peak sideload level was determined as the maximum among a "nite number of independent random sidelobe levels. It was found that the model obtained from that approach predicts the probability density function of the peak sidelobe level distribution reasonably well for the various combinations of the two di!erent numbers of microphones and the various grid sizes tested in the present study. The application of these models to the design of random, sparse arrays having speci"ed performance levels is discussed.
๐ SIMILAR VOLUMES
Recurrent neural networks with full symmetric connectivity have been extensively studied as associative memories and pattern recognition devices. However, there is considerable evidence that sparse, asymmetrically connected, mainly excitatory networks with broadly directed inhibition are more consis
The performance of the greedy coloring algorithm ''first fit'' on sparse random graphs G and on random trees is investigated. In each case, approximately n, c r n log log n colors are used, the exact number being concentrated almost surely on at 2 most two consecutive integers for a sparse random gr
Statistical properties of several models of fractional random point processes have been analyzed from the counting and time interval statistics points of view. Based on the criterion of the reduced variance, it is seen that such processes exhibit nonclassical properties. The conditions for these pro
By using a new concept of the discrete amplitude, we examine the statistical properties of narrow-banded random waves. The main results are as follows: (1) the wave height distribution follows the Rayleigh distribution in the case of an infinitely narrow-banded spectrum in the strict sense; (2) the