Tuesday, July 28, 2015

Bipartite graphs

Peter turn us on to them. The nodes have two colors and only connect to opposite colored nodes.
One color has more nodes, the other less; so we have a compression expansion, two sets of statistics.  Stack bipartites and you impose connectivity requirements between layers.

The theory of everything says elasticity adjusts to make self adapting statistics. The compression ratios up or down, can be set to some quant that meets a 'settable' Gibbs state, the elements are rational and finite.

An information metrics can find the Hamming like bounds between layers. Bipartitie matters because somewhere, I hope, is a theory that multi-colored sets can be decomposed to  two colored, within some precision.

The Skellam distribution is the distribution of duplicate school girls in those links. The idea of the Hurwitz theorem is to add separate quantum numbers as each Lagrange numbers go up.  So the silver ratio can pack more duplicate school girls in those links nodes. The more duplicates packed, the more accurate.  But the compression ratio, the number of red to blue nodes, goes up.

I think the idea is that a small compression ratio packs the packs links nodes with one or two modes, then those duplicates will not interfere when these graphs are combined in two or more modes (seen as links). A mode is a prime factor in the Poisson arrival rate. That makes those bizarre atomic probability maps.

So what is going on is that the proof that a multi-colored bipartite can be split into a hierarchy of two colors.  I think that proof is also the method of the self adapting statistics use to maintain equipartition. There in lies the relationship between queueing, Hurwitz, and information metrics. A two color graph has a Gibbs state determined by the queues on the connecting links. In that state there is no graph re-configuration that queues up more duplicates.

Something like that.

Dead coins and bot security

The bot relies on a chain of hardware keys, in the cards. Of the entire collection of hardware paths, the vast majority of them are noise, on the chip. Higher security cards cover more of the decode graphs but have frequent key updates.  Consumer card are lower security and less frequent updates.  (These patents are property of the Bot Company. In fact they are part of the McKellar spin theorem,  and Dannica is the bot VP marketing).

Eventually the consumer will leave some dead encrypted coin somewhere on the web, and soon it is undecipherable, because of security. That is not quite like cash. Long buried cash can be rediscovered, dead coin cannot. But, bankers offer a search service to look for and return your dead cash to your bot. What is at stake is, honest bot to bot exchange the new world.

The bot can handle dead cash in the yield curve for any coin, so it may remain a rate zero number on the curve, almost like digital trash. The bot can take gains from that, over time, end eventually empty the trash, because the bot knows the probability distribution of hardware code updates.

The Bot vs Stripe

Business Insider: Stripe sets itself apart from other payments services by being the programmer-friendly backend "plumbing" that enables apps and online stores to take payments from anybody, anywhere.

No, the server is taking payments, the app is doing the client side.

What is banker bot?
Banker bot is a hardware block chained, tamper proof, encrypted, peer to peer, honest digit exchanger.   It is exactly cash, instant cash, and more, it is exactly cash exchanged anywhere;  secure and  counterfeit proof.  It is valuable because bots never defraud bots.

Then the kids at our bot universities made  a maximum likelihood estimator, and it is in your smart card, always estimating on your behalf. The bot is cash plus the singularity. The bot is theory of everything.

The banker coin must be worth a few billion dollars! 

Mish would say: It never needed pilots

Business Insider: The National Transportation Safety Board has finally determined what caused Virgin Galactic's SpaceShipTwo to crash into the Mojave Desert last October.
Pilot error. 

Banker bot could fly that thing much better, safer, and have more fun plus lower testing costs enormously.  Banker bot can learn to fly, in a simulator, with the human pilot safely on the ground.

Monday, July 27, 2015

Betting the numbers with the bot

betting the numbes assumes the winning number is selected at random, so its a useless bat in that it does not collect insider information.  But it is simply a matter of collecting bets and building a Huffman encoder/decoder based on probability. The difference being that the precision of the code if fixed to, say 256 number. When all the bets are in, then a number is selected and decoded. As it descends the decoding tree, losing branches pay up and the winning branches collect. The decode can have fewer bits than the encode, allowing winnings to be shared among a descending branch not taken. Finite precision Huffman coding is a good invention, a good place to start.

