Random nearest neighbor and influence graphs with vertex set Zd 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.
|Original language||English (US)|
|Number of pages||17|
|Journal||Random Structures and Algorithms|
|State||Published - 1999|
ASJC Scopus subject areas
- Computer Graphics and Computer-Aided Design
- Applied Mathematics