Change search
ReferencesLink to record
Permanent link

Direct link
Shortest paths through a reinforced random walk
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Analysis and Applied Mathematics.
2011 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Place, publisher, year, edition, pages
2011. , 83 p.
Series
U.U.D.M. project report, 2011:8
National Category
Mathematics
Identifiers
URN: urn:nbn:se:uu:diva-153802OAI: oai:DiVA.org:uu-153802DiVA: diva2:417959
Educational program
Master Programme in Mathematics
Uppsok
Physics, Chemistry, Mathematics
Supervisors
Examiners
Available from: 2011-05-19 Created: 2011-05-19 Last updated: 2011-05-19Bibliographically approved

Open Access in DiVA

Li_Dan1(1338 kB)1155 downloads
File information
File name FULLTEXT01.pdfFile size 1338 kBChecksum SHA-512
85ab87cefe0f334e31e0382dc50bfa93e1fcd2c99d4f3fc5adda1c3156d4e52122a8f44cf8b497fa5ddc53739f71b8d3eb4a8f97b2ab9fc526995b86984e2d5a
Type fulltextMimetype application/pdf

By organisation
Analysis and Applied Mathematics
Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 1155 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 876 hits
ReferencesLink to record
Permanent link

Direct link