Perc (version 0.1.6)

Using Percolation and Conductance to Find Information Flow Certainty in a Direct Network

Description

To find the certainty of dominance interactions with indirect interactions being considered.

Copy Link

Version

Install

install.packages('Perc')

Monthly Downloads

188

Version

0.1.6

License

GPL (>= 2)

Maintainer

Jessica Vandeleest

Last Published

May 11th, 2021

Functions in Perc (0.1.6)

Perc

Perc.

getAllCosts

Associate each costs with its corresponding simulated annealing runs

conductance

compute win-loss probabilities

bradleyTerry

Computes the MLE for the BT model using an MM algorithm

dyadicLongConverter

dyadic long format converter

plotConfmat

generate heat map for a matrix

sampleRawMatrix

sampleRawMatrix. dominance interactions between 39 monkeys

sampleEdgelist

sampleEdgelist. social interactions among 11 monkeys

transitivity

calculate transitivity measurements for a matrix

valueConverter

win-loss probability matrix value converter

plotProbDiagnosis

Diagnosis Plot plotProbDiagnosis generate heat map for dominance probability matrix

simRankOrder

Find rank order using simulated annealing

sampleWeightedEdgelist

sampleWeightedEdgelist. dominance interactions among 29 monkeys

getSimOutput

get useful outputs from simulated annealing processes

individualDomProb

individual-level probability converter

getAllRankOrder

assign IDs to all best rank orders

bt.test

Systemic test for the assumptions of the Bradley-Terry model

getBestRankOrder

assign IDs to the best rank order

countPaths

count paths between all pairs

findIDpaths

find all paths of a certain length for an individual

findAllPaths

Identifies all paths between all pairs of less than or equal to a certain length

as.conflictmat

convert to a matrix of conf.mat class