Current in a Spin-orbit-coupling System

The formulae of particle current as well as spin- and angular momentum currents are studied for most spin-orbit coupling (SOC) systems. It is shown that the conventional expression of currents in some literatures are not complete for some SOC systems. The particle current in Dresselhaus system must have extra terms in additional to the conventional one, but no extra term for Rashba, Luttinger model. Further more, we also prove that the extra terms of total angular momentum appear in Rashba current in addition to conventional one.Comment: 26 page

Contract Enforcement and Family Control of Business: Evidence from China

Family control of business is prevalent in developing economies, and one of the leading theories suggests that it is a response to weak contract enforcement in such economies. In this paper, we investigate the impacts of contract enforcement on the degree of family control of business using a sample of China's private enterprises. It is found that weaker contract enforcement is associated with the higher degree of family control of business. Our results are robust to the control for omitted variables and reserve causality issues, to the adjustment for the sample attrition bias, to the use of a sub-sample, and to the inclusion of other explanations for the family control of business.Family Control of Business, Contract Enforcement, China's Private Enterprises

Think Globally, Act Locally: On the Optimal Seeding for Nonsubmodular Influence Maximization

We study the r-complex contagion influence maximization problem. In the influence maximization problem, one chooses a fixed number of initial seeds in a social network to maximize the spread of their influence. In the r-complex contagion model, each uninfected vertex in the network becomes infected if it has at least r infected neighbors. In this paper, we focus on a random graph model named the stochastic hierarchical blockmodel, which is a special case of the well-studied stochastic blockmodel. When the graph is not exceptionally sparse, in particular, when each edge appears with probability omega (n^{-(1+1/r)}), under certain mild assumptions, we prove that the optimal seeding strategy is to put all the seeds in a single community. This matches the intuition that in a nonsubmodular cascade model placing seeds near each other creates synergy. However, it sharply contrasts with the intuition for submodular cascade models (e.g., the independent cascade model and the linear threshold model) in which nearby seeds tend to erode each others\u27 effects. Finally, we show that this observation yields a polynomial time dynamic programming algorithm which outputs optimal seeds if each edge appears with a probability either in omega (n^{-(1+1/r)}) or in o (n^{-2})