Random nearest neighbor and influence graphs on Zd

S. Nanda; C. M. Newman

doi:10.1002/(SICI)1098-2418(199910/12)15:3/4<262::AID-RSA5>3.0.CO;2-7

Random nearest neighbor and influence graphs on Z^d

S. Nanda, C. M. Newman

Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English (US)
Pages (from-to)	262-278
Number of pages	17
Journal	Random Structures and Algorithms
Volume	15
Issue number	3-4
DOIs	https://doi.org/10.1002/(SICI)1098-2418(199910/12)15:3/4<262::AID-RSA5>3.0.CO;2-7
State	Published - 1999

ASJC Scopus subject areas

Software
General Mathematics
Computer Graphics and Computer-Aided Design
Applied Mathematics

Access to Document

10.1002/(SICI)1098-2418(199910/12)15:3/4<262::AID-RSA5>3.0.CO;2-7

Cite this

@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 Newman, {C. M.}",

year = "1999",

doi = "10.1002/(SICI)1098-2418(199910/12)15:3/4<262::AID-RSA5>3.0.CO;2-7",

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, C. M.

PY - 1999

Y1 - 1999

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

U2 - 10.1002/(SICI)1098-2418(199910/12)15:3/4<262::AID-RSA5>3.0.CO;2-7

DO - 10.1002/(SICI)1098-2418(199910/12)15:3/4<262::AID-RSA5>3.0.CO;2-7

M3 - Article

AN - SCOPUS:0033441959

SN - 1042-9832

VL - 15

SP - 262

EP - 278

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

IS - 3-4

ER -

Random nearest neighbor and influence graphs on Z^d

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this