Sudden emergence of a giant k-core in a random graph
Journal of Combinatorial Theory Series B
First to market is not everything: an analysis of preferential attachment with fitness
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Social and Economic Networks
Protean graphs with a variety of ranking schemes
Theoretical Computer Science
Estimating node similarity from co-citation in a spatial graph model
Proceedings of the 2010 ACM Symposium on Applied Computing
A Course on the Web Graph
Rank-Based Attachment Leads to Power Law Graphs
SIAM Journal on Discrete Mathematics
Hi-index | 0.00 |
Research on self-organizing networks, especially in the context of the Web graph, holds great promise to understand the complexity that underlies many social systems. We argue that models of social network structure should begin to consider how structure arises from the "content" of networks, a term we use to describe attributes of network actors that are independent of their structural position, such as skill, intelligence, or wealth. We propose a rank model of how content (operationalized as attribute rank relative to other individuals) may change amongst agents over time within a stochastic system. We then propose a model of network self-organization based on this rank model. Finally, we demonstrate how one may make inferences about the content of networks when attributes are unobserved, but network structures are readily measured. This approach holds promise to enhance our study of social interactions within the Web graph and in complex social networks in general.