English
Related papers

Related papers: On a dyadic approximation of predictable processes…

200 papers

As we discuss, a stationary stochastic process is nonergodic when a random persistent topic can be detected in the infinite random text sampled from the process, whereas we call the process strongly nonergodic when an infinite sequence of…

Information Theory · Computer Science 2020-03-11 Łukasz Dębowski

We study the termination problem for nondeterministic recursive probabilistic programs. First, we show that a ranking-supermartingales-based approach is both sound and complete for bounded terminiation (i.e., bounded expected termination…

Programming Languages · Computer Science 2017-01-12 Krishnendu Chatterjee , Hongfei Fu

A multivariate, stationary time series is said to be jointly regularly varying if all its finite-dimensional distributions are multivariate regularly varying. This property is shown to be equivalent to weak convergence of the conditional…

Probability · Mathematics 2007-07-27 Bojan Basrak , Johan Segers

Sequential propositional logic deviates from ordinary propositional logic by taking into account that during the sequential evaluation of a propositional statement,atomic propositions may yield different Boolean values at repeated…

Logic in Computer Science · Computer Science 2011-06-28 J. A. Bergstra , A. Ponse

A probabilistic propositional logic, endowed with an epistemic component for asserting (non-)compatibility of diagonizable and bounded observables, is presented and illustrated for reasoning about the random results of projective…

Logic · Mathematics 2018-03-20 A. Sernadas , J. Rasga , C. Sernadas , L. Alcácer , A. B. Henriques

Through a straightforward Bayesian approach we show that under some general conditions a maximum running time, namely the number of discrete steps performed by a computer program during its execution, can be defined such that the…

History and Overview · Mathematics 2007-05-23 Germano D'Abramo

Given an arbitrary long but finite sequence of observations from a finite set, we construct a simple process that approximates the sequence, in the sense that with high probability the empirical frequency, as well as the empirical one-step…

Statistics Theory · Mathematics 2007-06-13 Dinah Rosenberg , Eilon Solan , Nicolas Vieille

The asymptotic behavior, as $n\rightarrow \infty $ of the probability of the event that a decomposable critical branching process $\mathbf{Z}(m)=(Z_{1}(m),...,Z_{N}(m)),$ $m=0,1,2,...,$ with $N$ types of particles dies at moment $n$ is…

Probability · Mathematics 2015-04-21 Vladimir Vatutin , Elena Dyakonova

We study the approximation of stationary processes by a simple class of purely deterministic signals. This has an analytic counterpart in the approximation of symmetric positive definite Toeplitz matrices by submatrices of finite rank. We…

Probability · Mathematics 2020-09-15 Giorgio Picci , Bin Zhu

Let the adiabatic invariant of action variable in slow-fast Hamiltonian system with two degrees of freedom have two limiting values along the trajectories as time tends to infinity. The difference of two limits is exponentially small in…

Dynamical Systems · Mathematics 2015-05-27 Tan Su

We construct a class of nonnegative martingale processes that oscillate indefinitely with high probability. For these processes, we state a uniform rate of the number of oscillations and show that this rate is asymptotically close to the…

Machine Learning · Computer Science 2014-08-18 Jan Leike , Marcus Hutter

For three natural classes of dynamic decision problems; 1. additively separable problems, 2. discounted problems, and 3. discounted problems for a fixed discount factor; we provide necessary and sufficient conditions for one sequential…

Theoretical Economics · Economics 2024-05-24 Mark Whitmeyer , Cole Williams

We study almost sure limiting behavior of extreme and intermediate order statistics arising from strictly stationary sequences. First, we provide sufficient dependence conditions under which these order statistics converges almost surely to…

Probability · Mathematics 2017-04-28 Aneta Buraczyńska , Anna Dembińska

We apply adiabatic theorems developed for quantum mechanics to stochastic annealing processes described by the classical master equation with a time-dependent generator. When the instantaneous stationary state is unique and the minimum…

Statistical Mechanics · Physics 2024-03-21 Kazutaka Takahashi

We study a natural variant of the implicational fragment of propositional logic. Its formulas are pairs of conjunctions of positive literals, related together by an implicational-like connective; the semantics of this sort of implication is…

Logic in Computer Science · Computer Science 2023-06-22 Albert Atserias , José L. Balcázar , Marie Ely Piceno

The limiting behavior of Toeplitz type quadratic forms of stationary processes has received much attention through decades, particularly due to its importance in statistical estimation of the spectrum. In the present paper we study such…

Probability · Mathematics 2018-08-20 Mikkel Slot Nielsen , Jan Pedersen

We give a finite-sample analysis of predictive inference procedures after model selection in regression with random design. The analysis is focused on a statistically challenging scenario where the number of potentially important…

Statistics Theory · Mathematics 2009-08-26 Hannes Leeb

The accurate estimation of scaling exponents is central in the observational study of scale-invariant phenomena. Natural systems unavoidably provide observations over restricted intervals; consequently a stationary stochastic process (time…

Data Analysis, Statistics and Probability · Physics 2009-03-17 K. H. Kiyani , S. C. Chapman , N. W. Watkins

Consider finitely many nets of multivariate c\`adl\`ag stochastic processes. We show that the vectors consisting of the respective minimizing points converge in distribution to a random closed set. This set is given as a cartesian product…

Probability · Mathematics 2025-12-09 Dietmar Ferger , Niklas Rosar

With help of a compact Prolog-based theorem prover for Intuitionistic Propositional Logic, we synthesize minimal assumptions under which a given formula formula becomes a theorem. After applying our synthesis algorithm to cover basic…

Logic in Computer Science · Computer Science 2022-05-13 Paul Tarau