Inheritance patterns in citation networks reveal scientific memes

Memes are the cultural equivalent of genes that spread across human culture by means of imitation. What makes a meme and what distinguishes it from other forms of information, however, is still poorly understood. Our analysis of memes in the scientific literature reveals that they are governed by a surprisingly simple relationship between frequency of occurrence and the degree to which they propagate along the citation graph. We propose a simple formalization of this pattern and we validate it with data from close to 50 million publication records from the Web of Science, PubMed Central, and the American Physical Society. Evaluations relying on human annotators, citation network randomizations, and comparisons with several alternative approaches confirm that our formula is accurate and effective, without a dependence on linguistic or ontological knowledge and without the application of arbitrary thresholds or filters.Comment: 8 two-column pages, 5 figures; accepted for publication in Physical Review

The repulsive lattice gas, the independent-set polynomial, and the Lov\'asz local lemma

We elucidate the close connection between the repulsive lattice gas in equilibrium statistical mechanics and the Lovasz local lemma in probabilistic combinatorics. We show that the conclusion of the Lovasz local lemma holds for dependency graph G and probabilities {p_x} if and only if the independent-set polynomial for G is nonvanishing in the polydisc of radii {p_x}. Furthermore, we show that the usual proof of the Lovasz local lemma -- which provides a sufficient condition for this to occur -- corresponds to a simple inductive argument for the nonvanishing of the independent-set polynomial in a polydisc, which was discovered implicitly by Shearer and explicitly by Dobrushin. We also present some refinements and extensions of both arguments, including a generalization of the Lovasz local lemma that allows for "soft" dependencies. In addition, we prove some general properties of the partition function of a repulsive lattice gas, most of which are consequences of the alternating-sign property for the Mayer coefficients. We conclude with a brief discussion of the repulsive lattice gas on countably infinite graphs.Comment: LaTex2e, 97 pages. Version 2 makes slight changes to improve clarity. To be published in J. Stat. Phy

l=0 to l=1 Transition Form Factors

A method is proposed to extend the hard scattering picture of Brodsky and Lepage to transitions between hadrons with orbital angular momentum l=0 and l=1. The use of covariant spin wave functions turns out to be very helpful in formulating that method. As a first application we construct a light-cone wave function of the nucleon resonance $N^*(1535)$ in the quark-diquark picture. Using this wave function and the extended hard scattering picture, the $N$--$N^*$ transition form factors are calculated at large momentum transfer and the results compared to experimental data. As a further application of our method we briefly discuss the $\pi$--$a_1$ form factors in an appendix.Comment: 27 pages, 6 PS-figures in uuencoded compressed file, Latex, WU-B 93-29, MZ-TH/93-2

Enhancing Perceived Safety in Human–Robot Collaborative Construction Using Immersive Virtual Environments

Advances in robotics now permit humans to work collaboratively with robots. However, humans often feel unsafe working alongside robots. Our knowledge of how to help humans overcome this issue is limited by two challenges. One, it is difficult, expensive and time-consuming to prototype robots and set up various work situations needed to conduct studies in this area. Two, we lack strong theoretical models to predict and explain perceived safety and its influence on human–robot work collaboration (HRWC). To address these issues, we introduce the Robot Acceptance Safety Model (RASM) and employ immersive virtual environments (IVEs) to examine perceived safety of working on tasks alongside a robot. Results from a between-subjects experiment done in an IVE show that separation of work areas between robots and humans increases perceived safety by promoting team identification and trust in the robot. In addition, the more participants felt it was safe to work with the robot, the more willing they were to work alongside the robot in the future.University of Michigan Mcubed Grant: Virtual Prototyping of Human-Robot Collaboration in Unstructured Construction EnvironmentsPeer Reviewedhttps://deepblue.lib.umich.edu/bitstream/2027.42/145620/1/You et al. forthcoming in AutCon.pdfhttps://deepblue.lib.umich.edu/bitstream/2027.42/145620/4/You et al. 2018.pdfDescription of You et al. 2018.pdf : Published Versio

Relational Contracting, Repeated Negotiations, and Hold-Up

We propose a unified framework to study relational contracting and hold-up problems in infinite horizon stochastic games. We first illustrate that with respect to long run decisions, the common formulation of relational contracts as Pareto-optimal public perfect equilibria is in stark contrast to fundamental assumptions of hold-up models. We develop a model in which relational contracts are repeatedly newly negotiated during relationships. Negotiations take place with positive probability and cause bygones to be bygones. Traditional relational contracting and hold-up formulations are nested as opposite corner cases. Allowing for intermediate cases yields very intuitive results and sheds light on many plausible trade-offs that do not arise in these corner cases. We establish a general existence result and a tractable characterization for stochastic games in which money can be transferred. This paper formulates a theory of relational contracting in dynamic games. A crucial feature is that existing relational contracts can depreciate and ensuing negotiations then treat previous informal agreements as bygones. The model nests the traditional formulation of relational contracts as Pareto-optimal equilibria as a special case. In repeated games both formulations are always mathematically equivalent. We provide ample illustrations that in dynamic games the traditional formulation is restrictive in so far that it rules out by assumption many plausible hold-up problems - even for small discount factors. Our model provides a framework that naturally unifies the analysis of relational contracting and hold-up problems

Economic Analysis of Knowledge: The History of Thought and the Central Themes

Following the development of knowledge economies, there has been a rapid expansion of economic analysis of knowledge, both in the context of technological knowledge in particular and the decision theory in general. This paper surveys this literature by identifying the main themes and contributions and outlines the future prospects of the discipline. The wide scope of knowledge related questions in terms of applicability and alternative approaches has led to the fragmentation of research. Nevertheless, one can identify a continuing tradition which analyses various aspects of the generation, dissemination and use of knowledge in the economy