相关论文: Stochastic monotonicity and realizable monotonicit…

For many real-life Bayesian networks, common knowledge dictates that the output established for the main variable of interest increases with higher values for the observable variables. We define two concepts of monotonicity to capture this…

When it comes to structural estimation of risk preferences from data on choices, random utility models have long been one of the standard research tools in economics. A recent literature has challenged these models, pointing out some…

The equivalence of the characteristic function approach and the probabilistic approach to monotone and boolean convolutions is proven for non-compactly supported probability measures. A probabilistically motivated definition of the…

This paper is the first part of a project devoted to studying the interconnection between controllability properties of a dynamical system and the large-time asymptotics of trajectories for the associated stochastic system. It is proved…

Stationarity is a very general, qualitative assumption, that can be assessed on the basis of application specifics. It is thus a rather attractive assumption to base statistical analysis on, especially for problems for which less general…

Topological models of empirical and formal inquiry are increasingly prevalent. They have emerged in such diverse fields as domain theory [1, 16], formal learning theory [18], epistemology and philosophy of science [10, 15, 8, 9, 2],…

A monotone self-mapping of the nonnegative orthant induces a monotone discrete-time dynamical system which evolves on the same orthant. If with respect to this system the origin is attractive then there must exists points whose image under…

In this paper, for the first time in the literature, we study the stability of solutions of two classes of feasibility (i.e., split equality and split feasibility) problems by set-valued and variational analysis techniques. Our idea is to…

We demonstrate the equilibration of isolated macroscopic quantum systems, prepared in non-equilibrium mixed states with significant population of many energy levels, and observed by instruments with a reasonably bound working range compared…

Alon and Shapira proved that every monotone class (closed under taking subgraphs) of undirected graphs is strongly testable, that is, under the promise that a given graph is either in the class or $\varepsilon$-far from it, there is a test…

Catering to the incentives of people with limited rationality is a challenging research direction that requires novel paradigms to design mechanisms and approximation algorithms. Obviously strategyproof (OSP) mechanisms have recently…

A quotient of a poset $P$ is a partial order obtained on the equivalence classes of an equivalence relation $\theta$ on $P$; $\theta$ is then called a congruence if it satisfies certain conditions, which vary according to different…

Given the significance of physical measures in understanding the complexity of dynamical systems as well as the noisy nature of real-world systems, investigating the stability of physical measures under noise perturbations is undoubtedly a…

Most of the stochastic orders for comparing random variables, considered in the literature, are afflicted with two main drawbacks: (i) lack of connex property and (ii) lack of consideration of any dependence structure between the random…

We introduce the problem of temporal coverability for realizability and synthesis. Namely, given a language of words that must be covered by a produced system, how to automatically produce such a system. We consider the case of coverability…

We study which outcomes are implementable by disclosing coarse statistics of a data-generating process rather than its full distribution. Players observe data whose joint distribution is only partially known: they know the expectations of…

We propose a computational framework to quantify (measure) and to optimize the reliability of complex systems. The approach uses a graph representation of the system that is subject to random failures of its components (nodes and edges).…

The Boolean satisfiability problem (SAT) is a well-known example of monotonic reasoning, of intense practical interest due to fast solvers, complemented by rigorous fine-grained complexity results. However, for non-monotonic reasoning,…

In many real world chaotic systems, the interest is typically in determining when the system will behave in an extreme manner. Flooding and drought, extreme heatwaves, large earthquakes, and large drops in the stock market are examples of…

This paper conducts sensitivity analysis of random constraint and variational systems related to stochastic optimization and variational inequalities. We establish efficient conditions for well-posedness, in the sense of robust Lipschitzian…