Group formation in large social networks: membership, growth, and evolution

  title={Group formation in large social networks: membership, growth, and evolution},
  author={Lars Backstrom and Daniel P. Huttenlocher and Jon M. Kleinberg and Xiangyang Lan},
  booktitle={KDD '06},
The processes by which communities come together, attract new members, and develop over time is a central research issue in the social sciences - political movements, professional organizations, and religious denominations all provide fundamental examples of such communities. In the digital domain, on-line groups are becoming increasingly prominent due to the growth of community and social networking sites such as MySpace and LiveJournal. However, the challenge of collecting and analyzing large… 

Dynamic Evolution of Hashtags on Twitter: A Case Study from Career Opportunities Groups

Three new measures are introduced (two influence measures and one topological measure) that are used to spot the measures that can be used for influencing a user to attract other users to a certain hashtag.

Incremental local community identification in dynamic social networks

This paper introduces a new incremental community mining approach, in which communities in the current time are obtained based on the communities from the past time frame, which is more effective at detecting stable communities over time.

Dynamics of Overlapping Community Structures with Application to Expert Identification

A two-phase algorithm based on two significant rather simple social dynamics named Disassortative degree Mixing and Information Diffusion is proposed—this algorithm is called DMID and results indicate that DMID competitively wins in several cases over the baselines in the community prediction problem.

Community analysis in dynamic social networks

The obtained results indicate that the introduced clustering techniques are appropriate to efficiently detect online communities in large social networks and to track their evolution over time.

Circles and ties : The drivers of group dynamics in social media

An analysis of the evolution of a large set of groups from Flickr, a popular media sharing Web service, identifies the influence of a number of properties on the macroscopic growth in content and population of these communities, discussing which properties can be regarded as drivers or regulators of group growth.

Understanding Evolution of Inter-Group Relationships Using Bipartite Networks

This is the first attempt to analytically model the dynamical relationships among groups in online social systems and shows that the inter-group network is tightly knit, and there is an implicit semantic hierarchy within its structure, that is clearly identified by the method of thresholding.

Structure and Overlaps of Communities in Networks

The Community-Affiliation Graph Model (AGM) is presented, a conceptual model of network community structure which reliably captures the overall structure of networks as well as the overlapping nature of network communities.

Discovery and analysis of tightly knit communities in telecom social networks

A novel highly scalable method for finding large maximal cliques that is validated with experimental results on several real-life social networks is presented and it is believed that the findings will reassert the importance of finding communities in telecom social networks and will help telecom operators improve group targeting and customer relationship management.

Towards Community Detection in Locally Heterogeneous Networks

A simple property of social networks, which is referred to as the local succinctness property, is explored in order to extract compressed descriptions of the underlying community representation of the social network with the use of a min-hash approach, and it is shown that this approach creates balanced communities across a heterogeneous network in an effective way.

The life and death of online groups: predicting group growth and longevity

Analysis of data from several thousand online social networks built on the Ning platform provides insight into how both early non-diffusion growth and a complex set of network constraints appear to contribute to the initial and continued growth and success of groups within social networks.



Community structure in social and biological networks

  • M. GirvanM. Newman
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2002
This article proposes a method for detecting communities, built around the idea of using centrality indices to find community boundaries, and tests it on computer-generated and real-world graphs whose community structure is already known and finds that the method detects this known structure with high sensitivity and reliability.

Natural communities in large linked networks

This work has developed an efficient, scalable agglomerative strategy and applied it to the citation graph of the NEC CiteSeer database and finds that some communities are essentially random and thus unstable while others are natural and will appear in most clusterings.

Empirical Analysis of an Evolving Social Network

This work analyzed a dynamic social network comprising 43,553 students, faculty, and staff at a large university, in which interactions between individuals are inferred from time-stamped e-mail headers recorded over one academic year and are matched with affiliations and attributes.

Detecting community structure in networks

A number of more recent algorithms that appear to work well with real-world network data, including algorithms based on edge betweenness scores, on counts of short loops in networks and on voltage differences in resistor networks are described.

Social Network Analysis

This paper reports on the development of social network analysis, tracing its origins in classical sociology and its more recent formulation in social scientific and mathematical work. It is argued

Maximizing the spread of influence through a social network

An analysis framework based on submodular functions shows that a natural greedy strategy obtains a solution that is provably within 63% of optimal for several classes of models, and suggests a general approach for reasoning about the performance guarantees of algorithms for these types of influence problems in social networks.

Geographic routing in social networks

A richer model relating geography and social-network friendship is introduced, in which the probability of befriending a particular person is inversely proportional to the number of closer people.

A social network caught in the Web

Using the rich profile data provided by the users, the analysis of Club Nexus was able to deduce the attributes contributing to the formation of friendships, and to determine how the similarity of users decays as the distance between them in the network increases.

Exploring the community structure of newsgroups

The network formed by cross-posts, messages that are posted to two or more newsgroups simultaneously, is analyzed to show that it is a small-world network with significant clustering.

Dynamic social network analysis using latent space models

This paper generalizes a successful static model of relationships into a dynamic model that accounts for friendships drifting over time and shows how to make it tractable to learn such models from data, even as the number of entities n gets large.