Discovering Maximum Bisimilarity in Graphs: A Scientific Inquiry

  • Thread starter Thread starter XodoX
  • Start date Start date
XodoX
Messages
195
Reaction score
0
When you have a graph like this one here:

https://www.dropbox.com/s/tchpodpt2gp1huf/Bisimulation.jpg

Of course you find bisimilar points/paths. There must be two points or path that have the "greatest" bisimilarity of all. Is this not correct ? And if you have that kind of bisimilarity, how do you find it among all the paths ?
In other words, where is the pair that is more bisimilar than all the others?
 
Physics news on Phys.org
I'm sorry you are not generating any responses at the moment. Is there any additional information you can share with us? Any new findings?
 
Namaste & G'day Postulate: A strongly-knit team wins on average over a less knit one Fundamentals: - Two teams face off with 4 players each - A polo team consists of players that each have assigned to them a measure of their ability (called a "Handicap" - 10 is highest, -2 lowest) I attempted to measure close-knitness of a team in terms of standard deviation (SD) of handicaps of the players. Failure: It turns out that, more often than, a team with a higher SD wins. In my language, that...
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Back
Top