arXiv subjects

Armen E. Allahverdyan

Publications and source records attributed to Armen E. Allahverdyan.

At least 37 records · Page 2Linked to original sources

arXiv2018

Active image restoration

We study active restoration of noise-corrupted images generated via the Gibbs probability of an Ising ferromagnet in external magnetic field. Ferromagnetism accounts for the prior expectation of data smoothness, i.e. a positive correlation between neighbouring pixels (Ising spins), while the magnetic field refers to the bias. The restoration is actively supervised by requesting the true values of certain pixels after a noisy observation. This additional information improves restoration of other pixels. The optimal strategy of active inference is not known for realistic (two-dimensional) images. We determine this strategy for the mean-field version of the model and show that it amounts to supervising the values of spins (pixels) that do not agree with the sign of the average magnetization. The strategy leads to a transparent analytical expression for the minimal Bayesian risk, and shows that there is a maximal number of pixels beyond of which the supervision is useless. We show numerically that this strategy applies for two-dimensional images away from the critical regime. Within this regime the strategy is outperformed by its local (adaptive) version, which supervises pixels that do not agree with their Bayesian estimate. We show on transparent examples how active supervising can be essential in recovering noise-corrupted images and advocate for a wider usage of active methods in image restoration.

cond-mat.stat-mech↗

arXiv2018

Quantum non-locality co-exists with locality

Quantum non-locality is normally defined via violations of Bell's inequalities that exclude certain classical hidden variable theories from explaining quantum correlations. Another definition of non-locality refers to the wave-function collapse thereby one can prepare a quantum state from arbitrary far away. In both cases one can debate on whether non-locality is a real physical phenomenon, e.g. one can employ formulations of quantum mechanics that does not use collapse, or one can simply refrain from explaining quantum correlations via classical hidden variables. Here we point out that there is a non-local effect within quantum mechanics, i.e. without involving hidden variables or collapse. This effect is seen via imprecise (i.e. interval-valued) joint probability of two observables, which replaces the ill-defined notion of the precise joint probability for non-commuting observables. It is consistent with all requirements for the joint probability, e.g. those for commuting observales. The non-locality amounts to a fact that (in a two-particle system) the joint imprecise probability of non-commuting two-particle observables (i.e. tensor product of single-particle observables) does not factorize into single-particle contributions, even for uncorrelated states of the two-particle system. The factorization is recovered for a less precise (i.e. the one involving a wider interval) joint probability. This approach to non-locality reconciles it with locality, since the latter emerges as a less precise description.

quant-ph↗

arXiv2018

Excluding joint probabilities from quantum theory

Quantum theory does not provide a unique definition for the joint probability of two non-commuting observables, which is the next important question after the Born's probability for a single observable. Instead, various definitions were suggested, e.g. via quasi-probabilities or via hidden-variable theories. After reviewing open issues of the joint probability, we relate it to quantum imprecise probabilities, which are non-contextual and are consistent with all constraints expected from a quantum probability. We study two non-commuting observables in a two-dimensional Hilbert space and show that there is no precise joint probability that applies for any quantum state and is consistent with imprecise probabilities. This contrasts to theorems by Bell and Kochen-Specker that exclude joint probabilities for more than two non-commuting observables, in Hilbert space with dimension larger than two. If measurement contexts are included into the definition, joint probabilities are not anymore excluded, but they are still constrained by imprecise probabilities.

quant-ph↗

arXiv2017

Emergence of Leadership in Communication

We study a neuro-inspired model that mimics a discussion (or information dissemination) process in a network of agents. During their interaction, agents redistribute activity and network weights, resulting in emergence of leader(s). The model is able to reproduce the basic scenarios of leadership known in nature and society: laissez-faire (irregular activity, weak leadership, sizable inter-follower interaction, autonomous sub-leaders); participative or democratic (strong leadership, but with feedback from followers); and autocratic (no feedback, one-way influence). Several pertinent aspects of these scenarios are found as well---e.g., hidden leadership (a hidden clique of agents driving the official autocratic leader), and successive leadership (two leaders influence followers by turns). We study how these scenarios emerge from inter-agent dynamics and how they depend on behavior rules of agents---in particular, on their inertia against state changes.

physics.soc-ph↗

arXiv2016

A sub-ensemble theory of ideal quantum measurement processes

