Related papers: Efficient approximation of branching random walk G…
Randomness is ubiquitous in many applications across data science and machine learning. Remarkably, systems composed of random components often display emergent global behaviors that appear deterministic, manifesting a transition from…
We consider the Random Walk Pinning Model studied in [3,2]: this is a random walk X on Z^d, whose law is modified by the exponential of \beta times L_N(X,Y), the collision local time up to time N with the (quenched) trajectory Y of another…
We investigate the crossover of the entanglement entropy towards its thermal value in nearly integrable systems. We employ equation of motion techniques to study the entanglement dynamics in a lattice model of weakly interacting spinless…
This paper focuses on the numerical approximation of random lattice reversible Selkov systems. It establishes the existence of numerical invariant measures for random models with nonlinear noise, using the backward Euler-Maruyama (BEM)…
Graph vertex embeddings based on random walks have become increasingly influential in recent years, showing good performance in several tasks as they efficiently transform a graph into a more computationally digestible format while…
We consider the general branching random walk under minimal assumptions, which in particular guarantee that the empirical particle distribution admits an almost sure central limit theorem. For such a process, we study the large time decay…
Approximating the partition function of the ferromagnetic Ising model with general external fields is known to be #BIS-hard in the worst case, even for bounded-degree graphs, and it is widely believed that no polynomial-time approximation…
The Bradley-Terry model is a popular approach to describe probabilities of the possible outcomes when elements of a set are repeatedly compared with one another in pairs. It has found many applications including animal behaviour, chess…
We study the computational complexity of approximately counting the number of independent sets of a graph with maximum degree Delta. More generally, for an input graph G=(V,E) and an activity lambda>0, we are interested in the quantity…
Our recently developed "unbiased" extremum seeking (uES) algorithms ensure perfect convergence to the optimum at a user-assigned exponential rate or, more powerfully, within a user-prescribed time. Unlike classical approach, these…
We study the extremal properties of the "integer-valued Gaussian" a.k.a.\ DG-model on the hierarchical lattice $\Lambda_n:=\{1,\dots,b\}^n$ (with $b\ge2$) of depth $n$. This is a random field $\varphi\in\mathbb Z^{\Lambda_n}$ with law…
The efficiency of Monte Carlo samplers is dictated not only by energetic effects, such as large barriers, but also by entropic effects that are due to the sheer volume that is sampled. The latter effects appear in the form of an entropic…
We study the asymptotic properties of nearest-neighbor random walks in 1d random environment under the influence of an external field of intensity $\lambda\in\mathbb{R}$. For ergodic shift-invariant environments, we show that the limiting…
We introduce a Gibbs measure on nearest-neighbour paths of length $t$ in the Euclidean $d$-dimensional lattice, where each path is penalised by a factor proportional to the size of its boundary and an inverse temperature $\beta$. We prove…
The study of animal movement is challenging because it is a process modulated by many factors acting at different spatial and temporal scales. Several models have been proposed which differ primarily in the temporal conceptualization,…
We provide a definition of a new critical exponent $\beta$ that has the interpretation of a type of local walk dimension, and may be defined on any compact metric space. We then specialize to the case of random walks that jump uniformly in…
We consider random walks in dynamic random environments which arise naturally as spatial embeddings of ancestral lineages in spatial locally regulated population models. In particular, as the main result, we prove the quenched central limit…
We consider a biased random walk $X_n$ on a Galton-Watson tree with leaves in the sub-ballistic regime. We prove that there exists an explicit constant $\gamma= \gamma(\beta) \in (0,1)$, depending on the bias $\beta$, such that $X_n$ is of…
We consider a random walk on a supercritical Galton-Watson tree with leaves, where the transition probabilities of the walk are determined by biases that are randomly assigned to the edges of the tree. The biases are chosen independently on…
We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when…