نتایج جستجو برای: the daily friendship 3

تعداد نتایج: 16361050  

2015
Naghmeh Momeni Michael G. Rabbat

The friendship paradox is a sociological phenomenon stating that most people have fewer friends than their friends do. The generalized friendship paradox refers to the same observation for attributes other than degree, and it has been observed in Twitter and scientific collaboration networks. This paper takes an analytical approach to model this phenomenon. We consider a preferential attachment...

Journal: :iranian journal of psychiatry and behavioral sciences 0
katayon vakilian candidate in medical science shahroud university, department reproductive health, medical science shahroud university,shahroud,iran

objective: one of the main cultural issues in universities is relationships between male and female students. due to the adverse consequences of this issue, explaining of the beyond the causes of friendship with opposite-sex, is one of the first steps in planning for youth issues. methods: this qualitative research was conducted based on content analysis. nineteen female university students wer...

Journal: :CoRR 2014
Subhash C. Kak

The friendship paradox is revisited by considering both local and global averages of friends. How the economics of attention affects the recruitment of friends is examined. Statistical implications of varying individual attentions are investigated and it is argued that this is one reason why the mean of friends is higher than the median in social networks. The distribution of friends skews to t...

Journal: :CoRR 2014
Marcos Amaku Rafael I. Cipullo José H. H. Grisi-Filho Fernando S. Marques Raul Ossada

Our friends have more friends than we do. That is the basis of the friendship paradox. In mathematical terms, the mean number of friends of friends is higher than the mean number of friends. In the present study, we analyzed the relationship between the mean degree of vertices (individuals), 〈k〉, and the mean number of friends of friends, 〈kFF 〉, in scale-free networks with degrees ranging from...

Journal: :Afyon Kocatepe Üniversitesi Sosyal Bilimler Dergisi 2017

Journal: :Multiple-Valued Logic and Soft Computing 2016
George B. Mertzios Walter Unger

In this paper we provide a purely combinatorial proof of the Friendship Theorem, which has been first proven by P. Erdös et al. by using also algebraic methods. Moreover, we generalize this theorem in a natural way, assuming that every pair of nodes occupies ≥ 2 common neighbors. We prove that every graph, which satisfies this generalized -friendship condition, is a regular graph.

Journal: :The Journal of social issues 2014
Elizabeth Page-Gould Rodolfo Mendoza-Denton Wendy Berry Mendes

We examined the interplay of psychosocial risk and protective factors in daily experiences of health. In Study 1, the tendency to anxiously expect rejection from racial outgroup members, termed race-based rejection sensitivity (RS-race), was cross-sectionally related to greater stress-symptoms among Black adults who reported fewer cross-race friends but not among participants who had more cross...

2017
Josja J Rokven Gijs de Boer Jochem Tolsma Stijn Ruiter

This article examines how friends' involvement in crime influences such involvement in those around them, as offenders or victims, and the extent to which such friendship effects vary with contact frequency, friendship intimacy, and geographical proximity. To test our hypotheses we used four waves from the Dutch panel survey CrimeNL, which includes ego-centered network measures in each wave for...

2007
Stephen G. Hartke Jennifer Vandenbussche

The well-known Friendship Theorem states that ifG is a graph in which every pair of vertices has exactly one common neighbor, then G has a single vertex joined to all others (a “universal friend”). V. Sós defined an analogous friendship property for 3-uniformhypergraphs, andgave a construction satisfying the friendshipproperty that has auniversal friend.Wepresent new 3-uniformhypergraphs on 8, ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید