Related papers: Separations between Combinatorial Measures for Tra…
In computational complexity, a complexity class is given by a set of problems or functions, and a basic challenge is to show separations of complexity classes $A \not= B$ especially when $A$ is known to be a subset of $B$. In this paper we…
A univariate continuous function can always be decomposed as the sum of a non-increasing function and a non-decreasing one. Based on this property, we propose a non-parametric regression method that combines two spline-fitted monotone…
The spectral norm of a Boolean function $f:\{0,1\}^n \to \{-1,1\}$ is the sum of the absolute values of its Fourier coefficients. This quantity provides useful upper and lower bounds on the complexity of a function in areas such as learning…
We describe a general approach to the theory of self consistent transfer operators. These operators have been introduced as tools for the study of the statistical properties of a large number of all to all interacting dynamical systems…
Recently, Deshpande et al. introduced a new measure of the complexity of a Boolean function. We call this measure the "goal value" of the function. The goal value of $f$ is defined in terms of a monotone, submodular utility function…
We provide explicit formulaes for the first Kantorovich-Wasserstein distance between stationary measures for iterated function scheme on the unit interval. In particular, we consider two stationary measures with different configurations of…
We study functional clones, which are sets of non-negative pseudo-Boolean functions (functions $\{0,1\}^k\to\mathbb{R}_{\geq 0}$) closed under (essentially) multiplication, summation and limits. Functional clones naturally form a lattice…
Suppose that $f$ belongs to a suitably defined complete metric space $ {{\cal C}}^{{\alpha}}$ of H\"older $ {\alpha}$-functions defined on $[0,1]$. We are interested in whether one can find large (in the sense of Hausdorff, or lower/upper…
We present the basic elements of a generalization of symmetric function theory involving functions of commuting and anticommuting (Grassmannian) variables. These new functions, called symmetric functions in superspace, are invariant under…
The modified measure theories recommend themselves as a good possibility to go beyond the standard formulation to solve yet unsolved problems. The Galileon measure that is constructed in the way to be invariant under the Galileon shift…
We present dichotomy theorems regarding the computational complexity of counting fixed points in boolean (discrete) dynamical systems, i.e., finite discrete dynamical systems over the domain {0,1}. For a class F of boolean functions and a…
Let $(X,d)$ be a compact metric space, and let an iterated function system (IFS) be given on $X$, i.e., a finite set of continuous maps $\sigma_{i}$: $ X\to X$, $i=0,1,..., N-1$. The maps $\sigma_{i}$ transform the measures $\mu $ on $X$…
We propose a class of incompatibility measures for quantum observables based on quantifying the effect of a measurement of one observable on the statistics of the outcomes of another. Specifically, for a pair of observables $A$ and $B$ with…
We will study some important properties of Boolean functions based on newly introduced concepts called Special Decomposition of a Set and Special Covering of a Set. These concepts enable us to study important problems concerning Boolean…
While Kramers' rates have been studied for almost a century, the transition path time between states has only recently received attention. Transition paths between different energy levels are expected to be indistinguishable in shape and…
Getting tools that allow simple representations and comparisons of a set of categorical trajectories is of major interest for statisticians. Without loosing any information, we associate to each state a binary random indicator function,…
We consider the problem of detecting gradual changes in the sequence of mean functions from a not necessarily stationary functional time series. Our approach is based on the maximum deviation (calculated over a given time interval) between…
We initiate a program of average smoothness analysis for efficiently learning real-valued functions on metric spaces. Rather than using the Lipschitz constant as the regularizer, we define a local slope at each point and gauge the function…
The OSSS inequality [O'Donnell, Saks, Schramm and Servedio, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), Pittsburgh (2005)] gives an upper bound for the variance of a function f of independent 0-1 valued random…
A human is a thing that moves in space. Like all things that move in space, we can in principle use differential equations to describe their motion as a set of functions that maps time to position (and velocity, acceleration, and so on).…