FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W244463112> ?p ?o ?g. }

• W244463112 abstract "Triads and transitivity are two concepts within the field of social network analysis that are closely related to each other. We study some estimation and testing problems related to those concepts, using the tools of graph theory; the results obtained could be applied to graphs representing other kinds of data than social relations. Throughout this thesis, we focus on the role of local networks. A local network for an individual in a friendship network may be regarded as the network between the friends of this person. Two local network attributes that we pay special attention to are the size and the density. The local size of a vertex is defined so that it counts the number of transitive relationships in which that vertex is involved; this definition is not undisputable in the digraph situation, since not all edges in the local network are counted using that definition. We define the local density of a vertex in such a way, that its expected value is equal to the expected overall density of the network under some commonly used simple random graph and random digraph models. When dealing with triad count estimation, we consider the situation when we have observed information about a probability sample of vertices in a graph or digraph; we let the amount of information observed for each vertex range from the vertex degree to the entire local network of that vertex. Horvitz-Thompson estimators (and variance estimators for those estimators) for the triad counts are given. A main result is that when local networks without information on the identities of the vertices in that network are observed, the triad counts may be expressed as sums of vertex attributes; this greatly facilitates the estimation based on vertex sampling designs more complex than simple random sampling. Transitivity testing is considered for graphs and digraphs that are observed in their entirety. We study two different kinds of transitivity tests; tests based on the counts of transitive and intransitive triads and triples, and tests based on the mean local density over all vertices. The null hypothesis used is that the graphs and digraphs observed have been generated according to some conditional uniform random graph model that does not imply a high degree of transitivity. The powers of the tests against random graph distributions that generate highly transitive graphs are examined in simulation studies. In other simulation studies, the tests are applied to a large set of school class sociograms. When (undirected) graphs are considered, the test based on the proportion of transitive triads out of the non-vacuously transitive ones is found to be best at detecting transitivity; for digraphs, the test based on the difference between the mean local density and the overall network density is the best transitivity detector." @default.
• W244463112 created "2016-06-24" @default.
• W244463112 creator A5033337277 @default.
• W244463112 date "1997-01-01" @default.
• W244463112 modified "2023-09-27" @default.
• W244463112 title "Triad count estimation and transitivity testing in graphs and digraphs" @default.
• W244463112 hasPublicationYear "1997" @default.
• W244463112 type Work @default.
• W244463112 sameAs 244463112 @default.
• W244463112 citedByCount "0" @default.
• W244463112 crossrefType "journal-article" @default.
• W244463112 hasAuthorship W244463112A5033337277 @default.
• W244463112 hasConcept C105795698 @default.
• W244463112 hasConcept C114614502 @default.
• W244463112 hasConcept C118615104 @default.
• W244463112 hasConcept C132525143 @default.
• W244463112 hasConcept C185429906 @default.
• W244463112 hasConcept C191399111 @default.
• W244463112 hasConcept C2779145032 @default.
• W244463112 hasConcept C33923547 @default.
• W244463112 hasConcept C41008148 @default.
• W244463112 hasConcept C47458327 @default.
• W244463112 hasConcept C80444323 @default.
• W244463112 hasConcept C80899671 @default.
• W244463112 hasConceptScore W244463112C105795698 @default.
• W244463112 hasConceptScore W244463112C114614502 @default.
• W244463112 hasConceptScore W244463112C118615104 @default.
• W244463112 hasConceptScore W244463112C132525143 @default.
• W244463112 hasConceptScore W244463112C185429906 @default.
• W244463112 hasConceptScore W244463112C191399111 @default.
• W244463112 hasConceptScore W244463112C2779145032 @default.
• W244463112 hasConceptScore W244463112C33923547 @default.
• W244463112 hasConceptScore W244463112C41008148 @default.
• W244463112 hasConceptScore W244463112C47458327 @default.
• W244463112 hasConceptScore W244463112C80444323 @default.
• W244463112 hasConceptScore W244463112C80899671 @default.
• W244463112 hasLocation W2444631121 @default.
• W244463112 hasOpenAccess W244463112 @default.
• W244463112 hasPrimaryLocation W2444631121 @default.
• W244463112 hasRelatedWork W1545808719 @default.
• W244463112 hasRelatedWork W1953211229 @default.
• W244463112 hasRelatedWork W1994115512 @default.
• W244463112 hasRelatedWork W2019145656 @default.
• W244463112 hasRelatedWork W2092565550 @default.
• W244463112 hasRelatedWork W2119509057 @default.
• W244463112 hasRelatedWork W2121115513 @default.
• W244463112 hasRelatedWork W2143820092 @default.
• W244463112 hasRelatedWork W2257168763 @default.
• W244463112 hasRelatedWork W2565027958 @default.
• W244463112 hasRelatedWork W2611773579 @default.
• W244463112 hasRelatedWork W2749332180 @default.
• W244463112 hasRelatedWork W2783683791 @default.
• W244463112 hasRelatedWork W2797539690 @default.
• W244463112 hasRelatedWork W2949518961 @default.
• W244463112 hasRelatedWork W2952829452 @default.
• W244463112 hasRelatedWork W2963344959 @default.
• W244463112 hasRelatedWork W2966094451 @default.
• W244463112 hasRelatedWork W2991580438 @default.
• W244463112 hasRelatedWork W3100347810 @default.
• W244463112 isParatext "false" @default.
• W244463112 isRetracted "false" @default.
• W244463112 magId "244463112" @default.
• W244463112 workType "article" @default.