Random nearest neighbor and influence graphs on Zd

S. Nanda, Charles 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
StatePublished - Oct 1999

Fingerprint

Ising model
Nearest Neighbor
Nearest Neighbor Graph
Energy Minimization
Graph in graph theory
Connected Components
Ising Model
Connectivity
Vertex of a graph
Influence

ASJC Scopus subject areas

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

Cite this

Random nearest neighbor and influence graphs on Zd . / Nanda, S.; Newman, Charles.

In: Random Structures and Algorithms, Vol. 15, No. 3-4, 10.1999, p. 262-278.

Research output: Contribution to journalArticle

@article{07cded7fb2784d62926e36376739d35b,
title = "Random nearest neighbor and influence graphs on Zd",
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.",
author = "S. Nanda and Charles Newman",
year = "1999",
month = "10",
language = "English (US)",
volume = "15",
pages = "262--278",
journal = "Random Structures and Algorithms",
issn = "1042-9832",
publisher = "John Wiley and Sons Ltd",
number = "3-4",

}

TY - JOUR

T1 - Random nearest neighbor and influence graphs on Zd

AU - Nanda, S.

AU - Newman, Charles

PY - 1999/10

Y1 - 1999/10

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0033441959&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033441959&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0033441959

VL - 15

SP - 262

EP - 278

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

SN - 1042-9832

IS - 3-4

ER -