CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_upper_j_idt156",{id:"formSmash:upper:j_idt156",widgetVar:"widget_formSmash_upper_j_idt156",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:upper:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_upper_j_idt157_j_idt159",{id:"formSmash:upper:j_idt157:j_idt159",widgetVar:"widget_formSmash_upper_j_idt157_j_idt159",target:"formSmash:upper:j_idt157:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});

On Statistical Modeling of Social NetworksPrimeFaces.cw("AccordionPanel","widget_formSmash_some",{id:"formSmash:some",widgetVar:"widget_formSmash_some",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_all",{id:"formSmash:all",widgetVar:"widget_formSmash_all",multiple:true});
function selectAll()
{
var panelSome = $(PrimeFaces.escapeClientId("formSmash:some"));
var panelAll = $(PrimeFaces.escapeClientId("formSmash:all"));
panelAll.toggle();
toggleList(panelSome.get(0).childNodes, panelAll);
toggleList(panelAll.get(0).childNodes, panelAll);
}
/*Toggling the list of authorPanel nodes according to the toggling of the closeable second panel */
function toggleList(childList, panel)
{
var panelWasOpen = (panel.get(0).style.display == 'none');
// console.log('panel was open ' + panelWasOpen);
for (var c = 0; c < childList.length; c++) {
if (childList[c].classList.contains('authorPanel')) {
clickNode(panelWasOpen, childList[c]);
}
}
}
/*nodes have styleClass ui-corner-top if they are expanded and ui-corner-all if they are collapsed */
function clickNode(collapse, child)
{
if (collapse && child.classList.contains('ui-corner-top')) {
// console.log('collapse');
child.click();
}
if (!collapse && child.classList.contains('ui-corner-all')) {
// console.log('expand');
child.click();
}
}
PrimeFaces.cw("AccordionPanel","widget_formSmash_responsibleOrgs",{id:"formSmash:responsibleOrgs",widgetVar:"widget_formSmash_responsibleOrgs",multiple:true}); 1997 (English)Doctoral thesis, comprehensive summary (Other academic)
##### Abstract [en]

##### Place, publisher, year, edition, pages

Stockholm: Stockholm University , 1997. , 161 p.
##### National Category

Probability Theory and Statistics
##### Research subject

Statistics
##### Identifiers

URN: urn:nbn:se:su:diva-61832ISBN: 91-7153-665-5 (print)OAI: oai:DiVA.org:su-61832DiVA: diva2:438117
##### Public defence

1997-10-31, 13:00
##### Opponent

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt449",{id:"formSmash:j_idt449",widgetVar:"widget_formSmash_j_idt449",multiple:true});
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt456",{id:"formSmash:j_idt456",widgetVar:"widget_formSmash_j_idt456",multiple:true});
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt462",{id:"formSmash:j_idt462",widgetVar:"widget_formSmash_j_idt462",multiple:true});
##### Note

Härtill 4 uppsatserAvailable from: 2011-09-01 Created: 2011-09-01 Last updated: 2011-09-01Bibliographically approved

A social network is formed by a collection of individuals and the contacts or relations between them. The focus is here on relations defined by sociometric choices, implying that the individuals in the network have been required to choose among the other individuals in the group according to some criteria.

Some statistical models of the sociometric choice structure in a social network are presented. A recurrent assumption in the models is the assumption that there exists latent or underlying structures in a network, structures that can not be directly observed. The models also have in common the assumption of independence or conditional independence between entities of the network, assumptions not uncommon in statistical network models. These assumptions are often crucial for the possibility to find simple ways of estimating models. Here an attempt is made to find probabilistic models where independence is an ingredient but which also allow for structure.

The models are illustrated and evaluated by application to data where the sociometric choices are based on friendship or cooperation. The large number of networks available makes it possible to find and evaluate empirical distributions of the test statistics.

The simplest model presented assumes dyad independence. Possible simplifications by choice or edge independence are also discussed. It appears that dyad independence can not be ruled out, but that choice independence is inappropriate.

In order to model the transitive structure of a network, a model is introduced that is based on a random choice structure and an unknown underlying clique structure. Two different approaches for estimating the clique structure are discussed, the maximum likelihood approach and the Bayesian approach. The empirical results show no large deviation between model and observations.

A model of popularity structure is introduced where popularity is viewed as a latent attribute of the individuals in the network. The group of individuals is assumed to have a latent popularity structure, composed of individuals from three popularity groups. It is shown how the popularity structure can be estimated and how latent popularity can be considered in combination with manifest individual attributes.

A model is also presented for the situation when two sociometric relations are measured on one set of individuals. The model assumes that there exists a latent network structure which can not be observed directly. When the relations are measured on the network, deviations from the underlying structure might occur with some probability. Approximate estimates of model parameters are given. Empirical findings suggest that the birelational latent model is sufficiently accurate for the data, but that there appear to be convergence problems, possibly due to the relatively large number of parameters in the model.

isbn
urn-nbn$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_j_idt1166",{id:"formSmash:j_idt1166",widgetVar:"widget_formSmash_j_idt1166",showEffect:"fade",hideEffect:"fade",showDelay:500,hideDelay:300,target:"formSmash:altmetricDiv"});});

CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_lower_j_idt1219",{id:"formSmash:lower:j_idt1219",widgetVar:"widget_formSmash_lower_j_idt1219",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:lower:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_lower_j_idt1220_j_idt1222",{id:"formSmash:lower:j_idt1220:j_idt1222",widgetVar:"widget_formSmash_lower_j_idt1220_j_idt1222",target:"formSmash:lower:j_idt1220:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});