We construct a measure on the thick points of a Brownian loop soup in a bounded domain DD of the plane with given intensity theta>0θ>0, which is formally obtained by exponentiating the square root of its occupation field. The measure is construct ...
We present a technique for the approximation of a class of Hilbert space--valued maps which arise within the framework of model order reduction (MOR) for parametric partial differential equations, whose solution map has a meromorphic structure. Our MOR str ...
We provide new constructions of the subcritical and critical Gaussian multiplicative chaos (GMC) measures corresponding to the 2D Gaussian free field (GFF). As a special case we recover E. Aidekon's construction of random measures using nested conformally ...
We present a technique for Model Order Reduction (MOR) of frequency-domain problems relying on rational interpolation of vector-valued functions. The selection of the sample points is carried out adaptively according to a greedy procedure. We describe seve ...
This paper is devoted to the distributed complexity of finding an approximation of the maximum cut (MAXCUT) in graphs. A classical algorithm consists in letting each vertex choose its side of the cut uniformly at random. This does not require any communica ...
This paper is devoted to the distributed complexity of finding an approximation of the maximum cut in graphs. A classical algorithm consists in letting each vertex choose its side of the cut uniformly at random. This does not require any communication and ...
In this thesis we compute motivic classes of hypertoric varieties, Nakajima quiver varieties and open de Rham spaces in a certain localization of the Grothendieck ring of varieties. Furthermore we study the p-adic pushforward of the Haar measure under a ...
A wide variety of problems in machine learning, including exemplar clustering, document summarization, and sensor placement, can be cast as constrained submodular maximization problems. A lot of recent effort has been devoted to developing distributed algo ...
In this thesis, we explore techniques for the development of recursive functional programs over unbounded domains that are proved correct according to their high-level specifications. We present algorithms for automatically synthesizing executable code, st ...
We consider chains of random constraint satisfaction models that are spatially coupled across a finite window along the chain direction. We investigate their phase diagram at zero temperature using the survey propagation formalism and the interpolation met ...
We describe techniques for synthesis and verification of recursive functional programs over unbounded domains. Our techniques build on top of an algorithm for satisfiability modulo recursive functions, a framework for deductive synthesis, and complete synt ...
We revisit simultaneous diophantine approximation, a classical problem from the geometry of numbers which has many applications in algorithms and complexity. The input of the decision version of this problem consists of a rational vector \alpha, an error b ...
We consider the following problem: Given a commitment to a value σ, prove in zero-knowledge that σ belongs to some discrete set Φ. The set Φ can perhaps be a list of cities or clubs; often Φ can be a numerical range such as [1, 220]. This problem arises in ...
Let X = {X(t); t ∈ RN} be a (N,d) fractional Brownian motion in Rd of index H ∈ (0,1). We study the local time of X for all temporal dimensions N and spatial dimensions d for which local time exist. We obtain two main results : R1. If we denote by Lx(I) th ...