Now change the selected number to something like the next GDP NowCast value. Now the encoding and decoding graphs are shaped to accommodate the NowCast belief function, the betting collects inside information.

The Banker Bot market is growing

Business Insider: LONDON (Reuters) - One of the founders of trading venue Chi-X Europe is joining the race to bring "blockchain" technology, the system that tracks and identifies transactions in digital-currency bitcoin, to the wider financial world.
The objective is to allow people to transfer cash or make payments instantaneously without a bank or clearing party being involved, saving on transaction costs.
A venture called SETL, led by former Chi-X head Peter Randall and hedge-fund investor Anthony Culligan, said on Monday its blockchain-inspired technology would simultaneously transact real-world currencies or assets and provide a "golden record" of the trade, which takes days on some financial markets.

There we go, peer to peer exchanges between smart cards.  Security,  in this case, is in the block chain code. All transactions are captured in a block chain, and remembered. If you try and spend the money twice then something blocks you, what? Eventually get caught.

SETL's network would work in the same way as the bitcoin blockchain, generated from each participant's server. The ledger of transactions would be stored on these servers, with encryption, but regulators or auditors would be given access to identify the parties involved.
SETL is not alone. Firms across the finance and technology space have been ramping up efforts to tap the potential of blockchain in overhauling the payment and settlement of financial assets, which currently use central authorities and clearing-houses to track and guarantee transactions.
International Business Machines Corp has been in informal talks about a blockchain-tied cash system with a number of central banks, Reuters reported earlier this year, while Nasdaq OMX last month announced a partnership with blockchain infrastructure provider Chain.

SETL is the name of the company. But they still rely ultimately on server verification and clearing houses.

Block chain has nice properties, it part of the Banker Bot protocol set. But if we have hardware keys, we have essentially block chained the hardware itself, the smart card is hardware tied to a specific security level, and the block chains graphs can actually overlap, putting our smart cards into more than one hardware chain; each hardware chain tamper proof, and all bots verify bot to bot exchanges at the hardware level. One solution to solve them all..  Dannica, our VP of Marketing has this problem solve.

Peter's paper goes path searching

It is about how many characters i a code word need to be changed to get some other code word of the same size.  That is called the Hamming distance. If the allowed Hamming distance is bound, or some Hamming distance dis-allowed, then the trick is to find a partition of code words, by Hamming distance.

In our bot, this means the number of ways in which a bet remains, in the money. So Peter is going to use random graph selection with dependencies, he is looking for the lengths of paths through an encoder and decoder. That is our bot, traversing probability graphs to find the best spot to bet, on our behalf with hones and fairly measured probability graphs.

This is why Peter is the VP software in the bot company and owns 1/12 of banker coins. And this is why CurrencC should join the bot company.

But, anyway, this is where I like the idea of queueing on a graph. The partition of sets is a set of queues on the directed graph. The nodes are the probable outcomes in which the excluded sets have some adaptive variance, elasticity of set interaction is matched, and accumulation up the graph obeys an information metric rule, that guarantees the equipartition. The partition sizes being represented in the finite Skellam distribution.   Because elasticity is adjusted, we get a bubble overlap mechanism, the excluded sets are squeezed out of the graph. So the graph, going up, sorts the sets by hamming distance.  he number of sorts decreasing going up until a node is balanced; that is encode. Decode is the fermion graph, selecting the most probable source code words, going down the graph. But fermion queues are shorter, going down, then boson queues are going up. So, change the Elasticity ratio in : C^2-S^2 = Elasticity, elasticity rational. This is the effect of squeexing the hyperbolic angle, but the Skellam variance changes as set size increases, as does the information metric. In the match, we get various combination of school girls sizes. But they are hierarchical, as in the Hurwitz. Irrational number theorem.  Set the elasticity to the first Lagrange, get a set of queues, then recombine decompose those queues with the second Lagrange. I think. But the solution is there, that is the link to number theory.

I think, but I will think better after finishing the paper.

California's world wide health care buisiness is booming

