Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Temporal walks vs Ngram #51

Open
sameeravithana opened this issue May 31, 2019 · 1 comment
Open

Temporal walks vs Ngram #51

sameeravithana opened this issue May 31, 2019 · 1 comment

Comments

@sameeravithana
Copy link

Can I feed unique temporal walks (i.e., random walks forward in the time) as ngrams to calculate the optimal k-th order of the underlying network?

@verginer
Copy link
Member

verginer commented Jun 3, 2019

Hi @SamTube405 thanks for reaching out!
I am not sure I understand your question correctly.
You have data only on the paths taken, whatever they may be, but not how often, but at least once?
If you have a strong theoretical or empirical argument that the system under consideration is well represented by these paths then maybe. However, most likely the underlying system is not sufficiently characterised by its unique paths and hence you would not estimate what you want.
In other words the data is not sufficient to identify memory effects.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants