Point-based polygonal models for random graphs

DOI10.2307/1427657zbMath0772.60036OpenAlexW1969173815WikidataQ56522027 ScholiaQ56522027MaRDI QIDQ5286949

Peter Clifford, Donatas Surgailis, T. Arak

Publication date: 11 October 1993

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1427657

zbMATH Keywords

polymerizationcomputer simulationsMarkov random graphsPoisson segment process

Mathematics Subject Classification ID

Random fields (60G60) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items

Sensitivity analysis and uncertainty quantification for environmental models ⋮ How many T-tessellations on k lines? Existence of associated Gibbs measures on bounded convex domains ⋮ Perfect Simulation for Length‐interacting Polygonal Markov Fields in the Plane ⋮ Arak-Clifford-Surgailis tessellations. Basic properties and variance of the total edge length ⋮ Image segmentation by polygonal Markov fields ⋮ Non-homogeneous polygonal Markov fields in the plane: graphical representations and geometry of higher order correlations ⋮ Dobrushin-Kotecký-Shlosman theorem for polygonal Markov fields in the plane ⋮ Polygonal web representation for higher order correlation functions of consistent polygonal Markov fields in the plane ⋮ Disagreement Loop and Path Creation/Annihilation Algorithms for Binary Planar Markov Fields with Applications to Image Segmentation ⋮ Crack STIT tessellations: characterization of stationary random tessellations stable with respect to iteration ⋮ Random dynamics and thermodynamic limits for polygonal Markov fields in the plane ⋮ Topological relationships in spatial tessellations ⋮ Unnamed Item ⋮ Discrete Multicolour Random Mosaics with an Application to Network Extraction