Competition under Cumulative Advantage

Slides:



Advertisements
Similar presentations
Paradigms of complex systems
Advertisements

Introduction to Queuing Theory
A Tutorial on Learning with Bayesian Networks
Algorithmic and Economic Aspects of Networks Nicole Immorlica.
1 Continuous random variables Continuous random variable Let X be such a random variable Takes on values in the real space  (-infinity; +infinity)  (lower.
CS433: Modeling and Simulation
Modeling Malware Spreading Dynamics Michele Garetto (Politecnico di Torino – Italy) Weibo Gong (University of Massachusetts – Amherst – MA) Don Towsley.
Information Networks Generative processes for Power Laws and Scale-Free networks Lecture 4.
The Barabási-Albert [BA] model (1999) ER Model Look at the distribution of degrees ER ModelWS Model actorspower grid www The probability of finding a highly.
CS Lecture 6 Generative Graph Models Part II.
Probability By Zhichun Li.
Advanced Topics in Data Mining Special focus: Social Networks.
1 Dynamic Models for File Sizes and Double Pareto Distributions Michael Mitzenmacher Harvard University.
Copyright © 2005 Brooks/Cole, a division of Thomson Learning, Inc. 8.1 Chapter 8 Continuous Probability Distributions.
Chapter6 Jointly Distributed Random Variables
©2003/04 Alessandro Bogliolo Background Information theory Probability theory Algorithms.
Information Networks Power Laws and Network Models Lecture 3.
Nothing in (computational) biology makes sense except in the light of evolution after Theodosius Dobzhansky (1970) Power laws, scalefree networks, the.
Traffic Modeling.
Models and Algorithms for Complex Networks Power laws and generative processes.
Stochastic Processes A stochastic process is a model that evolves in time or space subject to probabilistic laws. The simplest example is the one-dimensional.
COLOR TEST COLOR TEST. Social Networks: Structure and Impact N ICOLE I MMORLICA, N ORTHWESTERN U.
0 K. Salah 2. Review of Probability and Statistics Refs: Law & Kelton, Chapter 4.
2010 © University of Michigan 1 DivRank: Interplay of Prestige and Diversity in Information Networks Qiaozhu Mei 1,2, Jian Guo 3, Dragomir Radev 1,2 1.
Chapter 12 Continuous Random Variables and their Probability Distributions.
Chapter 15 – CTRW Continuous Time Random Walks. Random Walks So far we have been looking at random walks with the following Langevin equation  is a.
Class 9: Barabasi-Albert Model-Part I
Conditional Probability Mass Function. Introduction P[A|B] is the probability of an event A, giving that we know that some other event B has occurred.
Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.
Emergence of double scaling law in complex systems 报告人:韩定定 华东师范大学 上海应用物理研究所.
Random Variables r Random variables define a real valued function over a sample space. r The value of a random variable is determined by the outcome of.
The simultaneous evolution of author and paper networks
Random Walk for Similarity Testing in Complex Networks
Shan Lu, Jieqi Kang, Weibo Gong, Don Towsley UMASS Amherst
Bioinformatics 3 V6 – Biological Networks are Scale- free, aren't they? Fri, Nov 2, 2012.
Random variables (r.v.) Random variable
ASV Chapters 1 - Sample Spaces and Probabilities
Business Modeling Lecturer: Ing. Martina Hanová, PhD.
Topics In Social Computing (67810)
Modeling, sampling, generating Networks with MRV
CS224W: Social and Information Network Analysis
Generative Model To Construct Blog and Post Networks In Blogosphere
Software Reliability Models.
Models of Network Formation
The likelihood of linking to a popular website is higher
Models of Network Formation
Econometric Models The most basic econometric model consists of a relationship between two variables which is disturbed by a random error. We need to use.
Models of Network Formation
Models of Network Formation
Peer-to-Peer and Social Networks
The Normal Distribution
Competition under Cumulative Advantage
8. One Function of Two Random Variables
Pattern Recognition and Machine Learning Chapter 2: Probability Distributions July chonbuk national university.
Sampling Distributions (§ )
Network Science: A Short Introduction i3 Workshop
Stochastic Processes A stochastic process is a model that evolves in time or space subject to probabilistic laws. The simplest example is the one-dimensional.
Berlin Chen Department of Computer Science & Information Engineering
Shan Lu, Jieqi Kang, Weibo Gong, Don Towsley UMASS Amherst
Berlin Chen Department of Computer Science & Information Engineering
Independence and Counting
Random Variables A random variable is a rule that assigns exactly one value to each point in a sample space for an experiment. A random variable can be.
Network Models Michael Goodrich Some slides adapted from:
Independence and Counting
Independence and Counting
Berlin Chen Department of Computer Science & Information Engineering
8. One Function of Two Random Variables
Discrete Mathematics and its Applications Lecture 6 – PA models
Advanced Topics in Data Mining Special focus: Social Networks
Empirical Distributions
Presentation transcript:

Competition under Cumulative Advantage Bo Jiang UMass MURI Ithaca October 1, 2013 Hello, everyone. I’m going to talk about our work on competition under cumulative advantage.

Competition w/ cumulative advantage # citations for scientific papers # customers for wireless service providers Population infected by different viruses Cumulative advantage “rich gets richer” Simplest form of network effects Known to generate power laws Competition is ubiquitous. It arises naturally in many social phenomena. For example, we can talk about scientific papers competing for citations, wireless service providers competing for customers, and different kinds of viruses competing for susceptible population. The second ingredient is cumulative advantage. It refers to the rich gets richer phenomenon. For example, here’s a blue community and a red community. The new arrival, represented by the black node here, is more likely to joint the red community because it has a larger size. This is the simplest form of network effect, and is also known under various other names such as preferential attachment. It is know to generate power laws under some conditions.

Questions Is there a winner? Duration of competition? Time taken for winner to emerge Intensity of competition? Total # changes in leadership Impact of inherent fitness? Impact of initial wealth? The general questions we are interested in about competitions are: Is there a winner? How long does the competition last?

Model Two competitor case State (R,B) in 2D lattice Each time, R increases by 1 or B increases by 1 Transition rule, relative fitness for B Generalized Pólya’s urn model For this talk, we will focus on the two competitor case. We will call the two competitors blue and red. We also assume the quantity of interest in the competition is measured in discrete units, so the state space is the first quadrant of the 2D lattice. At each time, We will refer to this quantity as the wealth of the competitor. w/o CA GPU RW

Results – equal fitness case Relation to Random Walk Prob. of any path connecting states and is In general, fix initial wealth , for any event , CA equivalent to beta mixture of RW Results for RW easier to obtain RW is beta func. Beta density with parameters and

Results – equal fitness case Joint PMF for duration and # lead changes Similarly for

Results – equal fitness case Duration has power-law distribution Initial wealth not affect tail exponent Infinite mean Can take very long for leadership to stabilize

Results – equal fitness case Intensity has power-law distribution Initial wealth not affect tail exponent Infinite mean Leadership can alternate large # of times

Results – diff. fitness case Intensity has exponential tail Duration remains power law Discontinuity in tail exp. from to When slightly > 1, tail heavier than case When , tail similar to case

Discontinuity demystified, Non-negligible prob. to reach state When , unlikely to change again When , guaranteed to change again, only much later

Other results diff. fitness, lower bound on tail exponent of duration distr. eq. fitness, between M=3+ individuals where is Dirichlet density w/ param. ; is (M-1)-dim simplex.

Ongoing work exact tail exponent, diff. fitness exact asymptotics, diff. fitness joint PMF for duration and # lead changes, diff. fitness (leverage Gena’s recent work?) correlation between duration and # lead changes competitions between 3+ individuals parameter estimation (with Davis)