English
Related papers

Related papers: Complete $\omega$-Regular Supermartingale Certific…

200 papers

We consider the almost-sure (a.s.) termination problem for probabilistic programs, which are a stochastic extension of classical imperative programs. Lexicographic ranking functions provide a sound and practical approach for termination of…

Programming Languages · Computer Science 2021-08-05 Krishnendu Chatterjee , Ehsan Kafshdar Goharshady , Petr Novotný , Jiří Zárevúcky , Đorđe Žikelić

We give a Markov chain based algorithm for sampling almost uniform solutions of constraint satisfaction problems (CSPs). Assuming a canonical setting for the Lov\'asz local lemma, where each constraint is violated by a small number of…

Data Structures and Algorithms · Computer Science 2021-04-13 Weiming Feng , Kun He , Yitong Yin

The extension of classical imperative programs with real-valued random variables and random branching gives rise to probabilistic programs. The termination problem is one of the most fundamental liveness properties for such programs. The…

Programming Languages · Computer Science 2021-08-09 Krishnendu Chatterjee , Ehsan Kafshdar Goharshady , Petr Novotný , Jiři Zárevúcky , Đorđe Žikelić

Continuous Markovian Logic (CML) is a multimodal logic that expresses quantitative and qualitative properties of continuous-time labelled Markov processes with arbitrary (analytic) state-spaces, henceforth called continuous Markov processes…

Logic in Computer Science · Computer Science 2015-07-01 Radu Mardare , Luca Cardelli , Kim G. Larsen

We study inhomogeneous continuous-time weakly ergodic Markov chains with a finite state space. We introduce the notion of a Markov chain with the regular structure of an infinitesimal matrix and study the sharp upper bounds on the rate of…

Probability · Mathematics 2020-02-17 A. I. Zeifman , Y. A. Satin , K. M. Kiseleva

The Robbins-Siegmund theorem establishes the convergence of stochastic processes that are almost supermartingales and is one of the most commonly used approaches for analyzing stochastic iterative algorithms in stochastic approximation and…

Machine Learning · Computer Science 2026-05-28 Xinyu Liu , Zixuan Xie , Shangtong Zhang

We consider a Markov chain $\{X_n\}_{n=0}^\8$ on $\R^d$ defined by the stochastic recursion $X_{n}=M_n X_{n-1}+Q_n$, where $(Q_n,M_n)$ are i.i.d. random variables taking values in the affine group $H=\R^d\rtimes {\rm GL}(\R^d)$. Assume that…

Probability · Mathematics 2008-11-10 Dariusz Buraczewski , Ewa Damek , Yves Guivarc'h

(CROPPED TO FIT IN ARXIV'S SILLY LIMIT. SEE PDF FOR COMPLETE ABSTRACT.) We are the first to thoroughly explore a large space of formal secure compilation criteria based on robust property preservation, i.e., the preservation of properties…

Programming Languages · Computer Science 2020-11-18 Carmine Abate , Roberto Blanco , Deepak Garg , Catalin Hritcu , Marco Patrignani , Jérémy Thibault

We consider Markov processes with generator of the form $\gamma \mathcal{L}_{1} + \mathcal{L}_{0}$, in which $\mathcal{L}_{1}$ generates a so-called dominant process that converges at large times towards a random point in a fixed subset…

Probability · Mathematics 2023-05-16 Dimitri Faure , Mathias Rousset

We analyze the trapping of diffusing ligands, modeled as Brownian particles, by a sphere that has $N$ partially reactive boundary patches, each of small area and arbitrary shape, on an otherwise reflecting boundary. For such a structured…

Analysis of PDEs · Mathematics 2026-01-08 Denis S. Grebenkov , Michael J. Ward

In this paper, we associate, to any submartingale of class $(\Sigma)$, defined on a filtered probability space $(\Omega, \mathcal{F}, \mathbb{P}, (\mathcal{F}_t)_{t \geq 0})$, which satisfies some technical conditions, a $\sigma$-finite…

Probability · Mathematics 2009-06-10 Joseph Najnudel , Ashkan Nikeghbali

We propose a sound and complete proof rule ProbTA for quantitative analysis of violation probability of probabilistic programs. Our approach extends the technique of trace abstraction with probability in the control-flow randomness style,…

Programming Languages · Computer Science 2022-03-10 Guanyan Li , Zhilei Han , Fei He

We introduce the categories of quasi-measurable spaces, which are slight generalizations of the category of quasi-Borel spaces, where we now allow for general sample spaces and less restrictive random variables, spaces and maps. We show…

Probability · Mathematics 2021-09-27 Patrick Forré

We prove that a class of infinite measure preserving transformations, satisfying a "strong" weak mixing condition, generates all rigidity sequences of all conservative ergodic invertible measure preserving transformations defined on a…

Dynamical Systems · Mathematics 2015-03-20 Terrence M. Adams

We show how the essential spectral radius of a bounded positive kernel, acting on bounded functions, is linked to its lower approximation by certain absolutely continuous kernels. The standart Doeblin's condition can be interpreted in this…

Probability · Mathematics 2007-05-23 Hubert Hennion

The acoustic properties of a porous sheet of medium resistivity backed by a rigid plate in which are embedded a periodic set of circular inclusions is investigated. Such a structure behaves like a multi-component diffraction gratings.…

Classical Physics · Physics 2010-07-20 Jean-Philippe Groby , Olivier Dazel , Aroune Duclos , Laurens Boeckx , Walter Lauriks

We study black-box testing for stochastic systems and arbitrary $\omega$-regular specifications, explicitly including liveness properties. We are given a finite-state probabilistic system that we can only execute from the initial state. We…

Formal Languages and Automata Theory · Computer Science 2024-06-05 Javier Esparza , Vincent Grande

Continuous weak measurement allows localizing open quantum systems in state space, and tracing out their quantum trajectory as they evolve in time. Efficient quantum measurement schemes have previously enabled recording quantum trajectories…

Quantum Physics · Physics 2019-10-15 Massimiliano Rossi , David Mason , Junxin Chen , Albert Schliesser

A central task in quantum information science is state certification: testing whether an unknown state is $\epsilon_1$-close to a fixed target state, or $\epsilon_2$-far. Recent work has shown that surprisingly simple measurement…

Quantum Physics · Physics 2026-02-13 Andrea Coladangelo , Jerry Li , Joseph Slote , Ellen Wu

We introduce and study two new relations between function spaces over measure spaces of infinite measure, motivated by the question of establishing compactness. The first relation captures the uniform decay of function (quasi-)norms ``at…

Functional Analysis · Mathematics 2025-11-25 Zdeněk Mihula , Maximilián Pándy