Related papers: Size of exceptional sets in weakly mixing systems
We establish the sharpness of the percolation phase transition for a class of infinite-range weighted random connection models. The vertex set is given by a marked Poisson point process on $\mathbb{R}^d$ with intensity $\lambda>0$, where…
We establish the geometric ergodicity of the preconditioned Hamiltonian Monte Carlo (HMC) algorithm defined on an infinite-dimensional Hilbert space, as developed in [Beskos et al., Stochastic Process. Appl., 2011]. This algorithm can be…
The unitary extension principle (UEP) by Ron and Shen yields conditions for the construction of a multi-generated tight wavelet frame for $L^2(\mr^s)$ based on a given refinable function. In this paper we show that the UEP can be…
The performance of iterative decoding techniques for linear block codes correcting erasures depends very much on the sizes of the stopping sets associated with the underlying Tanner graph, or, equivalently, the parity-check matrix…
Let $T:[0,1]^d \rightarrow[0,1]^d$ be a piecewise expanding map with an absolutely continuous (with respect to the $d$-dimensional Lebesgue measure $m_d$) $T$-invariant probability measure $\mu$. Let $\left\{\mathbf{r}_n\right\}$ be a…
We consider the structured-output prediction problem through probabilistic approaches and generalize the "perturb-and-MAP" framework to more challenging weighted Hamming losses, which are crucial in applications. While in principle our…
The cutoff phenomenon describes a sharp transition in the convergence of a Markov chain to equilibrium. In recent work, the authors established cutoff and its location for the stochastic Ising model on the $d$-dimensional torus $(Z/nZ)^d$…
We study, in finite volume, a grand canonical version of the McKean-Vlasov equation where the total particle content is allowed to vary. The dynamics is anticipated to minimize an appropriate grand canonical free energy; we make this notion…
We introduce the post-processing preorder and equivalence relations for general measurements on a possibly infinite-dimensional general probabilistic theory described by an order unit Banach space $E$ with a Banach predual. We define the…
For random systems subject to a constraint, the microcanonical ensemble requires the constraint to be met by every realisation ("hard constraint"), while the canonical ensemble requires the constraint to be met only on average ("soft…
If $(X,d)$ is a metric space then the map $f\colon X\to X$ is defined to be a weak contraction if $d(f(x),f(y))<d(x,y)$ for all $x,y\in X$, $x\neq y$. We determine the simplest non-closed sets $X\subseteq \mathbb{R}^n$ in the sense of…
Let $X$ and $Y$ be separable Banach spaces. Suppose $Y$ either has a shrinking basis or $Y$ is isomorphic to $C(2^\mathbb{N})$ and $A$ is a subset of weakly compact operators from $X$ to $Y$ which is analytic in the strong operator…
The quantum Schur transform maps the computational basis of a system of $n$ qudits onto a \textit{Schur basis}, which spans the minimal invariant subspaces of the representations of the unitary and the symmetric groups acting on the state…
The rate regions of multilevel diversity coding systems (MDCS), a sub-class of the broader family of multi-source multi-sink networks with special structure, are investigated. After showing how to enumerate all non-isomorphic MDCS instances…
We propose a new method for constructing Turing ideals satisfying principles of reverse mathematics below the Chain-Antichain Principle (CAC). Using this method, we are able to prove several new separations in the presence of Weak Konig's…
We study large-scale systems operating under the JSQ$(d)$ policy in the presence of stringent task-server compatibility constraints. Consider a system with $N$ identical single-server queues and $M(N)$ task types, where each server is able…
Chunked codes are efficient random linear network coding (RLNC) schemes with low computational cost, where the input packets are encoded into small chunks (i.e., subsets of the coded packets). During the network transmission, RLNC is…
We extend results on robust exponential mixing for geometric Lorenz attractors, with a dense orbit and a unique singularity, to singular-hyperbolic attracting sets with any number of (either Lorenz- or non-Lorenz-like) singularities and…
Spatially periodic elastic metamaterials, comprising hard inclusions within a soft matrix in $d$-dimensional space ($d\geq 2$), exhibit a rich spectrum of physical phenomena. This paper investigates such a model and presents the following…
Lifting is a crucial technique in mixed integer programming (MIP) for generating strong valid inequalities, which serve as cutting planes to improve the branch-and-cut algorithm. We first propose an exact sequential lifting algorithm for…