Topics in stochastic processes with special reference to first passage percolation theory
<p>First passage percolation theory in its most general form is the randomised version of the well-known shortest route problem. It thus has several important physical applications. Ordinary percolation theory is but a special case of this more general problem which we formulate as follows. &l...
| Hovedforfatter: | |
|---|---|
| Andre forfattere: | |
| Format: | Thesis |
| Sprog: | English |
| Udgivet: |
1964
|
| _version_ | 1826312229204525056 |
|---|---|
| author | Welsh, JAD |
| author2 | Hammersley, JM |
| author_facet | Hammersley, JM Welsh, JAD |
| author_sort | Welsh, JAD |
| collection | OXFORD |
| description | <p>First passage percolation theory in its most general form is the randomised version of the well-known shortest route problem. It thus has several important physical applications. Ordinary percolation theory is but a special case of this more general problem which we formulate as follows. </p>
<p>To each arc of an arbitrary, countably infinite, connected graph we independently assign a non-negative random variable called the time coordinate of that arc. This assignment of random variables induces a time state 'w' on g. The 'length' of any path of g is the sum of the time coordinates of its component arcs.</p>
<p>[This abstract continues in the thesis file.]</p> |
| first_indexed | 2024-03-07T08:25:56Z |
| format | Thesis |
| id | oxford-uuid:4787cf63-9e81-4d9c-a49b-d7ccae6286f3 |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T08:25:56Z |
| publishDate | 1964 |
| record_format | dspace |
| spelling | oxford-uuid:4787cf63-9e81-4d9c-a49b-d7ccae6286f32024-02-15T14:29:56ZTopics in stochastic processes with special reference to first passage percolation theoryThesishttp://purl.org/coar/resource_type/c_db06uuid:4787cf63-9e81-4d9c-a49b-d7ccae6286f3EnglishHyrax Deposit1964Welsh, JADHammersley, JM<p>First passage percolation theory in its most general form is the randomised version of the well-known shortest route problem. It thus has several important physical applications. Ordinary percolation theory is but a special case of this more general problem which we formulate as follows. </p> <p>To each arc of an arbitrary, countably infinite, connected graph we independently assign a non-negative random variable called the time coordinate of that arc. This assignment of random variables induces a time state 'w' on g. The 'length' of any path of g is the sum of the time coordinates of its component arcs.</p> <p>[This abstract continues in the thesis file.]</p> |
| spellingShingle | Welsh, JAD Topics in stochastic processes with special reference to first passage percolation theory |
| title | Topics in stochastic processes with special reference to first passage percolation theory |
| title_full | Topics in stochastic processes with special reference to first passage percolation theory |
| title_fullStr | Topics in stochastic processes with special reference to first passage percolation theory |
| title_full_unstemmed | Topics in stochastic processes with special reference to first passage percolation theory |
| title_short | Topics in stochastic processes with special reference to first passage percolation theory |
| title_sort | topics in stochastic processes with special reference to first passage percolation theory |
| work_keys_str_mv | AT welshjad topicsinstochasticprocesseswithspecialreferencetofirstpassagepercolationtheory |