相关论文: The peeling process of infinite Boltzmann planar m…
We introduce a random walk in random environment associated to an underlying directed polymer model in $1+1$ dimensions. This walk is the positive temperature counterpart of the competition interface of percolation and arises as the limit…
A restricted Boltzmann machine (RBM) is an undirected graphical model constructed for discrete or continuous random variables, with two layers, one hidden and one visible, and no conditional dependency within a layer. In recent years, RBMs…
There are many classical random walk in random environment results that apply to ergodic random planar environments. We extend some of these results to random environments in which the length scale varies from place to place, so that the…
Lawler, Schramm and Werner showed that the scaling limit of the loop-erased random walk on $\mathbb{Z}^2$ is $\mathrm{SLE}_2$. We consider scaling limits of the loop-erasure of random walks on other planar graphs (graphs embedded into…
Generative modeling with machine learning has provided a new perspective on the data-driven task of reconstructing quantum states from a set of qubit measurements. As increasingly large experimental quantum devices are built in…
In random tiling and dimer models we can get various limit shapes which gives the boundaries between different types of phases. The shape fluctuations at these boundaries give rise to universal limit laws, in particular the Airy process. We…
We study Bernoulli percolations on random lattices of the half-plane obtained as local limit of uniform planar triangulations or quadrangulations. Using the characteristic spatial Markov property or peeling process of these random lattices…
We present a novel isogeometric method, namely the Immersed Boundary-Conformal Method (IBCM), that features a layer of discretization conformal to the boundary while employing a simple background mesh for the remaining domain. In this…
Integer Linear Programming (ILP) has a broad range of applications in various areas of artificial intelligence. Yet in spite of recent advances, we still lack a thorough understanding of which structural restrictions make ILP tractable.…
We consider polynomial Bergman kernels with respect to exponentially varying weights $e^{-n \mathscr Q(z)}$ depending on a potential $\mathscr Q:\mathbb C^d\to\mathbb R$. We use these kernels to construct determinantal point processes on…
We study the scaling limits of looptrees associated with Bienaym\'e--Galton--Watson (BGW) trees, that are obtained by replacing every vertex of the tree by a "cycle" whose size is its degree. First, we consider BGW trees whose offspring…
Procedural material models have been gaining traction in many applications thanks to their flexibility, compactness, and easy editability. We explore the inverse rendering problem of procedural material parameter estimation from…
We consider a Markov evolution of lozenge tilings of a quarter-plane and study its asymptotics at large times. One of the boundary rays serves as a reflecting wall. We observe frozen and liquid regions, prove convergence of the local…
When identical particles on a line collide, they merge and continue as one. Exact determinantal formulas have long been available for particles conditioned never to collide, but collisions change the number of particles, and exact…
Answering a question of Benjamini & Schramm [8], we show that the Poisson boundary of any planar, uniquely absorbing (e.g. one-ended and transient) graph with bounded degrees can be realised geometrically as a circle, namely as the boundary…
We study geometric properties of the infinite random lattice called the uniform infinite planar quadrangulation or UIPQ. We establish a precise form of a conjecture of Krikun stating that the minimal size of a cycle that separates the ball…
An infinite hierarchy of layering transitions exists for model polymers in solution under poor solvent or low temperatures and near an attractive surface. A flat histogram stochastic growth algorithm known as FlatPERM has been used on a…
We consider exploration algorithms of the random sequential adsorption type both for homogeneous random graphs and random geometric graphs based on spatial Poisson processes. At each step, a vertex of the graph becomes active and its…
We describe a novel algorithm for rounding packing integer programs based on multidimensional Brownian motion in $\mathbb{R}^n$. Starting from an optimal fractional feasible solution $\bar{x}$, the procedure converges in polynomial time to…
In this paper we aim to construct infinite dimensional versions of well established Piecewise Deterministic Monte Carlo methods, such as the Bouncy Particle Sampler, the Zig-Zag Sampler and the Boomerang Sampler. In order to do so we…