Home > Search Results: keywords:"bodový proces|mozaika|vzdálenost nejkratší cesty|lineární síť|rovinná síť|algoritmus|simulace|statistický odhad"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 1 records found  Search took 0.00 seconds. 
Point processes on networks
 Zahrádková, Petra ; Beneš, Viktor (advisor) ; Dvořák, Jiří (referee)
The aim of this master thesis is to develop the background for point processes on both the linear network and the planar network in R3 . The linear, planar network is formed by the system of edges, faces of a 3D tessellation, respectively. Using the Gibbs-Laguerre tessellation model we can investigate the case of a regular or irregular tessellation. We consider cluster and hard core point processes and we compare two types of distances between points, the Euclidean distance and the shortest path distance within the net- work. The algorithms for simulation of point processes on both networks are developed. Using the simulated realizations of point processes we estimate some functional summary characteristics. Based on plotted graphs of these estimates, the influence of the choice of tessellations, point process models and distances is discussed. 1
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English