Johan Pouwelse

Please avoid double work! Keep an eye on the progress of other teams and feel free to grab commits of others. The only rule is: document on your issue that...

### Final Examination procedure Week 10 of this course is dedicated to the final examination. Coming week you will be scheduled into the available slots. _Mandatory attendance_. Slots are available...

Running code results 🎉 🦄 🎉 The table below shows the students teams which produced running code for standard Android 15, Pixel 8 hardware. Required for final examination, pre-approved before...

@drew2a Just a small reminder. Please setup a seedbox for a Tribler channel with lots of Creative Commons music. (e.g. different then superapp; overlap). Simple static dump. For demo purposes...

General research description: This project will address the problem of trust. Using an experimental-driven approach with real-world datasets and Internet-deployment we aim to significant advance our methods to build trust....

2005 work: [Incremental page rank computation on evolving graphs](http://dl.acm.org/citation.cfm?id=1062885) [Python graph code](http://www.python-course.eu/graphs_python.php) Why trust and incremental pagerank: - [Reputation and Feedback Systems in Online Platform Markets](http://faculty.haas.berkeley.edu/stadelis/Annual_Review_Tadelis.pdf) - [Peer-to-Peer markets](https://web.stanford.edu/~leinav/pubs/AR2016.pdf) -...

First code: https://github.com/Peiteng/Incremental-Pagerank !  ToDo next meeting: - generate 1 random graph - change the network 5%, 10%, 25%, 50% etc. - calculate your incremental pagerank - how accurate...

Possible solo "blockchain Engineering" course. ToDo: take trustchain dataset, copy algorithms from state-of-the-art, possible enhance, implement Python code, math beautiful equations on probability & stochastic. @alexander-stannat [We establish a surprising...

First sprint: - [ ] get dataset @jangerritharms - [ ] [understand the initial code by Martijn of PageRank](https://github.com/Tribler/tribler/pull/3282/files#diff-387c813776d13167bd3a6118bbce82cb) possibly called every 10min. - [ ] build the most simple...

We [proposed the _EscapeLimit algorithm_ in the past](https://dl.acm.org/citation.cfm?id=2695868), there are multiple random walks: - simple random walk - weighted random walk - [Metropolis-Hastings random walk](https://www.jstor.org/stable/2334940?seq=1#metadata_info_tab_contents) - Maximal Entropy random walk