POINT-BASED POLYGONAL MODELS FOR RANDOM GRAPHS

被引：26

作者：

ARAK, T

CLIFFORD, P

SURGAILIS, D

机构：

[1] UNIV OXFORD,DEPT STAT,OXFORD OX1 3TG,ENGLAND

[2] VILNIUS MATH & INFORMAT INST,VILNIUS 232600,LITHUANIA

来源：

ADVANCES IN APPLIED PROBABILITY | 1993年 / 25卷 / 02期

关键词：

MARKOV GRAPHS; CONSISTENT MODELS; PARTICLE SYSTEMS; POISSON SEGMENT PROCESS; POLYMERIZATION;

D O I：

10.2307/1427657

中图分类号：

O21 [概率论与数理统计]; C8 [统计学];

学科分类号：

020208 ; 070103 ; 0714 ;

摘要：

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.

引用

页码：348 / 372

页数：25

共 18 条

[1] CONSISTENT POLYGONAL FIELDS [J].

ARAK, T ;

SURGAILIS, D .

PROBABILITY THEORY AND RELATED FIELDS, 1991, 89 (03) :319-346

[2] MARKOV-FIELDS WITH POLYGONAL REALIZATIONS [J].

ARAK, T ;

SURGAILIS, D .

PROBABILITY THEORY AND RELATED FIELDS, 1989, 80 (04) :543-579

[3]

ARAK T, 1982, 4TH USSR JAP S PROB

[4]

ARAK T, 1986, P INT C MATH BERKELE, P994

[5]

ARAK T, 1989, PROBABILITY THEORY M, V1, P57

[6] NEAREST-NEIGHBOUR MARKOV POINT-PROCESSES AND RANDOM SETS [J].

BADDELEY, A ;

MOLLER, J .

INTERNATIONAL STATISTICAL REVIEW, 1989, 57 (02) :89-121

[7]

Bollobas B., 1985, RANDOM GRAPHS

[8]

CLIFFORD P, 1989, J APPL STAT, V16, P409

[9]

KENDALL MG, 1963, GEOMETRICAL PROBABIL

[10]

MITTER SK, 1991, APPLIED IND MATH, P101

← 1 2 →