Related papers: Simple Models of Randomization and Preservation Th…
Randomly packing spheres of equal size into a container consistently results in a static configuration with a density of ~64%. The ubiquity of random close packing (RCP) rather than the optimal crystalline array at 74% begs the question of…
A Newton--Kantorovich-type argument enables the a posteriori existence verification of a unique regular root near a computed approximation, purely from computable data. This framework allows for non-selfadjoint problems and extends the…
For a random variable $N = 0, 1, 2, \ldots$ we study the following question: When does the sum of $N$ many independent and identically distributed copies of a random variable $X$ have the same law a a nontrivial rescaling of $X$? We show…
In this paper we explore the representation property over sets. This property generalizes constructibility, however is weak enough to enable us to prove that the class of theories $T$ whose models are representable is exactly the class of…
We introduce the notions of triviality and order-triviality for global invariant types in an arbitrary first-order theory and show that they are well behaved in the NIP context. We show that these two notions agree for invariant global…
In this paper, the connections between model theory and the theory of infinite permutation groups are used to study the n-existence and the n-uniqueness for n-amalgamation problems of stable theories. We show that, for any n>1, there exists…
We consider the binomial random set model $[n]_p$ where each element in $\{1,\dots,n\}$ is chosen independently with probability $p:=p(n)$. We show that for essentially all regimes of $p$ and very general conditions for a matrix $A$ and a…
This manuscript complements the Hirsch-Pugh-Shub (HPS) theory on persistence of normally hyperbolic laminations and the theorem of Robinson on the structural stability of diffeomorphisms that satisfy Axiom A and the strong transversality…
The stability of statistical analysis is an important indicator for reproducibility, which is one main principle of scientific method. It entails that similar statistical conclusions can be reached based on independent samples from the same…
Random matrix models encode a theory of random two dimensional surfaces with applications to string theory, conformal field theory, statistical physics in random geometry and quantum gravity in two dimensions. The key to their success lies…
Tensor decomposition methods allow us to learn the parameters of latent variable models through decomposition of low-order moments of data. A significant limitation of these algorithms is that there exists no general method to regularize…
The normalized maximum likelihood (NML) code length is widely used as a model selection criterion based on the minimum description length principle, where the model with the shortest NML code length is selected. A common method to calculate…
The algorithmic theory of randomness is well developed when the underlying space is the set of finite or infinite sequences and the underlying probability distribution is the uniform distribution or a computable distribution. These…
Given a dynamical system, a characteristic measure is a Borel probability measure invariant under all of its automorphisms. Frisch and Tamuz asked if every symbolic system supports such a measure. Motivated by this problem, we study the…
A simulation is useful when the phenomenon of interest is either expensive to regenerate or irreproducible with the same context. Recently, Bayesian inference on the distribution of the simulation input parameter has been implemented…
We develop a new technique that allows us to show in a unified way that many well-known combinatorial theorems, including Tur\'an's theorem, Szemer\'edi's theorem and Ramsey's theorem, hold almost surely inside sparse random sets. For…
We introduce $p$-uniformity to characterize the scaling of density fluctuations in spatial random systems in $\mathbb{R}^d$, ranging from hyperfluctuation to stealthy hyperuniformity. Our central theorem establishes sufficient conditions to…
A general method for proving continuity of the von Neumann entropy on subsets of positive trace-class operators is considered. This makes it possible to re-derive the known conditions for continuity of the entropy in more general forms and…
We present in this paper a general algorithm for solving first-order formulas in particular theories called "decomposable theories". First of all, using special quantifiers, we give a formal characterization of decomposable theories and…
The asymmetric simple exclusion process (ASEP) is an important model from statistical physics describing particles that hop randomly from one site to the next along an ordered lattice of sites, but only if the next site is empty. ASEP has…