New answers tagged algorithm
10
This now has been discussed in Wolfram blog post by Michael Trott:
Making Formulas… for Everything—From Pi to the Pink Panther to Sir Isaac Newton
Here is one of the example apps from blog - go read it in full - fun! Don't miss the link to download the notebook with complete code and apps at the end of the blog.
0
I am just sharing my small idea here and someone can correct me if I am wrong somewhere. Computational group theory algorithms are used in mathematical software. Group is never stored as it is in any data structure and actually generated on the run using its generating sets.
Strong generating sets(not exactly simple generating sets) are generated using ...
0
You can use this package to call igraph through RLink. igraph can test the isomoprhism of coloured graphs (either edge or vertex colouring).
Let's build the same graphs that @whuber had:
g = CycleGraph[6]
col1 = {1, 2, 3, 1, 2, 3}
col2 = {2, 1, 3, 2, 1, 3}
col3 = {3, 2, 3, 1, 2, 1}
The three vectors col1, col2 and col3 represent the three colourings.
...
1
First, I am not a specialist on probability theory and random processes! I will try to address your question from the very limited knowledge I got from the Mathematica documentation. The documentation for DiscreteMarkovProcess tells the following
"A discrete Markov process can be seen as a random walk on a graph, where the probability of ...
1
Alternative way to extract vertices:
g = RandomGraph[BarabasiAlbertGraphDistribution[1000, 1]];
d = 5;
Szabolcs suggestion
distances = GraphDistance[g, 300];
set1 = Pick[VertexList[g], distances, d];
using BreadthFirstScan
set2 = Reap[
CheckAbort[
BreadthFirstScan[g, 300, "DiscoverVertex" -> ((If[#3 > 5, Abort[]];
If[#3 == d, Sow[#1]]) ...
2
Start with a graph and a distance d:
g = RandomGraph[BarabasiAlbertGraphDistribution[1000, 1]];
d = 5
Find the distance of a vertex (e.g. vertex 300) to all others:
distances = GraphDistance[g, 300];
Sample k vertices from those with distance d from 300:
RandomSample[
Pick[VertexList[g], distances, d],
k
]
Top 50 recent answers are included
