Generates verbal fluency data using a switcher-random walk process.
a list containing row indices of nodes adjacent node to the ith node as created by get_adjlist.
integer specifying the maximum number of productions. Function may
return fewer than
numeric specifying the probability of a jump.
integer controlling network start and jump nodes.
Function produces verbal fluency data via a switcher random walk
process that traverses the network by selecting a neighbor with
1-pjump or jumps to a random place in the network
pjump. Where the random walk process enters
the network and where it jumps to is further controlled
type. Neighbors are always selected uniformly.
In contrast to fluency, this function does not check at every step
whether the sampled neighbor is already in the list of productions. Instead,
ffluency simply returns the list of unique productions. This means
that if repetitions occur
ffluency will produce sequences of length
min(n * 3 - k, n) where k is the number of repeptitions.
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.
1 2 3 4 5 6 7 8 9
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.