We have two (sometimes three) queues we want matched. We order both queues in run time as a generating graph, then match their structure by inserting the mis-match collector (pit boss, market maker). Once both queues are order and conformal, then take one and exchange nodes for edges and edges for nodes,it will overlay the other and create a two colored graph, if I am imagining it right.
What was Ramsey Theory?
A typical result in Ramsey theory starts with some mathematical structure that is then cut into pieces. How big must the original structure be in order to ensure that at least one of the pieces has a given interesting property? This idea can be defined as partition regularity.For example, consider a complete graph of order n; that is, there are n vertices and each vertex is connected to every other vertex by an edge. A complete graph of order 3 is called a triangle. Now colour every edge red or blue. How large must n be in order to ensure that there is either a blue triangle or a red triangle? It turns out that the answer is 6. See the article on Ramsey's theorem for a rigorous proof.
Ramsey theory says no redundant nodes, no nodes of the same color touching, as. It is still managed as a queueing problem.
How must the graph be colored such that flow over the graph results in stable, optimal queues. So some Ramsey proofs can use our methods, show that a colored graph can be generated by matching, within a bound error, one or more maximum entropy generators.
It leads to forensics, we can observe unstable match inefficiencies grow, in the bit error process. Instability indicating someone is faking it, likely money laundering. That is, we find a bit error function that could not be generating a fair Ramsey partition, and thus must not be fair traded in the sandbox.
No comments:
Post a Comment