activity
20132021
most citedUncertainty-sensitive Learning and Planning with Ensembles

6 citations · 6 across the 3 of their papers we have counts for

collaborators
Showing math.PRShow all

5 papers · 1 filter

math.PR2018

The interchange process with reversals on the complete graph

Jakob E. Björnberg, Michał Kotowski, Benjamin Lees +1

We consider an extension of the interchange process on the complete graph, in which a fraction of the transpositions are replaced by `reversals'. The model is motivated by statisti…

math.PR2018

Phase transition for the interchange and quantum Heisenberg models on the Hamming graph

Radosław Adamczak, Michał Kotowski, Piotr Miłoś

We study a family of random permutation models on the Hamming graph (i.e., the -fold Cartesian product of complete graphs), containing the interchange process and the c…

math.PR2018

CLT for supercritical branching processes with heavy-tailed branching law

Rafał Marks, Piotr Miłoś

Consider a branching system with particles moving according to an Ornstein-Uhlenbeck process with drift and branching according to a law in the domain of attraction of the $(…

math.PR2017

Note on Bolthausen-Deuschel-Zeitouni's paper on the absence of a wetting transition for a pinned harmonic crystal in dimensions three and larger

Loren Coquille, Piotr Miłoś

The article [Bolthausen et al., 2000] provides a proof of the absence of a wetting transition for the discrete Gaussian free field conditioned to stay positive, and undergoing a we…

math.PR2013

A second note on the discrete Gaussian Free Field with disordered pinning on Z^d, d\geq 2

Loren Coquille, Piotr Miłoś

We study the discrete massless Gaussian Free Field on Z^d, d \geq 2, in the presence of a disordered square-well potential supported on a finite strip around zero. The disorder is…