Here, we propose an adaptive random walk (ARW), which, differently from the maximum entropy random walk, maximizes dispersion by updating its transition rule on the local information collected while exploring the network. The ARW is obtained via a large-deviation representation of the MERW as a finite-time rare event of an unbiased random walk a…

Code developed for a research project at the University of Cambridge, supervised by Robert Jack.

This project is an implementation of the Adaptive Power Method (APM). It simulates a random walk on an Erdős-Rényi random graph to compute the scaled culumant generating function (SCGF) and rate function of the mean degree a time additive observable.

Wiki of a research project at the University of Cambridge, supervised by Robert Jack, and at the Université de Paris, supervised by Frédéric van Wijland.

We derive asymptotic behavior of the probability of high-level excursion for the maximal increment of the Wiener process.

LD-SPATT (spatt, statistics for patterns) gsl 2.1 on Win64. VC2015. ported to win64. Large Deviation on coin tosses in s/h. And on Markov Sequences in C++ code.. Also excel s/h

Cloning algorithm for the computation of large deviation functions.

Source code of paper "Rare Events of Host Switching for Diseases using a SIR Model with Mutations"

We derive asymptotic behavior of the probability of high-level excursion for the maximal increment of a Gaussian random walk.

Most of my writings — notes, talks, travelogues, thoughts, and the rest