37,229 research outputs found
Hipsters on Networks: How a Small Group of Individuals Can Lead to an Anti-Establishment Majority
The spread of opinions, memes, diseases, and "alternative facts" in a
population depends both on the details of the spreading process and on the
structure of the social and communication networks on which they spread. In
this paper, we explore how \textit{anti-establishment} nodes (e.g.,
\textit{hipsters}) influence the spreading dynamics of two competing products.
We consider a model in which spreading follows a deterministic rule for
updating node states (which describe which product has been adopted) in which
an adjustable fraction of the nodes in a network are hipsters,
who choose to adopt the product that they believe is the less popular of the
two. The remaining nodes are conformists, who choose which product to adopt by
considering which products their immediate neighbors have adopted. We simulate
our model on both synthetic and real networks, and we show that the hipsters
have a major effect on the final fraction of people who adopt each product:
even when only one of the two products exists at the beginning of the
simulations, a very small fraction of hipsters in a network can still cause the
other product to eventually become the more popular one. To account for this
behavior, we construct an approximation for the steady-state adoption fraction
on -regular trees in the limit of few hipsters. Additionally, our
simulations demonstrate that a time delay in the knowledge of the
product distribution in a population, as compared to immediate knowledge of
product adoption among nearest neighbors, can have a large effect on the final
distribution of product adoptions. Our simple model and analysis may help shed
light on the road to success for anti-establishment choices in elections, as
such success can arise rather generically in our model from a small number of
anti-establishment individuals and ordinary processes of social influence on
normal individuals.Comment: Extensively revised, with much new analysis and numerics The abstract
on arXiv is a shortened version of the full abstract because of space limit
Testing Cluster Structure of Graphs
We study the problem of recognizing the cluster structure of a graph in the
framework of property testing in the bounded degree model. Given a parameter
, a -bounded degree graph is defined to be -clusterable, if it can be partitioned into no more than parts, such
that the (inner) conductance of the induced subgraph on each part is at least
and the (outer) conductance of each part is at most
, where depends only on . Our main
result is a sublinear algorithm with the running time
that takes as
input a graph with maximum degree bounded by , parameters , ,
, and with probability at least , accepts the graph if it
is -clusterable and rejects the graph if it is -far from
-clusterable for , where depends only on . By the lower
bound of on the number of queries needed for testing graph
expansion, which corresponds to in our problem, our algorithm is
asymptotically optimal up to polylogarithmic factors.Comment: Full version of STOC 201
Control in the technical societies: a brief history
By the time control engineering emerged as a coherent body of knowledge and practice (during and just after WW2) professional engineering societies had existed for many decades. Since control engineering is an interdisciplinary branch of the profession, new sections devoted to control were quickly established within the various existing technical societies. In addition, some new bodies devoted specifically or primarily to control were established. This article, a revised version of a paper presented at the IEEE 2009 Conference on the History of Technical Societies, describes how control engineering as a distinct branch of engineering became represented in technical societies in a number of countries
Modeling the lowest-cost splitting of a herd of cows by optimizing a cost function
Animals live in groups to defend against predation and to obtain food.
However, for some animals --- especially ones that spend long periods of time
feeding --- there are costs if a group chooses to move on before their
nutritional needs are satisfied. If the conflict between feeding and keeping up
with a group becomes too large, it may be advantageous to some animals to split
into subgroups of animals with similar nutritional needs. We model the costs
and benefits of splitting by a herd of cows using a cost function (CF) that
quantifies individual variation in hunger, desire to lie down, and predation
risk. We model the costs associated with hunger and lying desire as the
standard deviations of individuals within a group, and we model predation risk
as an inverse exponential function of group size. We minimize the cost function
over all plausible groups that can arise from a given herd and study the
dynamics of group splitting. We explore our model using two examples: (1) we
consider group switching and group fission in a herd of relatively homogeneous
cows; and (2) we examine a herd with an equal number of adult males (larger
animals) and adult females (smaller animals).Comment: 19 pages, 10 figure
Canine liver transplantation under nva cyclosporine versus cyclosporine
The immunosuppressive qualities and other features of a new cyclosporine (CsA) analogue, Nva 2-cyclosporine (Nva 2-CsA) were examined using canine orthotopic liver allografts. The mean survival time was 11.8±9.6 (SD) days in dogs without treatment, 60.8±34.4 days with Nva 2-CsA and 65.1±33.0 days with CsA. Functional abnormalities indicating toxic side effects were not noted either with Nva 2-CsA or with CsA. Using the same oral dose, the rate of blood level rise and the amount of the rise were greater with Nva2-CsA. Histopathologically, Nva2-CsA the treatment was associated with the same degree of hydropic vocuolation in the pars recta of the proximal tubules as CsA treatment. Thus, in the dog, Nva2-CsA had identical immunosuppressive properties as CsA, with no functionally detectable toxicity affecting the liver and kidney. © 1986 by The Williams & Wilkins Co
Understanding the Structural Scaling Relations of Early-Type Galaxies
We use a large suite of hydrodynamical simulations of binary galaxy mergers
to construct and calibrate a physical prescription for computing the effective
radii and velocity dispersions of spheroids. We implement this prescription
within a semi-analytic model embedded in merger trees extracted from the
Bolshoi Lambda-CDM N-body simulation, accounting for spheroid growth via major
and minor mergers as well as disk instabilities. We find that without disk
instabilities, our model does not predict sufficient numbers of intermediate
mass early-type galaxies in the local universe. Spheroids also form earlier in
models with spheroid growth via disk instabilities. Our model correctly
predicts the normalization, slope, and scatter of the low-redshift size-mass
and Fundamental Plane relations for early type galaxies. It predicts a degree
of curvature in the Faber-Jackson relation that is not seen in local
observations, but this could be alleviated if higher mass spheroids have more
bottom-heavy initial mass functions. The model also correctly predicts the
observed strong evolution of the size-mass relation for spheroids out to higher
redshifts, as well as the slower evolution in the normalization of the
Faber-Jackson relation. We emphasize that these are genuine predictions of the
model since it was tuned to match hydrodynamical simulations and not these
observations.Comment: Submitted to MNRA
- …