2010
DOI: 10.1002/cplx.v16:1
|View full text |Cite
|
Sign up to set email alerts
|

Untitled

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 248 publications
0
4
0
Order By: Relevance
“…See tables S1-S3 in SI (section 2, available from stacks.iop.org/NJP/14/043029/mmedia) for the details of the books. The texts were represented with complex networks [8][9][10][11][23][24][25][26][27][28][29], in which the edges are defined on the basis of cooccurrence of words (see section 2). The latter procedure has been proven to be suitable for quantifying both the style and structure of texts (see, e.g.…”
Section: The Databasementioning
confidence: 99%
“…See tables S1-S3 in SI (section 2, available from stacks.iop.org/NJP/14/043029/mmedia) for the details of the books. The texts were represented with complex networks [8][9][10][11][23][24][25][26][27][28][29], in which the edges are defined on the basis of cooccurrence of words (see section 2). The latter procedure has been proven to be suitable for quantifying both the style and structure of texts (see, e.g.…”
Section: The Databasementioning
confidence: 99%
“…In recent years, physicists have proposed new approaches based on concepts from complex networks [2][3][4][5][6][7][8][9][10][11][12][13][14][15] and dynamical systems [16][17][18][19][20]. In the former, text is represented as complex networks with words (nodes) being connected (links) using procedures depending on their syntactic or semantic relationships [2].…”
Section: Introductionmentioning
confidence: 99%
“…In order to present this combination of elements and reveal their organization, Flament (1981) developed the matrix tree which graphically displays the hierarchy and the links among pairs of elements. Such a matrix tree consists of nodes, or circles, which represent entities, and lines, drawn between the nodes to indicate a connection between them (Solé, Corominas-Murtra, Valverde, & Steels, 2010;Wiles et al, 2010). Since the size of the nodes is based on frequency, the matrix tree illustrates the most central categories.…”
Section: Word Association Methodsmentioning
confidence: 99%
“…By applying the software Iramutec (Ratinaud, 2009), which is an r-based interface designed to identify structure and hierarchy of the SR, an in-depth analysis was carried out (Abric, 2001;Alves-Mazzotti, 2011). By defining the categories as circles and the co-occurrence relationships as lines, word networks for analyzing structure properties of social representation were revealed (Solé et al, 2010;Wiles et al, 2010) The thickness of the lines was in proportion to the number of co-occurrences and the size of the circles was in proportion to the number of mentions but only to a certain degree, the largest circle was 10 times bigger than the smallest one which supplied the proportional borders for the rest of the circles. By considering the frequency of appearance in relation to the co-occurrence of categories displayed in matrix trees, we gained insight into the most prominent elements of the social representation.…”
Section: Word Association Methodsmentioning
confidence: 99%