Related papers: On maximal agreement couplings
Particle-like objects are observed to propagate and interact in many spatially extended dynamical systems. For one of the simplest classes of such systems, one-dimensional cellular automata, we establish a rigorous upper bound on the number…
Mathematical Selection is a method in which we select a particular choice from a set of such. It have always been an interesting field of study for mathematicians. Combinatorial optimisation is the practice of selecting the best constituent…
In this paper, we study some control problems that derive from time optimal control of coupled spin dynamics in NMR spectroscopy and quantum information and computation. Time optimal control helps to minimize relaxation losses. The ability…
Two-dimensional mappings obtained by coupling two piecewise increasing expanding maps are considered. Their dynamics is described when the coupling parameter increases in the expanding domain. By introducing a coding and by analysing an…
We prove that, for every one-dimendional exponentially ergodic probabilistic cellular automaton with positive rates, there exists a locally defined coupling-from-the-past flow whose coalescence time has a finite exponential moment.
A method for producing an upper bound for all multipartite purification protocols is devised, based on knowing the optimal protocol for purifying bipartite states. When applied to a range of noise models, both local and correlated, the…
We consider the problem of discriminating between states of a specified set with maximum confidence. For a set of linearly independent states unambiguous discrimination is possible if we allow for the possibility of an inconclusive result.…
In Bipartite Correlation Clustering (BCC) we are given a complete bipartite graph $G$ with `+' and `-' edges, and we seek a vertex clustering that maximizes the number of agreements: the number of all `+' edges within clusters plus all `-'…
Dual control denotes a class of control problems where the parameters governing the system are imperfectly known. The challenge is to find the optimal balance between probing, i.e. exciting the system to understand it more, and caution,…
The Balanced Stable Marriage problem is a central optimization version of the classic Stable Marriage problem. Here, the output cannot be an arbitrary stable matching, but one that balances between the dissatisfaction of the two parties,…
In this paper, we study a maximization problem on real sequences. More precisely, for a given sequence, we are interested in computing the supremum of the sequence and an index for which the associated term is maximal. We propose a general…
Generalized from the concept of consensus, this paper considers a group of edge agreements, i.e. constraints defined for neighboring agents, in which each pair of neighboring agents is required to satisfy one edge agreement constraint. Edge…
I introduce a stability notion, dynamic stability, for two-sided dynamic matching markets where (i) matching opportunities arrive over time, (ii) matching is one-to-one, and (iii) matching is irreversible. The definition addresses two…
In this paper, a new upper bound for the Multiple Knapsack Problem (MKP) is proposed, based on the idea of relaxing MKP to a {\em Bounded Sequential Multiple Knapsack Problem}, i.e., a multiple knapsack problem in which item sizes are…
Proof by coupling is a classical technique for proving properties about pairs of randomized algorithms by carefully relating (or coupling) two probabilistic executions. In this paper, we show how to automatically construct such proofs for…
Motivated by a general principle governing regulation mechanisms in biological cells, we investigate a general interaction scheme between different populations of particles and specific particles, referred to as agents. Assuming that each…
We study systems of identical coupled oscillators introducing a distribution of delay times in the coupling. For arbitrary network topologies, we show that the frequency and stability of the fully synchronized states depend only on the mean…
An alternative proof is given of the existence of greatest lower bounds in the imbalance order of binary maximal instantaneous codes of a given size. These codes are viewed as maximal antichains of a given size in the infinite binary tree…
We consider stochastic processes arising from dynamical systems by evaluating an observable function along the orbits of the system. The novelty is that we will consider observables achieving a global maximum value (possible infinite) at…
We discuss the optimal Markovian coupling before an exponential time of the Kolmogorov diffusion, and a class of related stochastic control problems in which the aim is to hit the origin before an exponential time. We provide a scaling…