Hi guys,

Happy Chinese New year! Here I have an interesting working paper on complex social network. It is forthcoming on Games and Economic Behavior, which is a feild top journal (hopefully).  I uploaded two files: the paper and the slides of the presentation.

Here I have an idea. In the endogenous segregation argument, the paper assumes agents' types are distinct in their preferences. I am wondering if we can do it in this way: assigning higher probability of meeting agents within the same types. If we can get some closed-form solutions and comparative statics I am confident that it would be a B class journal article. Even if there does exist closed-form  solutions, we can do some numerical work to see how this network envolves.

文章简介： 改造传统SIS模型，能刻画两种信息在网络中的传播。