To elucidate ideal measurements, one must explain how individual events emerge from quantum theory which deals with statistical ensembles, and how different may end up with different final states. This so-called "measurement problem" is tackled with two guidelines. On the one hand, the dynamics of the macroscopic apparatus A coupled to the tested system S is described mathematically within a standard quantum formalism, where "q-probablities" remain devoid of interpretation. On the other hand, interpretative principles are introduced to account for the expected features of ideal measurements. Most of the five principles, which relate the quantum formalism to physical reality, are straightforward and refer to macroscopic variables. The process can be identified with a relaxation of S+A to thermodynamic equilibrium, not only for a large ensemble $\scriptE$ of runs but even for its sub-ensembles. The different mechanisms of quantum statistical dynamics that ensure the relaxation are exhibited. The additional information provided by the sub-ensembles remove Schrödinger's quantum ambiguity of the final density operator for $\scriptE$ which hinders its direct interpretation, and bring out a commutative behaviour of the pointer observable at the final time. The latter property supports the introduction of a last principle, needed to switch from the statistical ensembles and sub-ensembles described by quantum theory to individual experimental events. It amounts to identify some formal "q-probabilities" with ordinary frequencies, but only those which refer to the final pointer indications. The desired properties of ideal measurements, in particular the uniqueness of the result for each individual run and von Neumann's reduction, are thereby recovered with economic interpretations. The status of Born's rule involving both A and S is re-evaluated, and contextuality is made obvious.

quant-ph↗

arXiv2016

Stochastic model for phonemes uncovers an author-dependency of their usage

We study rank-frequency relations for phonemes, the minimal units that still relate to linguistic meaning. We show that these relations can be described by the Dirichlet distribution, a direct analogue of the ideal-gas model in statistical mechanics. This description allows us to demonstrate that the rank-frequency relations for phonemes of a text do depend on its author. The author-dependency effect is not caused by the author's vocabulary (common words used in different texts), and is confirmed by several alternative means. This suggests that it can be directly related to phonemes. These features contrast to rank-frequency relations for words, which are both author and text independent and are governed by the Zipf's law.

cs.CL↗

arXiv2014

Active Inference for Binary Symmetric Hidden Markov Models

We consider active maximum a posteriori (MAP) inference problem for Hidden Markov Models (HMM), where, given an initial MAP estimate of the hidden sequence, we select to label certain states in the sequence to improve the estimation accuracy of the remaining states. We develop an analytical approach to this problem for the case of binary symmetric HMMs, and obtain a closed form solution that relates the expected error reduction to model parameters under the specified active inference scheme. We then use this solution to determine most optimal active inference scheme in terms of error reduction, and examine the relation of those schemes to heuristic principles of uncertainty reduction and solution unicity.

stat.ML↗

arXiv2013

Comparative Analysis of Viterbi Training and Maximum Likelihood Estimation for HMMs

We present an asymptotic analysis of Viterbi Training (VT) and contrast it with a more conventional Maximum Likelihood (ML) approach to parameter estimation in Hidden Markov Models. While ML estimator works by (locally) maximizing the likelihood of the observed data, VT seeks to maximize the probability of the most likely hidden state sequence. We develop an analytical framework based on a generating function formalism and illustrate it on an exactly solvable model of HMM with one unambiguous symbol. For this particular model the ML objective function is continuously degenerate. VT objective, in contrast, is shown to have only finite degeneracy. Furthermore, VT converges faster and results in sparser (simpler) models, thus realizing an automatic Occam's razor for HMM learning. For more general scenario VT can be worse compared to ML but still capable of correctly recovering most of the parameters.

stat.ML↗

arXiv2013

Carnot Cycle at Finite Power: Attainability of Maximal Efficiency

We want to understand whether and to which extent the maximal (Carnot) efficiency for heat engines can be reached at a finite power. To this end we generalize the Carnot cycle so that it is not restricted to slow processes. We show that for realistic (i.e. not purposefully-designed) engine-bath interactions, the work-optimal engine performing the generalized cycle close to the maximal efficiency has a long cycle time and hence vanishing power. This aspect is shown to relate to the theory of computational complexity. A physical manifestation of the same effect is the Levinthal's paradox in the protein folding problem. The resolution of this paradox for realistic proteins allows to construct engines that can extract at a finite power 40% of the maximally possible work reaching 90% of the maximal efficiency. For purposefully designed engine-bath interactions, the Carnot efficiency is achievable at a large power.

