Avancerad sökning
Hittade 1 avhandling som matchar ovanstående sökkriterier.
1. Accessibility percolation and first-passage percolation on the hypercube
Sammanfattning : In this thesis, we consider two percolation models on the n-dimensional binary hypercube, known as accessibility percolation and first-passage percolation. First-passage percolation randomly assigns non-negative weights, called passage times, to the edges of a graph and considers the minimal total weight of a path between given end-points. LÄS MER
Resultatsidor:
1