Bernardo A. Huberman

ORCID: 0000-0002-6783-0864
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Complex Network Analysis Techniques
  • Opinion Dynamics and Social Influence
  • Game Theory and Applications
  • Complex Systems and Time Series Analysis
  • Auction Theory and Applications
  • Evolutionary Game Theory and Cooperation
  • Experimental Behavioral Economics Studies
  • Consumer Market Behavior and Pricing
  • Economic theories and models
  • Theoretical and Computational Physics
  • Peer-to-Peer Network Technologies
  • Nonlinear Dynamics and Pattern Formation
  • Digital Platforms and Economics
  • Neural Networks and Applications
  • Social Media and Politics
  • Quantum Computing Algorithms and Architecture
  • Chaos control and synchronization
  • Cryptography and Data Security
  • Quantum Information and Cryptography
  • Business Strategy and Innovation
  • Complex Systems and Decision Making
  • Misinformation and Its Impacts
  • Wikis in Education and Collaboration
  • Advanced Wireless Network Optimization
  • Cellular Automata and Applications

Cablevision (United States)
2022

Hewlett-Packard (United States)
2008-2021

Stanford University
1989-2018

Palo Alto Research Center
1994-2017

University of California, Santa Cruz
2017

Association for Computing Machinery
2017

Hewlett Packard Enterprise (United States)
2015

The University of Texas at Austin
2007

University of California System
2004-2007

Xerox (France)
1995-1998

We present an analysis of a person-to-person recommendation network, consisting 4 million people who made 16 recommendations on half products. observe the propagation and cascade sizes, which we explain by simple stochastic model. analyze how user behavior varies within communities defined network. Product purchases follow ‘long tail’ where significant share belongs to rarely sold items. establish network grows over time effective it is from viewpoint sender receiver recommendations. While...

10.1145/1232722.1232727 article EN ACM Transactions on the Web 2007-05-01

Many communication and social networks have power-law link distributions, containing a few nodes that very high degree many with low degree. The connectivity play the important role of hubs in networking, fact can be exploited when designing efficient search algorithms. We introduce number local strategies utilize graphs costs scaling sublinearly size graph. also demonstrate utility these on GNUTELLA peer-to-peer network.

10.1103/physreve.64.046135 article EN Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics 2001-09-26

Barabasi and Albert ([1][1]) propose an improved version of the Erdos-Renyi (ER) theory random networks to account for scaling properties a number systems, including link structure World Wide Web (WWW). The they present, however, is inconsistent with empirically

10.1126/science.287.5461.2115a article EN Science 2000-03-24

Early patterns of Digg diggs and YouTube views reflect long-term user interest.

10.1145/1787234.1787254 article EN Communications of the ACM 2010-07-27

Scholars, advertisers and political activists see massive online social networks as a representation of interactions that can be used to study the propagation ideas, bond dynamics viral marketing, among others. But linked structures do not reveal actual people. Scarcity attention daily rythms life work makes people default interacting with those few matter reciprocate their attention. A within Twitter reveals driver usage is sparse hidden network connections underlying “declared” set friends...

10.5210/fm.v14i1.2317 article EN First Monday 2008-12-20

Collaborative tagging describes the process by which many users add metadata in form of keywords to shared content. Recently, collaborative has grown popularity on web, sites that allow tag bookmarks, photographs and other In this paper we analyze structure systems as well their dynamical aspects. Specifically, discovered regularities user activity, frequencies, kinds tags used, bursts bookmarking a remarkable stability relative proportions within given url. We also present model predicts...

10.48550/arxiv.cs/0508082 preprint EN other-oa arXiv (Cornell University) 2005-01-01

We investigate the effectiveness of connectionist architectures for predicting future behavior nonlinear dynamical systems. focus on real-world time series limited record length. Two examples are analyzed: benchmark sunspot and chaotic data from a computational ecosystem. The problem overfitting, particularly serious short records noisy data, is addressed both by using statistical method validation adding complexity term to cost function ("back-propagation with weight-elimination")....

10.1142/s0129065790000102 article EN International Journal of Neural Systems 1990-01-01

