Related papers: Soft local times and decoupling of random interlac…
We study nearest-neighbors branching random walks started from a point at the interior of a hypercube. We show that the probability that the process escapes the hypercube is monotonically decreasing with respect to the distance of its…
We establish a sprinkled decoupling inequality for increasing events of Gaussian vectors with an error that depends only on the maximum pairwise correlation. As an application we prove the non-triviality of the percolation phase transition…
We propose a new approach for estimating the finite dimensional transition matrix of a Markov chain using a large number of independent sample paths observed at random times. The sample paths may be observed as few as two times, and the…
For the iterative decoupling of elliptic-parabolic problems such as poroelasticity, we introduce time discretization schemes up to order $5$ based on the backward differentiation formulae. Its analysis combines techniques known from…
It is widely accepted that the dynamic of entanglement in presence of a generic circuit can be predicted by the knowledge of the statistical properties of the entanglement spectrum. We tested this assumption by applying a Metropolis-like…
We consider the interlacement Poisson point process on the space of doubly-infinite Z^d-valued trajectories modulo time-shift, tending to infinity at positive and negative infinite times. The set of vertices and edges visited by at least…
Discrete Element Methods (DEM), i.e.~the simulation of many rigid particles, suffer from very stiff differential equations plus multiscale challenges in space and time. The particles move smoothly through space until they interact almost…
The question of decoupling and freeze-out is reinvestigated and analysed in terms of transparent semi-classical decoupling formulae, which provide a smooth decoupling in time both, for single and two particle inclusive spectra. They…
The paper studies thin times which are random times whose graph is contained in a countable union of the graphs of stopping times with respect to a reference filtration $\mathbb F$. We show that a generic random time can be decomposed into…
We consider a discrete-time system of n coupled random vectors, a.k.a. interacting particles. The dynamics involve a vanishing step size, some random centered perturbations, and a mean vector field which induces the coupling between the…
Microgels are elastic and deformable particles with a hybrid nature between that of polymers and colloids and unconventional behaviours with respect to hard colloids. We investigated the dynamics of a soft microgel made of interpenetrated…
In this paper we consider adaptive sampling's local-feature size, used in surface reconstruction and geometric inference, with respect to an arbitrary landmark set rather than the medial axis and relate it to a path-based adaptive metric on…
We investigate the convergence to (quasi--)equilibrium of a density dependent Markov chain in~${\mathbb Z}^d$, whose drift satisfies a system of ordinary differential equations having an attractive fixed point. For a sequence of such…
We study a detection problem in the following setting: On the one-dimensional integer lattice, at time zero, place nodes on each site independently with probability $\rho \in [0,1)$ and let them evolve as a simple symmetric exclusion…
We consider Activated Random Walks on arbitrary finite networks, with particles being inserted at random and absorbed at the boundary. Despite the non-reversibility of the dynamics and the lack of knowledge on the stationary distribution,…
A discrete Gelfand-Tsetlin pattern is a configuration of particles in Z^2. The particles are arranged in a finite number of consecutive rows, numbered from the bottom. There is one particle on the first row, two particles on the second row,…
Determining the asymptotic independence ratio of random regular graphs is a key challenge in the area of sparse random graphs. Due to the interpolation method, we have very good upper bounds at our disposal, which are actually known to be…
In a wide range of applications, the stochastic properties of the observed time series change over time. The changes often occur gradually rather than abruptly: the prop- erties are (approximately) constant for some time and then slowly…
Fix $p>1$, not necessarily integer, with $p(d-2)<d$. We study the $p$-fold self-intersection local time of a simple random walk on the lattice $\Z^d$ up to time $t$. This is the $p$-norm of the vector of the walker's local times, $\ell_t$.…
Dealing with finite Markov chains in discrete time, the focus often lies on convergence behavior and one tries to make different copies of the chain meet as fast as possible and then stick together. There is, however, a very peculiar kind…