arXiv subjects

Fang Wu

Publications and source records attributed to Fang Wu.

98 records · Page 6Linked to original sources

arXiv2005

Bootstrapping the Long Tail in Peer to Peer Systems

We describe an efficient incentive mechanism for P2P systems that generates a wide diversity of content offerings while responding adaptively to customer demand. Files are served and paid for through a parimutuel market similar to that commonly used for betting in horse races. An analysis of the performance of such a system shows that there exists an equilibrium with a long tail in the distribution of content offerings, which guarantees the real time provision of any content regardless of its popularity.

cs.NI↗

arXiv2005

Ensuring Trust in One Time Exchanges: Solving the QoS Problem

We describe a pricing structure for the provision of IT services that ensures trust without requiring repeated interactions between service providers and users. It does so by offering a pricing structure that elicits truthful reporting of quality of service (QoS) by providers while making them profitable. This mechanism also induces truth-telling on the part of users reserving the service.

cs.GT↗

arXiv2005

Management Fads, Pedagogies and Soft Technologies

We present a model for the diffusion of management fads and other technologies which lack clear objective evidence about their merits. The choices made by non-Bayesian adopters reflect both their own evaluations and the social influence of their peers. We show, both analytically and computationally, that the dynamics lead to outcomes that appear to be deterministic in spite of being governed by a stochastic process. In other words, when the objective evidence about a technology is weak, the evolution of this process quickly settles down to a fraction of adopters that is not predetermined. When the objective evidence is strong, the proportion of adopters is determined by the quality of the evidence and the adopters' competence.

physics.soc-ph↗

arXiv2005

Truth-telling Reservations

We present a mechanism for reservations of bursty resources that is both truthful and robust. It consists of option contracts whose pricing structure induces users to reveal the true likelihoods that they will purchase a given resource. Users are also allowed to adjust their options as their likelihood changes. This scheme helps users save cost and the providers to plan ahead so as to reduce the risk of under-utilization and overbooking. The mechanism extracts revenue similar to that of a monopoly provider practicing temporal pricing discrimination with a user population whose preference distribution is known in advance.

cs.GT↗

arXiv2004

Social Structure and Opinion Formation

We present a dynamical theory of opinion formation that takes explicitly into account the structure of the social network in which in- dividuals are embedded. The theory predicts the evolution of a set of opinions through the social network and establishes the existence of a martingale property, i.e. that the expected weighted fraction of the population that holds a given opinion is constant in time. Most importantly, this weighted fraction is not either zero or one, but corresponds to a non-trivial distribution of opinions in the long time limit. This co-existence of opinions within a social network is in agreement with the often observed locality effect, in which an opinion or a fad is localized to given groups without infecting the whole society. We verified these predictions, as well as those concerning the fragility of opinions and the importance of highly connected individuals in opinion formation, by performing computer experiments on a number of social networks.

cond-mat.other↗

arXiv2003

Finding Communities in Linear Time: A Physics Approach

We present a method that allows for the discovery of communities within graphs of arbitrary size in times that scale linearly with their size. This method avoids edge cutting and is based on notions of voltage drops across networks that are both intuitive and easy to solve regardless of the complexity of the graph involved. We additionally show how this algorithm allows for the swift discovery of the community surrounding a given node without having to extract all the communities out of a graph.

cond-mat.stat-mech↗

arXiv2003

Information Flow in Social Groups

We present a study of information flow that takes into account the observation that an item relevant to one person is more likely to be of interest to individuals in the same social circle than those outside of it. This is due to the fact that the similarity of node attributes in social networks decreases as a function of the graph distance. An epidemic model on a scale-free network with this property has a finite threshold, implying that the spread of information is limited. We tested our predictions by measuring the spread of messages in an organization and also by numerical experiments that take into consideration the organizational distance among individuals.

cond-mat.stat-mech↗

arXiv2001

Self-Organizing Approach for Finding Borders of DNA Coding Regions

A self-organizing approach is proposed for gene finding based on the model of codon usage for coding regions and positional preference for noncoding regions. The symmetry between the direct and reverse coding regions is adopted for reducing the number of parameters. Without requiring prior training, parameters are estimated by iteration. By employing the window sliding technique and likelihood ratio, a very accurate segmentation is obtained.

physics.bio-ph↗