Random nearest neighbor and influence graphs on Zd

@article{Nanda1999RandomNN,
  title={Random nearest neighbor and influence graphs on Zd},
  author={S. Nanda and Charles M. Newman},
  journal={Random Struct. Algorithms},
  year={1999},
  volume={15},
  pages={262-278}
}
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. © 1999 John Wiley & Sons, Inc. Random Struct. Alg., 15, 262–278, 1999 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Nontrivial phase transition in a dependent parametric bond percolation model

  • M. Harris, R. Meester
  • Markov Processes and Related Fields 2
  • 1996
Highly Influential
1 Excerpt

Dynamics of Ising spin systems at zero temperature

  • Y. Suhov
  • 1997

Topics in Disordered Systems

  • C. M. Newman
  • Birkhäuser, Basel
  • 1997
1 Excerpt

Similar Papers

Loading similar papers…