Idioma:

Point-based polygonal models for random graphs

Arak, T. ; Clifford, P. ; Surgailis, D.

Advances in applied probability, 1993-06, Vol.25 (2), p.348-372 [Periódico revisado por pares]

Texto completo disponível

Citações Citado por

Título:
Point-based polygonal models for random graphs
Autor: Arak, T. ; Clifford, P. ; Surgailis, D.
Assuntos: Exact sciences and technology ; Graphs ; Line graphs ; Line segments ; Markov analysis ; Markov models ; Mathematical models ; Mathematics ; Modeling ; Particle collisions ; Particle trajectories ; Poisson process ; Polymerization ; Probability ; Probability and statistics ; Probability theory and stochastic processes ; Sciences and techniques of general use ; Simulation ; Sine function ; Stochastic processes ; Vertices
É parte de: Advances in applied probability, 1993-06, Vol.25 (2), p.348-372
Descrição: 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.
Editor: Cambridge, UK: Cambridge University Press
Idioma: Inglês

Links

Voltar para lista de resultados

Resultado 1 Avançar Ir para próxima página