-
## Standard Chung's construction:
- we have a two-layer graph, each layer with N nodes (indices form 1 to N)
- we sample a random permutations of pairs, P: [d] x [N] --> [d] x [N]
- assign edges…
-
Hi Smorodov
I'm currently using the DNN detector, it works fine, I need to track people, I managed to use Kalman filtering for one person, but it failed drastically for multiple persons, but this i…
-
While doing bipartite graphs of IP address -> Alert name for example, it'd be nice to keep the column names so you can refer to them in histograms and filters. (I found myself confused for a few secon…
-
Join in for the weekly Monero Research Lab meeting.
**When**: Monday, 29 April 2019 @ 17:00 UTC
**Where**: #monero-research-lab (freenode/matrix)
**Agenda**
1. Greetings
2. Roundtable
a. S…
-
Thanks everyone for the hard work. We really did a lot for a smooth beta release. With the repo being opened and more community help in-coming, it is a good time to figure out the roadmap to v0.2 rele…
-
In this ticket, we clean methods for adding/removing vertices/edges and enumerating neighbors. The main changes are:
- add parameter `sort` to method `.vertices`. This gives an alternative to `list(…
-
Join in for the weekly Monero Research Lab meeting.
**When**: Monday, 25 March 2019 @ 17:00 UTC
**Where**: #monero-research-lab (freenode/matrix)
**Agenda**
1. Greetings
2. Roundtable
a. S…
-
For the last few weeks, I've been thinking about the following question: _How can we find the best linkage threshold using only the similarity matrix?_
I have now realised that this is the wrong ques…
-
Issue raised on https://ask.sagemath.org/question/43496/why-cant-i-find-the-spectral-radius-of-a-tree/
The following instruction will never end
```
sage: g = graphs.CompleteBipartiteGraph(1,3)
sag…
-
I am working with a huge bipartite graph, and the calculation of the projections is computationally very demanding. On the cluster I usually use Networkit, which of course is much more efficient than …