cond-mat.stat-mech↗

arXiv2013

Phase Transitions in Community Detection: A Solvable Toy Model

Recently, it was shown that there is a phase transition in the community detection problem. This transition was first computed using the cavity method, and has been proved rigorously in the case of $q=2$ groups. However, analytic calculations using the cavity method are challenging since they require us to understand probability distributions of messages. We study analogous transitions in so-called "zero-temperature inference" model, where this distribution is supported only on the most-likely messages. Furthermore, whenever several messages are equally likely, we break the tie by choosing among them with equal probability. While the resulting analysis does not give the correct values of the thresholds, it does reproduce some of the qualitative features of the system. It predicts a first-order detectability transition whenever $q > 2$, while the finite-temperature cavity method shows that this is the case only when $q > 4$. It also has a regime analogous to the "hard but detectable" phase, where the community structure can be partially recovered, but only when the initial messages are sufficiently accurate. Finally, we study a semisupervised setting where we are given the correct labels for a fraction $ρ$ of the nodes. For $q > 2$, we find a regime where the accuracy jumps discontinuously at a critical value of $ρ$.

cs.SI↗

arXiv2013

Adaptive machine and its thermodynamic costs

We study the minimal thermodynamically consistent model for an adaptive machine that transfers particles from a higher chemical potential reservoir to a lower one. This model describes essentials of the inhomogeneous catalysis. It is supposed to function with the maximal current under uncertain chemical potentials: if they change, the machine tunes its own structure fitting it to the maximal current under new conditions. This adaptation is possible under two limitations. (i) The degree of freedom that controls the machine's structure has to have a stored energy (described via a negative temperature). The origin of this result is traced back to the Le Chatelier principle. (ii) The machine has to malfunction at a constant environment due to structural fluctuations, whose relative magnitude is controlled solely by the stored energy. We argue that several features of the adaptive machine are similar to those of living organisms (energy storage, aging).

cond-mat.stat-mech↗

arXiv2013

Comment on "Cooling by Heating: Refrigerator Powered by Photons"

Results obtained recently in Phys. Rev. Lett. 108, 120603 (2012) by Cleuren et al. apparently contradict to the third law of thermodynamics. We discuss a scenario for resolving this contradiction, and show that this scenario is pertinent for clarifying the general message of the third law.

cond-mat.stat-mech↗

arXiv2013

Explaining Zipf's Law via Mental Lexicon

The Zipf's law is the major regularity of statistical linguistics that served as a prototype for rank-frequency relations and scaling laws in natural sciences. Here we show that the Zipf's law -- together with its applicability for a single text and its generalizations to high and low frequencies including hapax legomena -- can be derived from assuming that the words are drawn into the text with random probabilities. Their apriori density relates, via the Bayesian statistics, to general features of the mental lexicon of the author who produced the text.

physics.data-an↗

arXiv2013

Understanding quantum measurement from the solution of dynamical models

The quantum measurement problem, understanding why a unique outcome is obtained in each individual experiment, is tackled by solving models. After an introduction we review the many dynamical models proposed over the years. A flexible and rather realistic model is introduced, describing the measurement of the $z$-component of a spin through interaction with a magnetic memory simulated by a Curie--Weiss magnet, including $N \gg1$ spins weakly coupled to a phonon bath. Initially prepared in a metastable paramagnetic state, it may transit to its up or down ferromagnetic state, triggered by its coupling with the tested spin, so that its magnetization acts as a pointer. A detailed solution of the dynamical equations is worked out. Conditions are found, which ensure that the process satisfies the features of ideal measurements. Various imperfections are discussed, as well as attempts of incompatible measurements. The first steps consist in the solution of the Hamiltonian dynamics for the spin-apparatus density matrix $D(t)$. On a longer time scale, the trend towards equilibrium of the magnet produces a final state $D(t_{\rm f})$ that involves correlations between the system and the indications of the pointer, thus ensuring registration. A difficulty lies in a quantum ambiguity: There exist many incompatible decompositions of the density matrix $\scriptD(t_{\rm f})$. This difficulty is overcome by dynamics due to suitable interactions within the apparatus. Any subset of runs thus reaches over a brief delay a stable state which satisfies the same hierarchic property as in classical probability theory. Standard quantum statistical mechanics alone appears sufficient to explain the occurrence of a unique answer in each run. Finally, pedagogical exercises are proposed while the statistical interpretation is promoted for teaching. [Abridged]

