Related papers: RCF4: Inconsistent Quantification
We introduce an algorithm that constructs a random uniform graph with prescribed degree sequence together with a depth first exploration of it. In the so-called supercritical regime where the graph contains a giant component, we prove that…
This paper describes recent results obtained in collaboration with M. Huesmann and F. Otto on the regularity of optimal transport maps. The main result is a quantitative version of the well-known fact that the linearization of the…
Several consistency notions are available for a lower prevision P assessed on a set D of gambles (bounded random variables), ranging from the well known coherence to convexity and to the recently introduced 2-coherence and 2-convexity. In…
This dissertation investigates questions arising in the consistent histories formulation of the quantum mechanics of closed systems. Various criteria for approximate consistency are analysed. The connection between the Dowker-Halliwell…
We provide new limit theory for functionals of a general class of processes lying at the boundary between stationarity and nonstationarity -- what we term weakly nonstationary processes (WNPs). This includes, as leading examples, fractional…
The theory of Q-Cartier divisors on the space of n-pointed, genus 0, stable maps to projective space is considered. Generators and Picard numbers are computed. A recursive algorithm computing all top intersection products of Q-Divisors is…
While the proper orthogonal decomposition (POD) is optimal under certain norms it's also expensive to compute. For large matrix sizes, it is well known that the QR decomposition provides a tractable alternative. Under the assumption that it…
We study the model-checking problem for recursion schemes: does the tree generated by a given higher-order recursion scheme satisfy a given logical sentence. The problem is known to be decidable for sentences of the MSO logic. We prove…
Coefficient estimation and variable selection in multiple linear regression is routinely done in the (penalized) least squares (LS) framework. The concept of model selection oracle introduced by Fan and Li [J. Amer. Statist. Assoc. 96…
We describe a framework for random pairwise comparisons matrices, inspired by selected constructions releted to the so called inconsistency reduction of pairwise comparisons (PC) matrices. In to build up structures on random pairwise…
We introduce constraints necessary for type checking a higher-order concurrent constraint language, and solve them with an incremental algorithm. Our constraint system extends rational unification by constraints x$\subseteq$ y saying that…
We study a configuration model on bipartite planar maps in which, given $n$ even integers, one samples a planar map with $n$ faces uniformly at random with these face degrees. We prove that when suitably rescaled, such maps always admit…
We introduce an algebra of elliptic commuting variables involving a base $q$, nome $p$, and $2r$ noncommuting variables. This algebra, which for $r=1$ reduces to an algebra considered earlier by the author, is an elliptic extension of the…
In their paper [1] on Wilf-equivalence for singleton classes, Backelin, Xin, and West introduce a transformation $\phi^*$, defined by an iterative process and operating on (all) full rook placements on Ferrers boards. In [3],…
First-order applicative term rewriting systems provide a natural framework for modeling higher-order aspects. In earlier work we introduced an uncurrying transformation which is termination preserving and reflecting. In this paper we…
In optimal control theory the expression infimum gap means a strictly negative difference between the infimum value of a given minimum problem and the infimum value of a new problem obtained by the former by extending the original family V…
We compactify and regularize the space of initial values of a planar map with a quartic invariant and use this construction to prove its integrability in the sense of algebraic entropy. The system turns out to have certain unusual…
Proximal operations are among the most common primitives appearing in both practical and theoretical (or high-level) optimization methods. This basic operation typically consists in solving an intermediary (hopefully simpler) optimization…
We introduce a new numerical algorithm based on semidefinite programming to efficiently compute bounds on operator dimensions, central charges, and OPE coefficients in 4D conformal and N=1 superconformal field theories. Using our algorithm,…
We review the consistent histories formulations of quantum mechanics developed by Griffiths, Omn\`es and Gell-Mann and Hartle, and describe the classification of consistent sets. We illustrate some general features of consistent sets by a…