Related papers: Probability models characterized by generalized re…
Naturalistic driving data were applied to study driver acceleration behaviour, and a probability model of the driver was proposed. First, the question of whether the database is large enough is resolved using kernel density estimation and…
The doubly minimized Petz Renyi mutual information of order $\alpha$ is defined as the minimization of the Petz divergence of order $\alpha$ of a fixed bipartite quantum state relative to any product state. The doubly minimized sandwiched…
Binary concepts are empirically used by humans to generalize efficiently. And they are based on Bernoulli distribution which is the building block of information. These concepts span both low-level and high-level features such as "large vs…
The generalized operator-based Prony method is an important tool for describing signals which can be written as finite linear combinations of eigenfunctions of certain linear operators. On the other hand, Bernoulli's algorithm and its…
A generalized modular relation of the form $F(z, w, \alpha)=F(z, iw,\beta)$, where $\alpha\beta=1$ and $i=\sqrt{-1}$, is obtained in the course of evaluating an integral involving the Riemann $\Xi$-function. It is a two-variable…
This paper presents Sparse Partitioning, a Bayesian method for identifying predictors that either individually or in combination with others affect a response variable. The method is designed for regression problems involving binary or…
In a strand of the literature, it is assumed that the common prior has full support; that is, every type of every player is assigned positive probability. Morris (1991,1994) established an epistemological-behavioral duality characterisation…
The distribution of word probabilities in the monkey model of Zipf's law is associated with two universality properties: (1) the power law exponent converges strongly to $-1$ as the alphabet size increases and the letter probabilities are…
Probabilistic automata (PA), also known as probabilistic nondeterministic labelled transition systems, combine probability and nondeterminism. They can be given different semantics, like strong bisimilarity, convex bisimilarity, or (more…
Developing new ways to estimate probabilities can be valuable for science, statistics, and engineering. By considering the information content of different output patterns, recent work invoking algorithmic information theory has shown that…
Usually, probabilistic automata and probabilistic grammars have crisp symbols as inputs, which can be viewed as the formal models of computing with values. In this paper, we first introduce probabilistic automata and probabilistic grammars…
We define the notion of a determined Borel code in reverse math, and consider the principle $DPB$, which states that every determined Borel set has the property of Baire. We show that this principle is strictly weaker than $ATR$. Any…
The noncommutative analog of an approximative absolute retract (AAR) is introduced, a weakly projective C*-algebra. This property sits between being residually finite dimensional and projectivity. Examples and closure properties are…
For $p \in (0,1)$, sample a binary sequence from the infinite product measure of Bernoulli$(p)$ distributions. It is known that for $p=1/2$, almost every binary sequence is Poisson generic in the sense of Peres and Weiss, a property that…
Motivated by algorithmic problems from combinatorial group theory we study computational properties of integers equipped with binary operations +, -, z = x 2^y, z = x 2^{-y} (the former two are partial) and predicates < and =. Notice that…
In this paper, we study a bi-criterion framework for assessing scoring functions in the context of binary classification. The positive and negative predictive values (ppv and npv, respectively) are conditional probabilities of the true…
Since many years characterization of distribution by linearity of regression of non-adjacent weak records E(W_{i+s}|W_i) = \beta_1 W_i+\beta_0 for discrete observations has been known to be a difficult question. Lopez- Blazquez (2004)…
We study the order theoretic properties of relative weak injectivity, w.r.i., in short, in the category of C*-algebras. We prove that Arveson's extension theorem, with additional order assumption on the morphisms, is tightly connected with…
The infinite-dimensional information operator for the nuisance parameter plays a key role in semiparametric inference, as it is closely related to the regular estimability of the target parameter. Calculation of information operators has…
Meadows are a sort of commutative rings with a multiplicative identity element and a total multiplicative inverse operation. In this paper we study algebraic properties of common meadows, which are meadows that introduce, as the inverse of…