Searched for: subject%3A%22random%255C+walk%22
(1 - 20 of 42)

Pages

document
Benjert, Zylan (author)
We consider the problem of random walks moving around on a lattice Zd with an initial Poisson distribution of traps. We consider both static and moving traps. In the static case, we prove that the survival time has a decay of e−c t d /d +2 based on a heuristic argument. In the moving case we aim to prove the sub-exponential...
bachelor thesis 2023
document
den Ouden, Ronan (author)
Random walks have been used in a number of different fields for a long time. With the rise of of quantum random walks a lot of these applications have been made more efficient. Recently there have been a lot of improvements in the realization of these quantum random walks in real world systems. <br/>In this research, the effect of uncertainty in...
bachelor thesis 2023
document
Redig, F.H.J. (author), van Wiechen, H. (author)
We consider a class of multi-layer interacting particle systems and characterize the set of ergodic probability measures with finite moments. The main technical tool is duality combined with successful coupling.
journal article 2023
document
Cipriani, A. (author), Dan, Biltu (author), Hazra, Rajat Subhra (author), Ray, Rounak (author)
The discrete membrane model is a Gaussian random interface whose inverse covariance is given by the discrete biharmonic operator on a graph. In literature almost all works have considered the field as indexed over Zd, and this enabled one to study the model using methods from partial differential equations. In this article we would like to...
journal article 2023
document
Wezeman, Robert S. (author), Neumann, N.M.P. (author), Phillipson, F. (author), Kooij, Robert (author)
In this paper we study encounter-based density estimation using different random walks and analyse the effects of the step-size on the convergence of the density approximation. Furthermore, we analyse different types of random walks, namely, a uniform random walk, with every position equally likely to be visited next, a classical random walk...
conference paper 2023
document
Jia, Z. (author), Nourian, Pirouz (author), Luscuere, P (author), Wagenaar, C. (author)
This study presents a systematic review of the literature on decision support for designing hospital layouts using spatial network analysis and/or simulation modelling. The review includes 102 articles, which are classified into five different categories concerning their layout-related challenges. Specifically, the categories include...
review 2023
document
Scheper, Julian (author)
bachelor thesis 2022
document
Floreani, S. (author), Giardina', C. (author), Hollander, Frank den (author), Nandan, Shubhamoy (author), Redig, F.H.J. (author)
This paper considers three classes of interacting particle systems on Z: independent random walks, the exclusion process, and the inclusion process. Particles are allowed to switch their jump rate (the rate identifies the type of particle) between 1 (fast particles) and ϵ∈ [0 , 1] (slow particles). The switch between the two jump rates...
journal article 2022
document
van Tol, Berend (author)
In this thesis we study criticality in the context of the dissipative Abelian sandpile model. The model is linked to a simple trapped random walk, giving a practical method to determine criticality for certain landscapes of dissipative sites. The main results concern the lifetime of the random walk, especially the divergence of its first moment...
bachelor thesis 2021
document
Dijkhorst, Anne-Fleur (author)
In this research, the implementations of quantum random walks in superconducting circuit-QED are studied. In particular, a walk that moves across the Fock states of a quantum harmonic oscillator by a Jaynes-Cummings model is investigated, which is difficult to implement because of different Rabi frequencies for different Fock states....
bachelor thesis 2021
document
Özkan, Emre (author)
The LND is currently the most popular routing algorithm used in the Lightning Network, the second layer solution to Bitcoin’s scalability. Despite its popularity, recent studies demonstrate that its deterministic nature compromises the anonymity of the Lightning Network. In other words, threatening parties present in the transaction path can...
bachelor thesis 2021
document
van Loenen, Mirte (author)
Markov chains are used to describe random processes in discrete time, which have the property of being memoryless. This report covers Markov chains on a finite space that are homogeneous in time and mainly follows the structure of ''Markov Chains and Mixing Times''. Markov chains exhibit a strong connection with electric networks. We exploit...
bachelor thesis 2021
document
van Ginkel, G.J. (author), van Gisbergen, Bart (author), Redig, F.H.J. (author)
We study a model of active particles that perform a simple random walk and on top of that have a preferred direction determined by an internal state which is modelled by a stationary Markov process. First we calculate the limiting diffusion coefficient. Then we show that the ‘active part’ of the diffusion coefficient is in some sense maximal...
journal article 2021
document
Goudsmit, L. (author)
In the ocean resides a large amount of plastic. This has severe environmental consequences for the oceans. To be able to clean up all this plastic the location of the plastic is needed. A lot of times plastic is cleaned up at the source, but to clean up here this location needs to be known. However, what if the start location is not known and...
bachelor thesis 2020
document
Jarne Ornia, D. (author), Mazo, M. (author)
Ant Colony algorithms are a set of biologically inspired algorithms used commonly to solve distributed optimization problems. Convergence has been proven in the context of optimization processes, but these proofs are not applicable in the framework of robotic control. In order to use Ant Colony algorithms to control robotic swarms, we present...
conference paper 2020
document
Kooij, Robert (author), Dubbeldam, J.L.A. (author)
The linear relation between Kemeny's constant, a graph metric directly linked with random walks, and the effective graph resistance in a regular graph has been an incentive to calculate Kemeny's constant for various networks. In this paper we consider complete bipartite graphs, (generalized) windmill graphs and tree networks with large...
journal article 2020
document
Das, Bishwadeep (author), Isufi, E. (author), Leus, G.J.T. (author)
Diffusion-based semi-supervised learning on graphs consists of diffusing labeled information of a few nodes to infer the labels on the remaining ones. The performance of these methods heavily relies on the initial labeled set, which is either generated randomly or using heuristics. The first sometimes leads to unsatisfactory results because...
conference paper 2020
document
Sau, F. (author)
In this thesis, we study scaling and detailed properties of a class of conservative interacting particle systems. In particular, in the first part we derive the hydrodynamic equation for the symmetric exclusion process in presence of dynamic random environment. The second part of the thesis focuses on a detailed property of conservative particle...
doctoral thesis 2019
document
Zaat, Justin (author)
The Abelian sandpile model was first introduced by Bak, Tang and Wiesenfeld in 1987. Since then, a lot of researchers have studied this model and similar models, all related by the concept of self-organized criticality. In this thesis, we study a variant on the classical model where dissipative and anti-dissipative vertices are incorporated in...
bachelor thesis 2019
document
van Schetsen, Anouk (author)
Predicting the trends in Bitcoin market prices is a very challenging task due to the many uncertainties and variables influencing the market value. The market is susceptible to quick changes, causing seemingly random fluctuations in the Bitcoin price. Due to the chaotic and highly volatile nature of Bitcoin behavior, investments come with high...
master thesis 2019
Searched for: subject%3A%22random%255C+walk%22
(1 - 20 of 42)

Pages