Cal Watch: Although California officials insisted that expanding Medi-Cal coverage has been an economic boon, critics and Sacramento Republicans warned that the program’s staggering growth has created a costly, nettlesome problem for a state already strapped with challenges.
The Golden State has seen more than triple the expected enrollment under the Obamacare-authorized expansion of Medicaid, a surge of over 2 million. “Beyond that,” the Associated Press reported, “a record number of people who already qualified for the low-income health program signed up, pushing overall enrollment in the state’s Medicaid program known as Medi-Cal past 12 million to roughly 1 in 3 Californians.”
The boom has kicked costs up by nearly $24 billion. And though the federal government has picked up a big chunk of the additional tab, tax increases have already been put on the table. “California will see costs continue to grow as the federal government reduces its matching rate,” California Healthline cautioned.

The cost struggle

While legislators have crunched the numbers, regulators have labored to understand just how poorly the new health care regime matches up with the demand it has created. In an effort to control costs, California “has relied heavily on managed care insurance companies,” the San Francisco Chronicle noted in a report on the state’s struggles to come with Medi-Cal demand. Under the current approach, California “pays insurers a fixed amount per patient and expects the companies to provide access to doctors and comprehensive care, rather than paying for each medical visit or procedure under a fee-for-service model.”

Well, good thing the Swamp is paying us the $24 billion, or make the $240 billion nationwide.  The Swamp is facing a run of inflated prices on its Obamacare payouts, taxes won't keep up.  Its election time and which politician is going to allow another 20% increase in debt/GDP ratio? The Swamp is getting a quick slowdown on tax collections soon.

Smart Card to Smart Phone interface

Most people use a wet wad of bubble gum on the back of their smart phones. The smart card attaches right on. The smart card appears like a restricted memory to the smart phone. You can change the smart card balances, but you will need to tap in your personal tap code, thus the exchange is always bot to bot, it will tunnel through the smart phone.

So the smart phone is useful, but the owner can also tap his card on the home PC, or tap the wall where smart vault is buried.

You don't scare me Peter Keevash

Abstract: We give a new proof of the Frankl-Rodl theorem on forbidden intersections, via the probabilistic method of dependent random choice. Our method extends to codes with forbidden distances, where over large alphabets our bound is significantly better than that obtained by Frankl and Rodl. We also apply our bound to a question of Ellis on sets of permutations with forbidden distances, and to establish a weak form of a conjecture of Alon, Shpilka and Umans on sun flowers.
This is Peter's work, along with Long, co author.  We learn about sets of school girls who, each in set pairs, exclude one unique set. Peter gets a better bound on the number of sets in this family of sets.  This is going to be fun.  Its like asking how much net do I need to catch roller coaster passengers being flung.

Schoolgirls, they are everywhere these days. Now, as we read this and have fun, Banker Coin goes up in value (Peter owns 1/12 of the coin). Peter makes us much more comfortable about banker bot.

Peter's Plot:
The bot is weaving a web of safety nets along our journey's path. So, our smart card light goes yellow when we make a lousy bet on the number of school girls.  Thus our SmartCards are more fun, and trustable. We are going to have fun.

How would I do this?
A queuing problem on a finite graph, without loops.  I know that local node properties have to obey this l-avoiding problem. So I have a restriction on two colliding Poisson, at stability. I apply the information metric to my Skellam distribution, after hiring a professional mathematician. My information metric gives me a relationship between information efficiency and variance on that Skellam. My solution minimizes the second derivative on that compression ratio between set sizes on my schoolgirls. No I know there is a relationship between equipartition and kinetic energy, so I got self adapted statistics, and I have to find a bounded path for variance on a finite graph.

So, our bot just helps the owner avoid long waits in line. Literally, we will find this to be true. We get that red light, long wait, warning. And, that bot computes with the largest, most accurate and secure collection of information available.  Peter's students are going to be gazillionares.

The banker interface:
The bank programmer sees his client as a large set of spreadsheets, just like he does now. Except the banker can write a protocol graph which instructs the smart card to perform spread rebalances in real time as purchases are made.  Bankers will literally be in the business of writing central banker rules, specific to their client groups.