One of the most common modes accessing information in World Wide Web is surfing from one document to another along hyperlinks. Several large empirical studies have revealed patterns behavior. A model that assumes users make a sequence decisions proceed page, continuing as long value current page exceeds some threshold, yields probability distribution for number pages user visits within given site. This was verified by comparing its predictions with detailed measurements patterns. The also...

10.1126/science.280.5360.95 article EN Science 1998-04-03

The authors have designed and implemented an open, market-based computational system called Spawn. Spawn utilizes idle resources in a distributed network of heterogeneous computer workstations. It supports both coarse-grain concurrent applications the remote execution many independent tasks. Using Monte Carlo simulations as prototypical applications, explore issues fairness resource distribution, currency form priority, price equilibria, dynamics transients, scaling to large systems. In...

10.1109/32.121753 article EN IEEE Transactions on Software Engineering 1992-01-01

The subject of collective attention is central to an information age where millions people are inundated with daily messages. It thus interest understand how novel items propagates and eventually fades among large populations. We have analyzed the dynamics 1 million users interactive web site, digg.com, devoted thousands news stories. observations can be described by a dynamical model characterized single novelty factor. Our measurements indicate that within groups decays...

10.1073/pnas.0704916104 article EN Proceedings of the National Academy of Sciences 2007-10-25

The Prisoner's Dilemma has long been considered the paradigm for studying emergence of cooperation among selfish individuals. Because its importance, it studied through computer experiments as well in laboratory and by analytical means. However, there are important differences between way a system composed many interacting elements is simulated digital machine manner which behaves when real experiments. In some instances, these disparities can be marked enough so to cast doubt on...

10.1073/pnas.90.16.7716 article EN Proceedings of the National Academy of Sciences 1993-08-15

10.1140/epjb/e2004-00125-x article EN The European Physical Journal B 2004-03-01

We present an analysis of a person-to-person recommendation network, consisting 4 million people who made 16 recommendations on half products. observe the propagation and cascade sizes, which we explain by simple stochastic model. then establish how network grows over time effective it is from viewpoint sender receiver recommendations. While average are not very at inducing purchases do spread far, model that successfully identifies product pricing categories for viral marketing seems to be...

10.1145/1134707.1134732 article EN 2006-06-11

A general method for combining existing algorithms into new programs that are unequivocally preferable to any of the component is presented. This method, based on notions risk in economics, offers a computational portfolio design procedure can be used wide range problems. Tested by solving canonical NP-complete problem, problems ranging from combinatorics DNA sequencing completion tasks environments with resource contention, such as World Wide Web.

10.1126/science.275.5296.51 article EN Science 1997-01-03

Scholars, advertisers and political activists see massive online social networks as a representation of interactions that can be used to study the propagation ideas, bond dynamics viral marketing, among others. But linked structures do not reveal actual people. Scarcity attention daily rythms life work makes people default interacting with those few matter reciprocate their attention. A within Twitter reveals driver usage is sparse hidden network connections underlying "declared" set friends...

10.2139/ssrn.1313405 article EN SSRN Electronic Journal 2008-01-01

The aperiodic or chaotic behavior for one-dimensional maps just before a tangent bifurcation occurs appears as intermittency in which long laminarlike regions irregularly separated by bursts occur. Proceeding from the picture proposed Pomeau and Manneville, numerical experiments analytic calculations are carried out on various models exhibiting this behavior. presence of external noise is analyzed, case general power dependence curve near studied. Scaling relations average length laminar...

10.1103/physreva.25.519 article EN Physical review. A, General physics 1982-01-01

We describe a method for the automatic identification of communities practice from e-mail logs within an organization. use betweenness centrality algorithm that can rapidly find graph representing information flows. apply this to initial corpus nearly 1 million messages collected over 2-month span, and show is effective at identifying true communities, both formal informal, these scale-free graphs. This approach also enables leadership roles communities. These studies are complemented by...

10.1080/01972240590925348 article EN The Information Society 2005-04-01

The ever-increasing amount of information flowing through Social Media forces the members these networks to compete for attention and influence by relying on other people spread their message. A large study propagation within Twitter reveals that majority users act as passive consumers do not forward content network. Therefore, in order individuals become influential they must only obtain thus be popular, but also overcome user passivity. We propose an algorithm determines passivity based...

10.1145/1963192.1963250 article EN 2011-03-28
Coming Soon ...