Related papers: Borel Local Lemma: arbitrary random variables and …
Covering arrays find important application in software and hardware interaction testing. For practical applications it is useful to determine or bound the minimum number of rows, CAN$(t,k,v)$, in a covering array for given values of the…
If $L^x$ is the total occupation local time of $d$-dimensional super-Brownian motion, $X$, for $d=2$ and $d=3$, we construct a random measure $\mathcal{L}$, called the boundary local time measure, as a rescaling of $L^x e^{-\lambda L^x} dx$…
In a previous paper by the authors the existence of Haar projections with growing norms in Sobolev-Triebel-Lizorkin spaces has been shown via a probabilistic argument. This existence was sufficient to determine the precise range of…
This paper introduces the notion of Constrained Locating Arrays (CLAs), mathematical objects which can be used for fault localization in software testing. CLAs extend ordinary locating arrays to make them applicable to testing of systems…
We give a fast algorithm for sampling uniform solutions of general constraint satisfaction problems (CSPs) in a local lemma regime. Suppose that the CSP has $n$ variables with domain size at most q, each constraint contains at most k…
The Lambek calculus is a well-known logical formalism for modelling natural language syntax. The original calculus covered a substantial number of intricate natural language phenomena, but only those restricted to the context-free setting.…
The local (central) limit theorem precisely describes the behavior of iterated convolution powers of a probability distribution on the $d$-dimensional integer lattice, $\mathbb{Z}^d$. Under certain mild assumptions on the distribution, the…
Persistence of non-degeneracy is a phenomenon which appears in the theory of $\overline{\mathbb Q}_l$-representations of the linear group: every irreducible submodule of the restriction to the mirabolic sub-representation of a…
Covering arrays are generalizations of orthogonal arrays that have been widely studied and are used in software testing. The probabilistic method has been employed to derive upper bounds on the sizes of minimum covering arrays and give…
Large Language Models usually put more emphasis on accuracy and therefore, will guess even when not certain about the prediction, which is especially severe when fine-tuned on small datasets due to the inherent tendency toward…
Lov\'asz gave a short proof of Brooks' theorem by coloring greedily in a good order. We give a different short proof by reducing to the cubic case. Then we show how to extend the result to (online) list coloring via the Kernel Lemma.
We study the law of the iterated logarithm (LIL) for the maximum likelihood estimation of the parameters (as a convex optimization problem) in the generalized linear models with independent or weakly dependent ($\rho$-mixing, $m$-dependent)…
We systematically develop analogs of basic concepts from classical descriptive set theory in the context of pointless topology. Our starting point is to take the elements of the free complete Boolean algebra generated by the frame…
Buraczewski et al (2023) proved a functional limit theorem (FLT) and a law of the iterated logarithm (LIL) for a random Dirichlet series $\sum_{k\geq 2}(\log k)^\alpha k^{-1/2-s}\eta_k$ as $s\to 0+$, where $\alpha>-1/2$ and $\eta_1$,…
Large graphs are sometimes studied through their degree sequences (power law or regular graphs). We study graphs that are uniformly chosen with a given degree sequence. Under mild conditions, it is shown that sequences of such graphs have…
Limit theorems for non-additive probabilities or non-linear expectations are challenging issues which have raised progressive interest recently. The purpose of this paper is to study the strong law of large numbers and the law of the…
We consider an extension of linear-time temporal logic (LTL) with both local and remote data constraints interpreted over a concrete domain. This extension is a natural extension of constraint LTL and the Temporal Logic of Repeating Values,…
It is well known that a Lorenz curve, derived from the distribution function of a random variable, can itself be viewed as a probability distribution function of a new random variable [4]. In a previous work of ours [26], we proved the…
Locally checkable labeling problems (LCLs) are distributed graph problems in which a solution is globally feasible if it is locally feasible in all constant-radius neighborhoods. Vertex colorings, maximal independent sets, and maximal…
A novel IV estimation method, that we term Locally Trimmed LS (LTLS), is developed which yields estimators with (mixed) Gaussian limit distributions in situations where the data may be weakly or strongly persistent. In particular, we allow…