Related papers: Probabilistic Stable Functions on Discrete Cones a…
From the structure of the category of representations of an affine cycle-free quiver, we determine an explicit linear form on the space of regular cuspidal functions over a finite field: its kernel is exactly the space of cuspidal…
The problem of belief tracking in the presence of stochastic actions and observations is pervasive and yet computationally intractable. In this work we show however that probabilistic beliefs can be maintained in factored form exactly and…
Interactive proof systems whose verifiers are constant-space machines have interesting features that do not have counterparts in the better studied case where the verifiers operate under reasonably large space bounds. The language…
This work studies the question of learning probabilistic deterministic automata from language models. For this purpose, it focuses on analyzing the relations defined on algebraic structures over strings by equivalences and similarities on…
A group may be considered $C^*$-stable if almost representations of the group in a $C^*$-algebra are always close to actual representations. We initiate a systematic study of which discrete groups are $C^*$-stable or only stable with…
Church-Ellenberg-Farb used the language of FI-modules to prove that the cohomology of certain sequences of hyperplane arrangements with S_n-actions satisfies representation stability. Here we lift their results to the level of the…
The Promise Constraint Satisfaction Problem (PCSP for short) is a generalization of the well-studied Constraint Satisfaction Problem (CSP). The PCSP has its roots in such classic problems as the Approximate Graph Coloring and the…
Strassen's classical martingale coupling theorem states that two real-valued random variables are ordered in the convex (resp.\ increasing convex) stochastic order if and only if they admit a martingale (resp.\ submartingale) coupling. By…
State-space models (SSMs) are a highly expressive model class for learning patterns in time series data and for system identification. Deterministic versions of SSMs (e.g. LSTMs) proved extremely successful in modeling complex time series…
Unlike classical and free independence, the boolean and monotone notions of independence lack of the property of independent constants. In the scalar case, this leads to restrictions for the central limit theorems, as observed by F.…
Performative prediction is a framework for learning models that influence the data they intend to predict. We focus on finding classifiers that are performatively stable, i.e. optimal for the data distribution they induce. Standard…
In this paper we give a generalization of the discrete complex-valued random variable defined and investigated in \cite{ssa} and \cite{m8}. We prove the statements concerning the expressions for the excepted value and the variance of this…
In this paper, we show that there is a large class of fermionic systems for which it is possible to find, for any dimension, a finite closed set of eigenoperators and eigenvalues of the Hamiltonian. Then, the hierarchy of the equations of…
A growing body of research on probabilistic programs and causal models has highlighted the need to reason compositionally about model classes that extend directed graphical models. Both probabilistic programs and causal models define a…
We derive the probability distribution of product of two independent random variables, each distributed according the one-dimensional stable law. We represent the density by its power series and its asymptotic expansions. As Fox's…
Mathematical Theory of Evidence called also Dempster-Shafer Theory (DST) is known as a foundation for reasoning when knowledge is expressed at various levels of detail. Though much research effort has been committed to this theory since its…
In the present paper we consider the problem of estimating the multidimensional power spectral density which describes a second-order stationary random field from a finite number of covariance and generalized cepstral coefficients. The…
C*-algebras form rather general and rich mathematical structures that can be studied with different morphisms (preserving multiplication, or not), and with different properties (commutative, or not). These various options can be used to…
Consistent Hoare, Smyth and Plotkin power domains are introduced and discussed by Yuan and Kou. The consistent algebraic operation $+$ defined by them is a binary partial Scott continuous operation satisfying the requirement: $a+b$ exists…
We consider the stability and the input-output analysis problems of a class of large-scale hybrid systems composed of continuous dynamics coupled with discrete dynamics defined over finite alphabets, e.g., deterministic finite state…