Point-based polygonal models for random graphs
- 1 June 1993
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 25 (2) , 348-372
- https://doi.org/10.2307/1427657
Abstract
We define a class of two-dimensional Markov random graphs with I, V, T and Y-shaped nodes (vertices). These are termed polygonal models. The construction extends our earlier work [1]– [5]. Most of the paper is concerned with consistent polygonal models which are both stationary and isotropic and which admit an alternative description in terms of the trajectories in space and time of a one-dimensional particle system with motion, birth, death and branching. Examples of computer simulations based on this description are given.Keywords
This publication has 11 references indexed in Scilit:
- Consistent polygonal fieldsProbability Theory and Related Fields, 1991
- Markov Random Fields, Stochastic Quantization and Image AnalysisPublished by Springer Nature ,1991
- Nearest-Neighbour Markov Point Processes and Random SetsInternational Statistical Review, 1989
- Markov fields with polygonal realizationsProbability Theory and Related Fields, 1989
- Reconstruction of polygonal imagesJournal of Applied Statistics, 1989
- Hidden symmetry of free Fermion modelTheoretical and Mathematical Physics, 1985
- Percolation in random fields. IITheoretical and Mathematical Physics, 1983
- Estimate of the critical density of Bose-Einstein condensation in a periodic potentialTheoretical and Mathematical Physics, 1983
- Unilateral Markov fieldsAdvances in Applied Probability, 1980
- A three parameter isotropic distribution of atoms and the hard-core square lattice gasThe Journal of Chemical Physics, 1977