quant-ph↗

arXiv2011

Work extraction from microcanonical bath

We determine the maximal work extractable via a cyclic Hamiltonian process from a positive-temperature ($T>0$) microcanonical state of a $N\gg 1$ spin bath. The work is much smaller than the total energy of the bath, but can be still much larger than the energy of a single bath spin, e.g. it can scale as ${\cal O}(\sqrt{N\ln N})$. Qualitatively same results are obtained for those cases, where the canonical state is unstable (e.g., due to a negative specific heat) and the microcanonical state is the only description of equilibrium. For a system coupled to a microcanonical bath the concept of free energy does {\it not generally} apply, since such a system|starting from the canonical equilibrium density matrix $ρ_T$ at the bath temperature $T$|can enhance the work extracted from the microcanonical bath without changing its state $ρ_T$. This is impossible for any system coupled to a canonical thermal bath due to the relation between the maximal work and free energy. But the concept of free energy still applies for a sufficiently large $T$. Here we find a compact expression for the {\it microcanonical free-energy} and show that in contrast to the canonical case it contains a {\it linear entropy} instead of the von Neumann entropy.

cond-mat.stat-mech↗

arXiv2011

Statistical Mechanics of Semi-Supervised Clustering in Sparse Graphs

We theoretically study semi-supervised clustering in sparse graphs in the presence of pairwise constraints on the cluster assignments of nodes. We focus on bi-cluster graphs, and study the impact of semi-supervision for varying constraint density and overlap between the clusters. Recent results for unsupervised clustering in sparse graphs indicate that there is a critical ratio of within-cluster and between-cluster connectivities below which clusters cannot be recovered with better than random accuracy. The goal of this paper is to examine the impact of pairwise constraints on the clustering accuracy. Our results suggests that the addition of constraints does not provide automatic improvement over the unsupervised case. When the density of the constraints is sufficiently small, their only impact is to shift the detection threshold while preserving the criticality. Conversely, if the density of (hard) constraints is above the percolation threshold, the criticality is suppressed and the detection threshold disappears.

physics.data-an↗

arXiv2011

Le Chatelier principle in replicator dynamics

The Le Chatelier principle states that physical equilibria are not only stable, but they also resist external perturbations via short-time negative-feedback mechanisms: a perturbation induces processes tending to diminish its results. The principle has deep roots, e.g., in thermodynamics it is closely related to the second law and the positivity of the entropy production. Here we study the applicability of the Le Chatelier principle to evolutionary game theory, i.e., to perturbations of a Nash equilibrium within the replicator dynamics. We show that the principle can be reformulated as a majorization relation. This defines a stability notion that generalizes the concept of evolutionary stability. We determine criteria for a Nash equilibrium to satisfy the Le Chatelier principle and relate them to mutualistic interactions (game-theoretical anticoordination) showing in which sense mutualistic replicators can be more stable than (say) competing ones. There are globally stable Nash equilibria, where the Le Chatelier principle is violated even locally: in contrast to the thermodynamic equilibrium a Nash equilibrium can amplify small perturbations, though both this type of equilibria satisfy the detailed balance condition.

cond-mat.stat-mech↗

arXiv2011

Thermodynamic limits of dynamic cooling

We study dynamic cooling, where an externally driven two-level system is cooled via reservoir, a quantum system with initial canonical equilibrium state. We obtain explicitly the minimal possible temperature $T_{\rm min}>0$ reachable for the two-level system. The minimization goes over all unitary dynamic processes operating on the system and reservoir, and over the reservoir energy spectrum. The minimal work needed to reach $T_{\rm min}$ grows as $1/T_{\rm min}$. This work cost can be significantly reduced, though, if one is satisfied by temperatures slightly above $T_{\rm min}$. Our results on $T_{\rm min}>0$ prove unattainability of the absolute zero temperature without ambiguities that surround its derivation from the entropic version of the third law. The unattainability can be recovered, albeit via a different mechanism, for cooling by a reservoir with an initially microcanonic state. We also study cooling via a reservoir consisting of $N\gg 1$ identical spins. Here we show that $T_{\rm min}\propto\frac{1}{N}$ and find the maximal cooling compatible with the minimal work determined by the free energy.

cond-mat.stat-mech↗