Transverse instabilities of stripe domains in magnetic thin films with perpendicular magnetic anisotropy

Stripe domains are narrow, elongated, reversed regions that exist in magnetic materials with perpendicular magnetic anisotropy. Stripe domains appear as a pair of domain walls that can exhibit topology with a nonzero chirality. Recent experimental and numerical investigations identify an instability of stripe domains in the long direction as a means of nucleating isolated magnetic skyrmions. Here, the onset and nonlinear evolution of transverse instabilities for a dynamic stripe domain known as the bion stripe are investigated. Both non-topological and topological variants of the bion stripe are shown to exhibit a long-wavelength transverse instability with different characteristic features. In the former, small transverse variations in the stripe's width lead to a neck instability that eventually pinches the non-topological stripe into a chain of two-dimensional breathers composed of droplet soliton pairs. In the latter case, small variations in the stripe's center results in a snake instability whose topological structure leads to the nucleation of dynamic magnetic skyrmions and antiskyrmions as well as perimeter-modulated droplets. Quantitative, analytical predictions for both the early, linear evolution and the long-time, nonlinear evolution are achieved using an averaged Lagrangian approach that incorporates both exchange (dispersion) and anisotropy (nonlinearity). The method of analysis is general and can be applied to other filamentary structures.Comment: 8 figures, 13 page

Dispersive and diffusive-dispersive shock waves for nonconvex conservation laws

We consider two physically and mathematically distinct regularization mechanisms of scalar hyperbolic conservation laws. When the flux is convex, the combination of diffusion and dispersion are known to give rise to monotonic and oscillatory traveling waves that approximate shock waves. The zero-diffusion limits of these traveling waves are dynamically expanding dispersive shock waves (DSWs). A richer set of wave solutions can be found when the flux is non-convex. This review compares the structure of solutions of Riemann problems for a conservation law with non-convex, cubic flux regularized by two different mechanisms: 1) dispersion in the modified Korteweg--de Vries (mKdV) equation; and 2) a combination of diffusion and dispersion in the mKdV-Burgers equation. In the first case, the possible dynamics involve two qualitatively different types of DSWs, rarefaction waves (RWs) and kinks (monotonic fronts). In the second case, in addition to RWs, there are traveling wave solutions approximating both classical (Lax) and non-classical (undercompressive) shock waves. Despite the singular nature of the zero-diffusion limit and rather differing analytical approaches employed in the descriptions of dispersive and diffusive-dispersive regularization, the resulting comparison of the two cases reveals a number of striking parallels. In contrast to the case of convex flux, the mKdVB to mKdV mapping is not one-to-one. The mKdV kink solution is identified as an undercompressive DSW. Other prominent features, such as shock-rarefactions, also find their purely dispersive counterparts involving special contact DSWs, which exhibit features analogous to contact discontinuities. This review describes an important link between two major areas of applied mathematics, hyperbolic conservation laws and nonlinear dispersive waves.Comment: Revision from v2; 57 pages, 19 figure

Matching Dynamics with Constraints

We study uncoordinated matching markets with additional local constraints that capture, e.g., restricted information, visibility, or externalities in markets. Each agent is a node in a fixed matching network and strives to be matched to another agent. Each agent has a complete preference list over all other agents it can be matched with. However, depending on the constraints and the current state of the game, not all possible partners are available for matching at all times. For correlated preferences, we propose and study a general class of hedonic coalition formation games that we call coalition formation games with constraints. This class includes and extends many recently studied variants of stable matching, such as locally stable matching, socially stable matching, or friendship matching. Perhaps surprisingly, we show that all these variants are encompassed in a class of "consistent" instances that always allow a polynomial improvement sequence to a stable state. In addition, we show that for consistent instances there always exists a polynomial sequence to every reachable state. Our characterization is tight in the sense that we provide exponential lower bounds when each of the requirements for consistency is violated. We also analyze matching with uncorrelated preferences, where we obtain a larger variety of results. While socially stable matching always allows a polynomial sequence to a stable state, for other classes different additional assumptions are sufficient to guarantee the same results. For the problem of reaching a given stable state, we show NP-hardness in almost all considered classes of matching games.Comment: Conference Version in WINE 201

Solid-state ensemble of highly entangled photon sources at rubidium atomic transitions

Semiconductor InAs/GaAs quantum dots grown by the Stranski-Krastanov method are among the leading candidates for the deterministic generation of polarization entangled photon pairs. Despite remarkable progress in the last twenty years, many challenges still remain for this material, such as the extremely low yield (<1% quantum dots can emit entangled photons), the low degree of entanglement, and the large wavelength distribution. Here we show that, with an emerging family of GaAs/AlGaAs quantum dots grown by droplet etching and nanohole infilling, it is possible to obtain a large ensemble (close to 100%) of polarization-entangled photon emitters on a wafer without any post-growth tuning. Under pulsed resonant two-photon excitation, all measured quantum dots emit single pairs of entangled photons with ultra-high purity, high degree of entanglement (fidelity up to F=0.91, with a record high concurrence C=0.90), and ultra-narrow wavelength distribution at rubidium transitions. Therefore, a solid-state quantum repeater - among many other key enabling quantum photonic elements - can be practically implemented with this new material

On Linear Congestion Games with Altruistic Social Context

We study the issues of existence and inefficiency of pure Nash equilibria in linear congestion games with altruistic social context, in the spirit of the model recently proposed by de Keijzer {\em et al.} \cite{DSAB13}. In such a framework, given a real matrix $\Gamma=(\gamma_{ij})$ specifying a particular social context, each player $i$ aims at optimizing a linear combination of the payoffs of all the players in the game, where, for each player $j$, the multiplicative coefficient is given by the value $\gamma_{ij}$. We give a broad characterization of the social contexts for which pure Nash equilibria are always guaranteed to exist and provide tight or almost tight bounds on their prices of anarchy and stability. In some of the considered cases, our achievements either improve or extend results previously known in the literature

Computing Stable Coalitions: Approximation Algorithms for Reward Sharing

Consider a setting where selfish agents are to be assigned to coalitions or projects from a fixed set P. Each project k is characterized by a valuation function; v_k(S) is the value generated by a set S of agents working on project k. We study the following classic problem in this setting: "how should the agents divide the value that they collectively create?". One traditional approach in cooperative game theory is to study core stability with the implicit assumption that there are infinite copies of one project, and agents can partition themselves into any number of coalitions. In contrast, we consider a model with a finite number of non-identical projects; this makes computing both high-welfare solutions and core payments highly non-trivial. The main contribution of this paper is a black-box mechanism that reduces the problem of computing a near-optimal core stable solution to the purely algorithmic problem of welfare maximization; we apply this to compute an approximately core stable solution that extracts one-fourth of the optimal social welfare for the class of subadditive valuations. We also show much stronger results for several popular sub-classes: anonymous, fractionally subadditive, and submodular valuations, as well as provide new approximation algorithms for welfare maximization with anonymous functions. Finally, we establish a connection between our setting and the well-studied simultaneous auctions with item bidding; we adapt our results to compute approximate pure Nash equilibria for these auctions.Comment: Under Revie