Random nearest neighbor and influence graphs with vertex set Z d are defined and their percolation properties are studied. The nearest neighbor graph has (with probability 1) only finite connected components and a superexponentially decaying connectivity function. Influence graphs (which are related
The random bipartite nearest neighbor graphs
β Scribed by Boris Pittel; Robert S. Weishaar
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 301 KB
- Volume
- 15
- Category
- Article
- ISSN
- 1042-9832
No coin nor oath required. For personal study only.
β¦ Synopsis
The bipartite kth nearest neighbor graphs B are studied. It is shown that B k 1 has a limiting expected matching number of approximately 80% of its vertices, that with high Ε½ . probability whp B has at least 2 log nr13 log log n vertices not matched, and that whp B 2 3
does have a perfect matching. We also find a formula for the limiting probability that B is 2 connected and show that whp B is connected.
π SIMILAR VOLUMES
In this paper very simple nonparametric c l d i c a t i o n rule for mixtures of discrete and oonhuons random variables is described. It ie based on the method of neatest neighbor proposed by COVEB and HABT (1967). The bounds on the limit of the near& neighbor ruleriske are given. Both lower and upp
## Abstract The variableβtemperature proton nmr spectra of the oligoribonucleotides in the series CpAp__X__ and the series ApGp__X__, __X__ = A, G, C, U, together with the parent dimers CpA and ApG have been measured. A complete analysis of all the nonexchangeable base proton resonances and ribose