#### Filter Results:

- Full text PDF available (34)

#### Publication Year

1969

2008

- This year (0)
- Last 5 years (0)
- Last 10 years (24)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Gordon Simons
- 1969

PrQcedures are exhibited and analyzed for converting a sequence of iid Bernoulli variables with unknown mean p into a Bernoulli variable with mean 1/2. The efficiency of several procedures is studied.

When k(x,Y) "<.is~a quasi-monotone function a.'1d the random variables X and Y have fixed distributions, it is sho1~ under some further mild conditions that Ek(X,Y) is a monotone functional of the joint distribution function of X and Y. Its infimum and supremum are both attained and correspond to explicitly described joint distribution functions. * Research… (More)

Suppose you have u units of ammunition and want to destroy as many as possible of a sequence of attacking enemy aircraft. If you fire v = v(u), 0 ~ v ~ u, units of your ammunition at the first enemy, it survives with probability qv, where 0 < q < 1 is given, and then kills you. With the complementary probability, 1 qV, you destroy the aircraft and you live… (More)

- Gordon Simons
- IEEE Trans. Information Theory
- 1991

- Sándor Csörgo, Gordon Simons
- Periodica Mathematica Hungarica
- 2005

General linear combinations of independent winnings in generalized St. Petersburg games are interpreted as individual gains that result from pooling strategies of different cooperative players. A weak law of large numbers is proved for all such combinations, along with some almost sure results for the smallest and largest accumulation points, and a… (More)

- Krzysztof Podgórski, Gordon Simons, Yi-Wen Ma
- IEEE Trans. Information Theory
- 1998

We consider a binary symmetric channel where the input, modeled as an innnite sequence of bits, is distorted by a Bernoulli noise. In 8], a consistent estimator of the distortion, i.e., of the probability that a single bit is changed, is described under the basic assumption that the complexity of the input is nite. Here, we deal with two shortcomings: 1.… (More)

For an arbitrary point of a homogeneous Poisson point process in a d-dimen-siona! Euclidean space, consider the number of Poisson points that have that given point as their r-th nearest neighbor (r = 1,2,...). It is shown that as d tends to infinity, these nearest neighbor counts (r = 1,2,...) are tid asymptotically Poisson with mean 1. The proof relies on… (More)

- Gordon Simons, Yi-Ching Yao
- Random Struct. Algorithms
- 1996

In the last century, Desire Andre obtained many remarkable properties of the numbers of alternating permutations, linking them to trigonometric functions among other things. By considering the probability that a random permutation is alternating and that a random sequence (from a uniform distribution) is alternating, and by conditioning on the first element… (More)

- Sándor Csörgo, Gordon Simons
- Periodica Mathematica Hungarica
- 2008

Based on a stochastic extension of Karamata’s theory of slowly varying functions, necessary and sufficient conditions are established for weak laws of large numbers for arbitrary linear combinations of independent and identically distributed nonnegative random variables. The class of applicable distributions, herein described, extends beyond that for sample… (More)

- Stamatis Cambanis, Robert Keenert, Gordon Simons, Norman L. Johnson
- 2008

A random vector is said to have a I-symmetric distribution if its characteristic function is of the form ¢(Itll + ••• + Itnl). I-symmetric distributions are characterized through representations of the admissible functions ¢ and through stochastic representations of the random vectors, and some of their properties are studied. AMS 1970 Subject… (More)