Random nearest neighbor and influence graphs on Zd

S. Nanda, C. M. Newman

Research output: Contribution to journalArticle

Abstract

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 languageEnglish (US)
Pages (from-to)262-278
Number of pages17
JournalRandom Structures and Algorithms
Volume15
Issue number3-4
DOIs
StatePublished - Jan 1 1999

ASJC Scopus subject areas

  • Software
  • Mathematics(all)
  • Computer Graphics and Computer-Aided Design
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Random nearest neighbor and influence graphs on Z<sup>d</sup>'. Together they form a unique fingerprint.

  • Cite this