1976
DOI: 10.1080/00221325.1976.10534029
|View full text |Cite
|
Sign up to set email alerts
|

Personality Characteristics of Gifted Israeli Children

Abstract: Two groups of Israeli boys and girls in Grades 4-8, one intellectually gifted with a mean WISC IQ of (N = 182) and one nongifted (N = 310), were compared on several indices of personal-social adjustment. As predicted, the gifted group showed more positive self-concept, more internal locus of control, a lower level of general anxiety, and a still lower level of test anxiety. The few results on self-concept, unfavorable to the older gifted children, were attributed to a shift in the attitudes of gifted and nongi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
83
0
2

Year Published

1986
1986
2006
2006

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 86 publications
(91 citation statements)
references
References 3 publications
1
83
0
2
Order By: Relevance
“…Yet, the small-world property (ii) has been completely neglected. There are different paths to estimate D. First, we can use a direct approach as the Milgram's experiments [32]. Second, we can measure other network properties such as the degree distribution and then try to estimate D using network models [34,35,36,37,38,48].…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Yet, the small-world property (ii) has been completely neglected. There are different paths to estimate D. First, we can use a direct approach as the Milgram's experiments [32]. Second, we can measure other network properties such as the degree distribution and then try to estimate D using network models [34,35,36,37,38,48].…”
Section: Discussionmentioning
confidence: 99%
“…Social experiments such as the Kevin Bacon and Erdős numbers [31] or the Milgram experiment [32] reveal that social actors are separated by a small number of acquaintances ("small-world" property [33]). This observation is supported by theoretical approaches demonstrating that D grows at most as log N in random graphs [34,35,36,37].…”
Section: A Contact-graphmentioning
confidence: 99%
“…On the other hand, the clustering coefficient C does not depend on N for a regular lattice, while it goes to zero in large random graphs. From these two limiting cases one could argue that short L is always associated with small C, and long L with large C. Instead social systems, which are a paradigmatic example of a small-world network, can exhibit, at the same time, short characteristic path length [8] like random graphs, and high clustering [26]. Now we can come back to the WS model.…”
Section: The Small-world Behavior: the Ws Modelmentioning
confidence: 99%
“…The characteristic path length L One of the most important quantities to characterize the properties of a graph is the geodesic, or the shortest path length between two vertices (popularly known in social networks as the number of degrees of separation [8,22,23]). The shortest path length d ij between i and j is the minimum number of edges traversed to get from a vertex i to another vertex j.…”
Section: The Ws Formulationmentioning
confidence: 99%
See 1 more Smart Citation