2009
DOI: 10.2202/1935-1704.1523
|View full text |Cite
|
Sign up to set email alerts
|

Identifying Community Structures from Network Data via Maximum Likelihood Methods

Abstract: Networks of social and economic interactions are often influenced by unobserved structures among the nodes. Based on a simple model of how an unobserved community structure generates networks of interactions, we axiomatize a method of detecting the latent community structures from network data. The method is based on maximum likelihood estimation. * Č opič is the department of economics at UCLA,

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
49
0
3

Year Published

2010
2010
2015
2015

Publication Types

Select...
6
3

Relationship

3
6

Authors

Journals

citations
Cited by 62 publications
(52 citation statements)
references
References 28 publications
0
49
0
3
Order By: Relevance
“…33 Essentially, there is homophily, but the researcher does not directly observe the communities that underly the homophily and so seeks to recover it. A class of such community detection techniques based on maximum likelihood estimation have been axiomatized by Copic, Jackson, and Kirman (2009).…”
Section: Community Detectionmentioning
confidence: 99%
“…33 Essentially, there is homophily, but the researcher does not directly observe the communities that underly the homophily and so seeks to recover it. A class of such community detection techniques based on maximum likelihood estimation have been axiomatized by Copic, Jackson, and Kirman (2009).…”
Section: Community Detectionmentioning
confidence: 99%
“…The importance of social circles as building blocks in networks have been emphasized by a number of sociologists, see for example the review in Degenne et Forsé [13], chapter 2. We also find a vast literature that deals with algorithms that identify community structures in network data (minimum-cut, hierarchical clustering, see Johnson et al [27], or more recent methods such as that of Girvan et al [20] ) or Copic et al [12]. However, many of these assume that each individual belongs to a single community which is to be identified.…”
Section: The Network: Community Based Small Worlds Random Graphsmentioning
confidence: 97%
“…While that game turns out to be hard to analyze even in three-person examples, it was an important precursor to the more recent economic literature on network formation. 38 In contrast to the cooperative game setting, Jackson and Wolinsky (1996) explicitly considered networks, rather than coalitions, as the primitive. Thus rather than deducing utilities indirectly through a cooperative game on a graph, they posited that networks were the primitive structure and agents derived utilities based on the network structure in place.…”
Section: An Economic Approachmentioning
confidence: 99%
“…Many algorithms have been developed to identify community structures in networks, and yet most of what we know about the relative merits or de…ciencies of various approaches and algorithms comes simply from examining whether they seem to give the "right" community structuring in various examples. An overview of some of this literature can be found in Newman (2004b) and a discussion of the importance of identifying the properties for identifying community structures can be found in Copic, Jackson and Kirman (2005).…”
Section: Whither Now?mentioning
confidence: 99%