Symmetry-broken dissipative exchange flows in thin-film ferromagnets with in-plane anisotropy

Planar ferromagnetic channels have been shown to theoretically support a long-range ordered and coherently precessing state where the balance between local spin injection at one edge and damping along the channel establishes a dissipative exchange flow, sometimes referred to as a spin superfluid. However, realistic materials exhibit in-plane anisotropy, which breaks the axial symmetry assumed in current theoretical models. Here, we study dissipative exchange flows in a ferromagnet with in-plane anisotropy from a dispersive hydrodynamic perspective. Through the analysis of a boundary value problem for a damped sine-Gordon equation, dissipative exchange flows in a ferromagnetic channel can be excited above a spin current threshold that depends on material parameters and the length of the channel. Symmetry-broken dissipative exchange flows display harmonic overtones that redshift the fundamental precessional frequency and lead to a reduced spin pumping efficiency when compared to their symmetric counterpart. Micromagnetic simulations are used to verify that the analytical results are qualitatively accurate, even in the presence of nonlocal dipole fields. Simulations also confirm that dissipative exchange flows can be driven by spin transfer torque in a finite-sized region. These results delineate the important material parameters that must be optimized for the excitation of dissipative exchange flows in realistic systems.Comment: 20 pages, 5 figure

Routing Games over Time with FIFO policy

We study atomic routing games where every agent travels both along its decided edges and through time. The agents arriving on an edge are first lined up in a \emph{first-in-first-out} queue and may wait: an edge is associated with a capacity, which defines how many agents-per-time-step can pop from the queue's head and enter the edge, to transit for a fixed delay. We show that the best-response optimization problem is not approximable, and that deciding the existence of a Nash equilibrium is complete for the second level of the polynomial hierarchy. Then, we drop the rationality assumption, introduce a behavioral concept based on GPS navigation, and study its worst-case efficiency ratio to coordination.Comment: Submission to WINE-2017 Deadline was August 2nd AoE, 201

Packing Returning Secretaries

We study online secretary problems with returns in combinatorial packing domains with $n$ candidates that arrive sequentially over time in random order. The goal is to accept a feasible packing of candidates of maximum total value. In the first variant, each candidate arrives exactly twice. All $2n$ arrivals occur in random order. We propose a simple 0.5-competitive algorithm that can be combined with arbitrary approximation algorithms for the packing domain, even when the total value of candidates is a subadditive function. For bipartite matching, we obtain an algorithm with competitive ratio at least $0.5721 - o(1)$ for growing $n$, and an algorithm with ratio at least $0.5459$ for all $n \ge 1$. We extend all algorithms and ratios to $k \ge 2$ arrivals per candidate. In the second variant, there is a pool of undecided candidates. In each round, a random candidate from the pool arrives. Upon arrival a candidate can be either decided (accept/reject) or postponed (returned into the pool). We mainly focus on minimizing the expected number of postponements when computing an optimal solution. An expected number of $\Theta(n \log n)$ is always sufficient. For matroids, we show that the expected number can be reduced to $O(r \log (n/r))$, where $r \le n/2$ is the minimum of the ranks of matroid and dual matroid. For bipartite matching, we show a bound of $O(r \log n)$, where $r$ is the size of the optimum matching. For general packing, we show a lower bound of $\Omega(n \log \log n)$, even when the size of the optimum is $r = \Theta(\log n)$.Comment: 23 pages, 5 figure

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

Theory of Magnetodynamics Induced by Spin Torque in Perpendicularly Magnetized Thin Films

A nonlinear model of spin wave excitation using a point contact in a thin ferromagnetic film is introduced. Large-amplitude magnetic solitary waves are computed, which help explain recent spin-torque experiments. Numerical simulations of the fully nonlinear model predict excitation frequencies in excess of 0.2 THz for contact diameters smaller than 6 nm. Simulations also predict a saturation and red shift of the frequency at currents large enough to invert the magnetization under the point contact. The theory is approximated by a cubic complex Ginzburg-Landau type equation. The mode's nonlinear frequency shift is found by use of perturbation techniques, whose results agree with those of direct numerical simulations.Comment: 5 pages, 4 figures, submitted to PR

New Complexity Results and Algorithms for the Minimum Tollbooth Problem

The inefficiency of the Wardrop equilibrium of nonatomic routing games can be eliminated by placing tolls on the edges of a network so that the socially optimal flow is induced as an equilibrium flow. A solution where the minimum number of edges are tolled may be preferable over others due to its ease of implementation in real networks. In this paper we consider the minimum tollbooth (MINTB) problem, which seeks social optimum inducing tolls with minimum support. We prove for single commodity networks with linear latencies that the problem is NP-hard to approximate within a factor of $1.1377$ through a reduction from the minimum vertex cover problem. Insights from network design motivate us to formulate a new variation of the problem where, in addition to placing tolls, it is allowed to remove unused edges by the social optimum. We prove that this new problem remains NP-hard even for single commodity networks with linear latencies, using a reduction from the partition problem. On the positive side, we give the first exact polynomial solution to the MINTB problem in an important class of graphs---series-parallel graphs. Our algorithm solves MINTB by first tabulating the candidate solutions for subgraphs of the series-parallel network and then combining them optimally

Theory for a dissipative droplet soliton excited by a spin torque nanocontact

A novel type of solitary wave is predicted to form in spin torque oscillators when the free layer has a sufficiently large perpendicular anisotropy. In this structure, which is a dissipative version of the conservative droplet soliton originally studied in 1977 by Ivanov and Kosevich, spin torque counteracts the damping that would otherwise destroy the mode. Asymptotic methods are used to derive conditions on perpendicular anisotropy strength and applied current under which a dissipative droplet can be nucleated and sustained. Numerical methods are used to confirm the stability of the droplet against various perturbations that are likely in experiments, including tilting of the applied field, non-zero spin torque asymmetry, and non-trivial Oersted fields. Under certain conditions, the droplet experiences a drift instability in which it propagates away from the nanocontact and is then destroyed by damping.Comment: 15 pages, 12 figure