Related papers: Dominic Welsh (1938-2023)
For the p-adic group G=SL (2) , we present results of the computations of the sums of the Bernstein projectors of a given depth. Motivation for the computations is based on a conversation with Roger Howe in August 2013. The computations are…
We propose Edward, a Turing-complete probabilistic programming language. Edward defines two compositional representations---random variables and inference. By treating inference as a first class citizen, on a par with modeling, we show that…
We introduce and study the permanence properties of the class of linear transfers between probability measures. This class contains all cost minimizing mass transports, but also martingale mass transports, the Schrodinger bridge associated…
Cauchy's contribution to the foundations of analysis is often viewed through the lens of developments that occurred some decades later, namely the formalisation of analysis on the basis of the epsilon-delta doctrine in the context of an…
The Rota--Heron--Welsh conjecture (now a theorem of Adiprasito, Huh, and the author) asserts the log-concavity of the characteristic polynomial of matroids. We give an exposition of the Lorentzian polynomial proof following the work of…
We show that typical extensions of ergodic systems inherit the triviality of pairwise independent self-joinings. This property (introduced by A. del Junco and D. Rudolph) is related with Rokhlin's famous multiple mixing problem and several…
Many representation schemes combining first-order logic and probability have been proposed in recent years. Progress in unifying logical and probabilistic inference has been slower. Existing methods are mainly variants of lifted variable…
The Tutte polynomial of a graph or a matroid, named after W. T. Tutte, has the important universal property that essentially any multiplicative graph or network invariant with a deletion and contraction reduction must be an evaluation of…
About forty years ago it was realized by several researchers that the essential features of certain objects of Probability theory, notably Gaussian processes and limit theorems, may be better understood if they are considered in settings…
When people mention the mathematical achievements of Euclid, his geometrical achievements always spring to mind. But, his Number-Theoretical achievements (See Books 7, 8 and 9 in his magnum opus \emph{Elements} [1]) are rarely spoken. The…
In 1968, V.I. Oseledets formulated the question of convergence in the Birkhoff theorem and the multiplicative ergodic theorem for measurable cocycles over flows under the condition of integrability for each individual t. A.M. Stepin and the…
The year 2025 marked the centennial of quantum mechanics, inaugurated by Heisenberg's matrix formulation and the foundational contributions of Pauli, Schrodinger, and Dirac. Concurrently, 2026 marks the centennial of the Klein - Gordon…
Motivated by a recent conjecture of Zabrocki, Wallach described the alternants in the super-coinvariant algebra of the symmetric group in one set of commuting and one set of anti-commuting variables under the diagonal action. We give a…
We establish, for every family of orthogonal polynomials in the $ q $-Askey scheme and the Askey scheme, a combinatorial model for mixed moments and coefficients in terms of paths on the lecture hall graph. This generalizes the previous…
In the 1970s, Tutte developed a clever algebraic approach, based on certain "invariants" , to solve a functional equation that arises in the enumeration of properly colored triangulations. The enumeration of plane lattice walks confined to…
Methods of high-dimensional probability play a central role in applications for statistics, signal processing theoretical computer science and related fields. These lectures present a sample of particularly useful tools of high-dimensional…
In his monograph [Classical and quantum orthogonal polynomials in one variable, Cambridge University Press, 2005 (paperback edition 2009)], Ismail conjectured that certain structure relations involving the Askey-Wilson operator characterize…
This thesis describes work on two applications of probabilistic programming: the learning of probabilistic program code given specifications, in particular program code of one-dimensional samplers; and the facilitation of sequential Monte…
George Birkhoff proved in 1912 that the number of proper colorings of a finite graph G with n colors is a polynomial in n, called the chromatic polynomial of G. Read conjectured in 1968 that for any graph G, the sequence of absolute values…
Computing with discrete representations of high-dimensional probability distributions is fundamental to uncertainty quantification, Bayesian inference, and stochastic modeling. However, storing and manipulating such distributions suffers…