Related papers: Consistency between transitive relations and betwe…
Program equivalence is the fulcrum for reasoning about and proving properties of programs. For noninterference, for example, program equivalence up to the secrecy level of an observer is shown. A powerful enabler for such proofs are logical…
This article investigates the approximation quality achievable for biobjective minimization problems with respect to the Pareto cone by solutions that are (approximately) optimal with respect to larger ordering cones. When simultaneously…
The cutoff phenomenon describes the case when an abrupt transition occurs in the convergence of a Markov chain to its equilibrium measure. There are various metrics which can be used to measure the distance to equilibrium, each of which…
This paper offers a comprehensive treatment of the question as to whether a binary relation can be consistent (transitive) without being decisive (complete), or decisive without being consistent, or simultaneously inconsistent or…
Social networks transmitting covert or sensitive information cannot use all ties for this purpose. Rather, they can only use a subset of ties that are strong enough to be ``trusted''. In this paper we consider transitivity as evidence of…
We consider Markov chains on partially ordered sets that generalize the success-runs and remaining life chains in reliability theory. We find conditions for recurrence and transience and give simple expressions for the invariant…
The theory of fields that are equipped with a countably infinite family of commuting derivations is not companionable; but if the axiom is added whereby the characteristic of the fields is zero, then the resulting theory is companionable.…
We prove that a planar random walk with bounded increments and mean zero which is conditioned to stay in a cone converges weakly to the corresponding Brownian meander if and only if the tail distribution of the exit time from the cone is…
Let $A$ be a (not necessarily unital) separable non-elementary simple amenable C*-algebra whose tracial basis may not have finite covering dimension and may not be compact but satisfies certain condition (C). We show that $A$ is ${\cal…
We address the problem of link reciprocity, the non-random presence of two mutual links between pairs of vertices. We propose a new measure of reciprocity that allows the ordering of networks according to their actual degree of correlation…
A popular question in Bernoulli percolation models is if the probability of connection between two vertices in a transitive graph decays monotonically with the distance between these two vertices. For example, on the square lattice is an…
We study a simple example of a sequential game illustrating problems connected with making rational decisions that are universal for social sciences. The set of chooser's optimal decisions that manifest his preferences in case of a constant…
The present work generalizes the analytical results of Petrikaite (2016) to a market where more than two firms interact. As a consequence, for a generic number of firms in the oligopoly model described by Janssen et al (2005), the…
We say that a theory $T$ is intermediate under effective reducibility if the isomorphism problems among its computable models is neither hyperarithmetic nor on top under effective reducibility. We prove that if an infinitary sentence $T$ is…
Given a linearly ordered set I, every surjective map p: A --> I endows the set A with a structure of set of preferences by "replacing" the elements of I with their inverse images via p considered as "balloons" (sets endowed with an…
A set theory is developed based on the approximations of sets and denoted by AS. In AS the set of all sets exists but the argument for Russell's and Cantor's paradox fail. The Axioms of Separation, Replacement and Foundation are not valid.…
By proving a local limit theorem for higher-order transitions, we determine the time required for necklace chains to be close to stationarity. Because necklace chains, built by arranging identical smaller chains around a directed cycle, are…
We establish the Subgradient Theorem for monotone correspondences -- a monotone correspondence is equal to the subdifferential of a potential if and only if it is conservative, i.e. its integral along a closed path vanishes irrespective of…
We develop a version of the fundamental theorem of asset pricing for discrete-time markets with proportional transaction costs and model uncertainty. A robust notion of no-arbitrage of the second kind is defined and shown to be equivalent…
The causal order of events need not be fixed: whether a bus arrives before or after another at a certain stop can depend on other variables -- like traffic. Coherent quantum control of causal order is possible too and is a useful resource…