Migration as Submodular Optimization

Migration presents sweeping societal challenges that have recently attracted significant attention from the scientific community. One of the prominent approaches that have been suggested employs optimization and machine learning to match migrants to localities in a way that maximizes the expected number of migrants who find employment. However, it relies on a strong additivity assumption that, we argue, does not hold in practice, due to competition effects; we propose to enhance the data-driven approach by explicitly optimizing for these effects. Specifically, we cast our problem as the maximization of an approximately submodular function subject to matroid constraints, and prove that the worst-case guarantees given by the classic greedy algorithm extend to this setting. We then present three different models for competition effects, and show that they all give rise to submodular objectives. Finally, we demonstrate via simulations that our approach leads to significant gains across the board.Comment: Simulation code is available at https://github.com/pgoelz/migration

Kinetics of Surfactant Adsorption at Fluid-Fluid Interfaces: Surfactant Mixtures

The adsorption at the interface between an aqueous solution of several surface-active agents and another fluid (air or oil) phase is addressed theoretically. We derive the kinetic equations from a variation of the interfacial free energy, solve them numerically and provide an analytic solution for the simple case of a linear adsorption isotherm. Calculating asymptotic solutions analytically, we find the characteristic time scales of the adsorption process and observe the behavior of the system at various temporal stages. In particular, we relate the kinetic behavior of the mixture to the properties of its individual constituents and find good agreement with experiments. In the case of kinetically limited adsorption, the mixture kinetics is found to be considerably different from that of the single-surfactant solutions because of strong coupling between the species.Comment: 19 pages, 7 figures, to be published in Langmui

Relevance of nonadiabatic effects in TiOCl

We analyze the effect of the phonon dynamics on a recently proposed model for the uniform-incommensurate transition seen in TiOX compounds. The study is based on a recently developed formalism for nonadiabatic spin-Peierls systems based on bosonization and a mean field RPA approximation for the interchain coupling. To reproduce the measured low temperature spin gap, a spin-phonon coupling quite bigger than the one predicted from an adiabatic approach is required. This high value is compatible with the renormalization of the phonons in the high temperature phase seen in inelastic x-ray experiments. Our theory accounts for the temperature of the incommensurate transition and the value of the incommensurate wave vector at the transition point.Comment: 4 pages, 2 figure

Are stable agreements for sharing international river waters now possible?

International river and lake basins constitute about 47 percent of the world's continental land area, a proportion that increases to about 60 percent in Africa, Asia, and South America. Because water is a scarce and increasingly valuable resource, disputes about water allocation within these basins often contribute to regional tensions and conflicts. May principles of international law have been developed to allocate water within a water basin and to prevent or resolve international water disputes. Unfortunately, they rarely are easy to apply and often are contradictory. Sharing river water is particularly difficult because the effects are one-way, with upstream-downstream supply disputes have been among the most common. Agreements about the allocation of river water often last only until the first drought, when reduced flow denies some their full shares. The authors develop a simple formal model of water allocation among states within a river basin. They analyze the model in the context of variable flow rates, to project the behavior of riparian states during periods of above-normal and below-normal flow. Their objective: to understand when, where, and how much the economic interests of the states conflict, to develop principles guaranteeing efficient allocations of scarce water supplies, and to identify when stable (self-enforcing) allocation agreements are possible. They also consider the possibility of using alternative sources of supply and of accommodating growth in demand. Satellite technology will soon dramatically improve the ability of riparian states to predict annual flow volumes. In addition, water basin authorities will have real-time data on riparians'water use. These developments will have important implications for the enforceability and the flexibility of river water allocation systems. This model shows how flexibility can be used to construct more durable systems for sharing water among riparian states. The new allocation methods proposed here should contribute to the better management of scarce water supplies, a crucial issue in an increasingly thirsty world.Water and Industry,Water Conservation,Environmental Economics&Policies,Water Supply and Systems,Decentralization,Water Supply and Sanitation Governance and Institutions,Town Water Supply and Sanitation,Water Conservation,Water and Industry,Environmental Economics&Policies

Computation-Aware Data Aggregation

Data aggregation is a fundamental primitive in distributed computing wherein a network computes a function of every nodes\u27 input. However, while compute time is non-negligible in modern systems, standard models of distributed computing do not take compute time into account. Rather, most distributed models of computation only explicitly consider communication time. In this paper, we introduce a model of distributed computation that considers both computation and communication so as to give a theoretical treatment of data aggregation. We study both the structure of and how to compute the fastest data aggregation schedule in this model. As our first result, we give a polynomial-time algorithm that computes the optimal schedule when the input network is a complete graph. Moreover, since one may want to aggregate data over a pre-existing network, we also study data aggregation scheduling on arbitrary graphs. We demonstrate that this problem on arbitrary graphs is hard to approximate within a multiplicative 1.5 factor. Finally, we give an O(log n ? log(OPT/t_m))-approximation algorithm for this problem on arbitrary graphs, where n is the number of nodes and OPT is the length of the optimal schedule

Gravitational waves from deflagration bubbles in first-order phase transitions

The walls of bubbles in a first-order phase transition can propagate either as detonations, with a velocity larger than the speed of sound, or deflagrations, which are subsonic. We calculate the gravitational radiation that is produced by turbulence during a phase transition which develops via deflagration bubbles. We take into account the fact that a deflagration wall is preceded by a shock front which distributes the latent heat throughout space and influences other bubbles. We show that turbulence can induce peak values of $\Omega_{GW}$ as high as $\sim 10^{-9}$. We discuss the possibility of detecting at LISA gravitational waves produced in the electroweak phase transition with wall velocities $v_w\lesssim 10^{-1}$, which favor electroweak baryogenesis.Comment: 13 pages, 1 figure; calculations of section IV repeated using recent results for the GW spectrum from turbulence, comments added in all sections, references added, conclusions unchange

A Smooth Transition from Powerlessness to Absolute Power

We study the phase transition of the coalitional manipulation problem for generalized scoring rules. Previously it has been shown that, under some conditions on the distribution of votes, if the number of manipulators is $o(\sqrt{n})$, where $n$ is the number of voters, then the probability that a random profile is manipulable by the coalition goes to zero as the number of voters goes to infinity, whereas if the number of manipulators is $\omega(\sqrt{n})$, then the probability that a random profile is manipulable goes to one. Here we consider the critical window, where a coalition has size $c\sqrt{n}$, and we show that as $c$ goes from zero to infinity, the limiting probability that a random profile is manipulable goes from zero to one in a smooth fashion, i.e., there is a smooth phase transition between the two regimes. This result analytically validates recent empirical results, and suggests that deciding the coalitional manipulation problem may be of limited computational hardness in practice.Comment: 22 pages; v2 contains minor changes and corrections; v3 contains minor changes after comments of reviewer