The metaphysics of Machian frame-dragging

The paper investigates the kind of dependence relation that best portrays Machian frame-dragging in general relativity. The question is tricky because frame-dragging relates local inertial frames to distant distributions of matter in a time-independent way, thus establishing some sort of non-local link between the two. For this reason, a plain causal interpretation of frame-dragging faces huge challenges. The paper will shed light on the issue by using a generalized structural equation model analysis in terms of manipulationist counterfactuals recently applied in the context of metaphysical enquiry by Schaffer (2016) and Wilson (2017). The verdict of the analysis will be that frame-dragging is best understood in terms of a novel type of dependence relation that is half-way between causation and grounding

Measurement of scaling laws for shock waves in thermal nonlocal media

We are able to detect the details of spatial optical collisionless wave-breaking through the high aperture imaging of a beam suffering shock in a fluorescent nonlinear nonlocal thermal medium. This allows us to directly measure how nonlocality and nonlinearity affect the point of shock formation and compare results with numerical simulations.Comment: 4 pages, 4 figure

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

Electronic signature of the vacancy ordering in NbO (Nb3O3)

We investigated the electronic structure of the vacancy-ordered 4d-transition metal monoxide NbO (Nb3O3) using angle-integrated soft- and hard-x-ray photoelectron spectroscopy as well as ultra-violet angle-resolved photoelectron spectroscopy. We found that density-functional-based band structure calculations can describe the spectral features accurately provided that self-interaction effects are taken into account. In the angle-resolved spectra we were able to identify the so-called vacancy band that characterizes the ordering of the vacancies. This together with the band structure results indicates the important role of the very large inter-Nb-4d hybridization for the formation of the ordered vacancies and the high thermal stability of the ordered structure of niobium monoxide

Size reduction of complex networks preserving modularity

The ubiquity of modular structure in real-world complex networks is being the focus of attention in many trials to understand the interplay between network topology and functionality. The best approaches to the identification of modular structure are based on the optimization of a quality function known as modularity. However this optimization is a hard task provided that the computational complexity of the problem is in the NP-hard class. Here we propose an exact method for reducing the size of weighted (directed and undirected) complex networks while maintaining invariant its modularity. This size reduction allows the heuristic algorithms that optimize modularity for a better exploration of the modularity landscape. We compare the modularity obtained in several real complex-networks by using the Extremal Optimization algorithm, before and after the size reduction, showing the improvement obtained. We speculate that the proposed analytical size reduction could be extended to an exact coarse graining of the network in the scope of real-space renormalization.Comment: 14 pages, 2 figure

Beating dark-dark solitons in Bose-Einstein condensates

Motivated by recent experimental results, we study beating dark-dark solitons as a prototypical coherent structure that emerges in two-component Bose-Einstein condensates. We showcase their connection to dark- bright solitons via SO(2) rotation, and infer from it both their intrinsic beating frequency and their frequency of oscillation inside a parabolic trap. We identify them as exact periodic orbits in the Manakov limit of equal inter- and intra-species nonlinearity strengths with and without the trap and showcase the persistence of such states upon weak deviations from this limit. We also consider large deviations from the Manakov limit illustrating that this breathing state may be broken apart into dark-antidark soliton states. Finally, we consider the dynamics and interactions of two beating dark-dark solitons in the absence and in the presence of the trap, inferring their typically repulsive interaction.Comment: 13 pages, 14 figure

Experiments on Multidimensional Solitons

This article presents an overview of experimental efforts in recent years related to multidimensional solitons in Bose-Einstein condensates. We discuss the techniques used to generate and observe multidimensional nonlinear waves in Bose-Einstein condensates with repulsive interactions. We further summarize observations of planar soliton fronts undergoing the snake instability, the formation of vortex rings, and the emergence of hybrid structures.Comment: review paper, to appear as Chapter 5b in "Emergent Nonlinear Phenomena in Bose-Einstein Condensates: Theory and Experiment," edited by P. G. Kevrekidis, D. J. Frantzeskakis, and R. Carretero-Gonzalez (Springer-Verlag

Physics in the Real Universe: Time and Spacetime

The Block Universe idea, representing spacetime as a fixed whole, suggests the flow of time is an illusion: the entire universe just is, with no special meaning attached to the present time. This view is however based on time-reversible microphysical laws and does not represent macro-physical behaviour and the development of emergent complex systems, including life, which do indeed exist in the real universe. When these are taken into account, the unchanging block universe view of spacetime is best replaced by an evolving block universe which extends as time evolves, with the potential of the future continually becoming the certainty of the past. However this time evolution is not related to any preferred surfaces in spacetime; rather it is associated with the evolution of proper time along families of world linesComment: 28 pages, including 9 Figures. Major revision in response to referee comment

LP-based Covering Games with Low Price of Anarchy

We present a new class of vertex cover and set cover games. The price of anarchy bounds match the best known constant factor approximation guarantees for the centralized optimization problems for linear and also for submodular costs -- in contrast to all previously studied covering games, where the price of anarchy cannot be bounded by a constant (e.g. [6, 7, 11, 5, 2]). In particular, we describe a vertex cover game with a price of anarchy of 2. The rules of the games capture the structure of the linear programming relaxations of the underlying optimization problems, and our bounds are established by analyzing these relaxations. Furthermore, for linear costs we exhibit linear time best response dynamics that converge to these almost optimal Nash equilibria. These dynamics mimic the classical greedy approximation algorithm of Bar-Yehuda and Even [3]