Sökning: "random walks"

Visar resultat 1 - 5 av 17 uppsatser innehållade orden random walks.

1. 1. Applications of Random Walks : How Random Walks Are Used in Wilson's Algorithm and How They Connect to Electrical Networks

   Master-uppsats, Uppsala universitet/Sannolikhetsteori och kombinatorik

   Författare :Erik Jonsson; [2024]
   Nyckelord :Random Walks; Wilson s Algorithm; Electrical Networks; Pòlya s theorem;

   Sammanfattning : In this master thesis we will show how random walks are used in Wilson's algorithm to generate spanning trees of graphs, and how they can be used to calculate the number of spanning trees in a graph. We will also explore the connection between electrical networks and random walks, and how this connection can be exploited to prove Pólya's theorem (normally proved with probability and combinatorics) using electrical arguments. LÄS MER

3. 2. A Comparative Investigation of Classical Random and Quantum Walks in Terms of Algorithms, Implementation, and Characteristics

   Master-uppsats, KTH/Skolan för teknikvetenskap (SCI)

   Författare :Naoki Moriya; [2024]
   Nyckelord :Qunatum computing; quantum walk;

   Sammanfattning : In recent years, there has been a significant development in high performance computing, driven by advances in hardware and software technology. The performance of the computers to the present has improved in accordance with Moore’s law, on the other hand, it seems to be reaching the limits in the near future. LÄS MER

4. 3. Interactive Visualization of Network Models in JavaScript/TypeScript for Web-based Applications

   Uppsats för yrkesexamina på avancerad nivå, Umeå universitet/Institutionen för fysik

   Författare :Morrow Erik; [2023]
   Nyckelord :Networks; Information visualization; Information Theory; Interactive visualization; Nätverk; Informationsvisualisering; Informationsteori; Interaktiv visualisering;

   Sammanfattning : Networks of nodes and links are powerful tools to model complex systems, however, when the number of nodes and links grows to the thousands then even the network becomes too complex to comprehend unless we can simplify and highlight the networks underlying structure. The map equation is a method developed by the researchers at IntegratedScience Lab that uses an information theoretic approach to reveal community structure using the flow of information on the network modeled with random walks. LÄS MER

5. 4. Simulating the Impact of Noise on Quantum Walk Algorithm

   Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Författare :Wilhelm Öberg; Sam Shahriari; [2023]
   Nyckelord :;

   Sammanfattning : Quantum computing has recently shown promise for improving the efficiency of some classical algorithms. However, quantum computing suffers from issues in reliability due to the fundamental problem of quantum mechanics called decoherence. LÄS MER

7. 5. Random curves and their scaling limits

   Kandidat-uppsats, KTH/Skolan för teknikvetenskap (SCI)

   Författare :Jonatan Wächter; [2023]
   Nyckelord :Stochastic processes; Schramm-Loewner-Evolution; Random Walk; Brownian Motion; Harmonic Explorer;

   Sammanfattning : We focus on planar Random Walks and some related stochastic processes. The discrete models are introduced and some of their core properties examined. We then turn to the question of continuous analogues, starting with the well-known convergence of the Random Walk to Brownian Motion. LÄS MER