We use the Momentum Average approximation (MA) to study the ground-state properties of strongly bound bipolarons in the double-well electron-phonon (el-ph) coupling model, which describes certain intercalated lattices where the linear term in the el-
ph coupling vanishes due tosymmetry. We show that this model predicts the existence of strongly bound yet lightweight bipolarons in some regions of the parameter space. This provides a novel mechanism for the appearance of such bipolarons, in addition to long-range el-ph coupling and special lattice geometries.
We show that in crystals where light ions are symmetrically intercalated between heavy ions, the electron-phonon coupling for carriers located at the light sites cannot be described by a Holstein model. We introduce the double-well electron-phonon co
upling model to describe the most interesting parameter regime in such systems, and study it in the single carrier limit using the momentum average approximation. For sufficiently strong coupling, a small polaron with a robust phonon cloud appears at low energies. While some of its properties are similar to those of a Holstein polaron, we highlight some crucial differences. These prove that the physics of the double-well electron-phonon coupling model cannot be reproduced with a linear Holstein model.
Using the momentum average approximation we study the importance of adding higher-than-linear terms in the electron-phonon coupling on the properties of single polarons described by a generalized Holstein model. For medium and strong linear coupling,
even small quadratic electron-phonon coupling terms are found to lead to very significant quantitative changes in the properties of the polaron, which cannot be captured by a linear Holstein Hamiltonian with renormalized parameters. We argue that the bi-polaron phase diagram is equally sensitive to addition of quadratic coupling terms if the linear coupling is large. These results suggest that the linear approximation is likely to be inappropriate to model systems with strong electron-phonon coupling, at least for low carrier concentrations.
In this paper we consider neighborhood load balancing in the context of selfish clients. We assume that a network of n processors and m tasks is given. The processors may have different speeds and the tasks may have different weights. Every task is c
ontrolled by a selfish user. The objective of the user is to allocate his/her task to a processor with minimum load. We revisit the concurrent probabilistic protocol introduced in [6], which works in sequential rounds. In each round every task is allowed to query the load of one randomly chosen neighboring processor. If that load is smaller the task will migrate to that processor with a suitably chosen probability. Using techniques from spectral graph theory we obtain upper bounds on the expected convergence time towards approximate and exact Nash equilibria that are significantly better than the previous results in [6]. We show results for uniform tasks on non-uniform processors and the general case where the tasks have different weights and the machines have speeds. To the best of our knowledge, these are the first results for this general setting.
