𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Random nearest neighbor and influence graphs on Zd

✍ Scribed by S. Nanda; C. M. Newman

Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
175 KB
Volume
15
Category
Article
ISSN
1042-9832

No coin nor oath required. For personal study only.

✦ Synopsis

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 to energy minimization searches in disordered Ising models) have a percolation transition.

πŸ“œ SIMILAR VOLUMES

The random bipartite nearest neighbor gr
The random bipartite nearest neighbor graphs
✍ Boris Pittel; Robert S. Weishaar πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 301 KB

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.

Nearest Neighbor Classification Rule for
Nearest Neighbor Classification Rule for Mixtures of Discrete and Continuous Random Variables
✍ T. J. Wojciechowski πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 297 KB πŸ‘ 2 views

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

Derivation of nearest-neighbor propertie
Derivation of nearest-neighbor properties from data on nucleic acid oligomers. I. Simple sets of independent sequences and the influence of absent nearest neighbors
✍ Donald M. Gray πŸ“‚ Article πŸ“… 1997 πŸ› Wiley (John Wiley & Sons) 🌐 English βš– 86 KB πŸ‘ 2 views

The constraints on combinations of nearest neighbors in nucleic acid sequences and the numbers of independent sequences needed to describe nearest-neighbor properties of oligomers and polymers are derived and summarized. It has been pointed out in previous work [D.