Hostname: page-component-848d4c4894-sjtt6 Total loading time: 0 Render date: 2024-06-30T07:11:10.707Z Has data issue: false hasContentIssue false

Point-based polygonal models for random graphs

Published online by Cambridge University Press:  01 July 2016

T. Arak*
Affiliation:
Chalmers University of Technology
P. Clifford*
Affiliation:
University of Oxford
D. Surgailis*
Affiliation:
Institute of Mathematics and Informatics, Vilnius
*
Postal address: School of Mathematics and Computing Sciences, Chalmers University of Technology, S-41296 Göteborg, Sweden.
∗∗Postal address: Department of Statistics, 1 South Parks Road, Oxford OX1 3TG.
∗∗∗Institute of Mathematics and Informatics, 232600 Vilnius, Akademijos 4, Lithuania.

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.

Type
Research Article
Copyright
Copyright © Applied Probability Trust 1993 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Arak, T. (1982) On Markovian random fields with finite number of values 4th USSR–Japan Symp. Probability Theory and Mathematical Statistics. Abstracts of communication, Tbilisi.Google Scholar
[2] Arak, T. (1986) A class of Markov fields with finite range. Proc. Internat. Congr. Mathematicians , Berkeley, 994999.Google Scholar
[3] Arak, T. and Surgailis, D. (1989) Markov fields with polygonal realizations. Prob. Theory Rel. Fields 80, 543579.CrossRefGoogle Scholar
[4] Arak, T. and Surgailis, D. (1991) Consistent polygonal fields. Prob. Theory Rel. Fields 89, 319346.Google Scholar
[5] Arak, T. and Surgailis, D. (1989) Markov random graphs and polygonal fields with Y-shaped nodes. In Probability Theory and Mathematical Statistics. Proc. 5th Vilnius Conf. , Vol. 1. Utrecht-Vilnius, 5767.Google Scholar
[6] Baddeley, A. and M⊘ller, J. (1989) Nearest-neighbour Markov point processes and random sets. Internat. Statist. Rev. 57, 89121.Google Scholar
[7] Bollobás, B. (1985) Random Graphs. Academic Press, London.Google Scholar
[8] Clifford, P. and Middleton, R. D. (1989) Reconstruction of polygonal images. J. Appl. Statist. 16, 409422.CrossRefGoogle Scholar
[9] Kendall, M. G. and Moran, P. A. P. (1963) Geometrical Probability. Hafner, New York.Google Scholar
[10] Mitter, S. K. (1991) Markov random fields, stochastic quantization and image analysis. In Applied and Industrial Mathematics , ed. Spigler, R., pp. 101109. Kluwer, Dordrecht.CrossRefGoogle Scholar
[11] Molchanov, S. A. and Stepanov, A. K. (1983) Percolation of random fields, II. Teor. Mat. Fyz. 55, 419430.Google Scholar
[12] Ruelle, D. (1969) Statistical Mechanics. Benjamin, New York.Google Scholar
[13] Pickard, D. K. (1977) A curious binary lattice process. J. Appl. Prob. 14, 717731.Google Scholar
[14] Pickard, D. K. (1980) Unilateral Markov fields. Adv. Appl. Prob. 12, 655671.CrossRefGoogle Scholar
[15] Santaló, L. A. (1976) Integral Geometry and Geometric Probability. Encyclopedia of Mathematics and its Applications , Vol. 1. Addison Wesley, Reading, MA.Google Scholar
[16] Verhagen, A. M. W. (1977) A three parameter isotropic distribution of atoms and the hard-core square lattice gas. J. Chem. Phys. 67, 50605065.CrossRefGoogle Scholar
[17] Whittle, P. (1986) Systems in Stochastic Equilibrium. Wiley, New York.Google Scholar
[18] Zuev, S. A. and Sidorenko, A. F. (1985) Continuous models of percolation theory. II. Teor. Math. Fyz. 62, 253262.Google Scholar