one_fluency {memnet} | R Documentation |
Generates verbal fluency data using a switcher-random walk process.
one_fluency(adj_list, n, pjump = 0, type = 0L)
adj_list |
a list containing row indices of nodes adjacent node to the ith node as created by get_adjlist. |
n |
integer specifying the number of unique productions. |
pjump |
numeric specifying the probability of a jump. |
type |
integer controlling network start and jump nodes.
For |
Function produces verbal fluency data via a switcher random walk
process that traverses the network by selecting a neighbor with
probability 1-pjump
or jumps to a random place in the network
with probability pjump
. Where the random walk process enters
the network and where it jumps to is further controlled
by type
. Neighbors are always selected uniformly.
Integer vector containing the indices of the fluency productions. Indices refer to the row of the item in the original adjacency matrix. See get_adjlist.
Wulff, D. U., Hills, T., & Mata, R. (2018, October 29). Structural differences in the semantic networks of younger and older adults. https://doi.org/10.31234/osf.io/s73dp
Goni, J., Martincorena, I., Corominas-Murtra, B., Arrondo, G., Ardanza- Trevijano, S., & Villoslada, P. (2010). Switcher-random-walks: A cognitive- inspired mechanism for network exploration. International Journal of Bifurcation and Chaos, 20(03), 913-922.
# generate watts strogatz graph network = grow_ws(n = 100, k = 10) # create verbal fluency sequence one_fluency(get_adjlist(network), 10) # create verbal fluency sequence # with high jump probability one_fluency(get_adjlist(network), 10, pjump = .5)