I'm excited to share our new paper w/ @mungowitz and @m_zavlanos introducing a decentralized mechanism for pricing and exchanging alternatives constrained by transaction costs: a thread 🧵 1/n
Our decentralized model is based on max-plus (linear) algebra, a branch of tropical 🌴 geometry. The recipe is simple: times <- plus, plus <- max. Max-plus algebra reinvents linear algebra with varying degrees of success, e.g. eigenvalues, linear systems, regression... 2/n
We use max-plus algebra to model the effective value of alternatives (e.g. goods, even opinions 🤔), taking transaction costs with neighbors in a trade network into account. This results in the data of a max-plus matrix-weighted graph. 3/n
(For the mathematician in the room, this data is REALLY a cellular sheaf over the trading network valued in the category of semimodules over the max-plus semiring. But if you don’t know what any of this means, it’s okay, it’s not even in the paper!) 4/n
The mathematical contribution of our paper is a characterization of the time-invariant solutions of a heat equation involving a weighted Tarski Laplacian. We also study the algebraic properties of the solution sets and the convergence behavior of the dynamical system. 5/n
Our contribution to the economics literature is theoretical evidence that differences in a) competitive equilibrium, b) bargaining, or c) cost-benefit analysis are due to differences in the way that transaction costs are incorporated into the decision-making process. 6/n
We also presented numerical simulations of the synchronization algorithm (we call it…RRAggU 🍝), demonstrating promising convergence behavior and providing support for the theoretical framework developed in the paper. 7/n
what is a Laplacian? in the discrete domain where data is assigned to nodes of a network, maybe it's best defined as an operator that drives harmonic flow. in this video, nodes pass messages to neighbors, update their priors, and eventually reach consensus on their color.
the graph Laplacian is an example of a network Laplacian that drives consensus dynamics. in fact, nodes come to agree on a color that is the average of all the initial colors.
while the graph Laplacian is a good choice for "smoothing" vector-valued data in a homogeneous way, there are other choices of Laplacians for data that is, for instance, logical, relational or fuzzy in nature.
fake news? i probably wouldn't be a mathematician (in training) if it wasn't for my extremely flexible public school system. i moved catholic school to a public elem. so that i could take advanced math. my high school @BHSNCougars even allowed me to take courses at @IndianaUniv
even before i had a drivers liscence or a car, i would take a circuitous bus route to indiana u's campus from the high school. call me selfish/privileged. maybe i don't really fully understand or appreciate equity,
but i understand that i was fortunate to have the opportunity to be exposed to higher level mathematical ideas at an early age & for me at least it took many many experiences seeing the same mathematical ideas to even begin to fully appreciate them.
new preprint out with yiannis kantaros, @pappasg69 & @robertghrist that could be a game-changer when it come to information propagation over networks subject to semantic (read: logical) constraints arxiv.org/pdf/2009.00669…
the problem the paper solves is a connectivity scheduling one, but this is only the beginning. consider a network (as pictured) of static sensors (w/ communication capabilities) that are continuously collecting information about their environment.
nodes of the network take measurements and pass them onto their neighbors (within radius r). sensors must coordinate when they can transmit with other sensors in range so that they avoid clutter, collisions, confusion etc.
in honor of april showers, i give you a proximity radius filtration of a *sensor* network of @NEXRADROC weather radar stations (data provided by @NWS)
tracking births and deaths of connected components of the corresponding clique complex of the filtration above does not tell much besides that the network is connected ~300km proximity radius which is somewhat higher than the typical NEXRAD range ~230km.
in degree 1--*think holes*--more interesting features appear.
significantly large holes in radar coverage appear and eventually disappear in various intervals of proximity range. for actually range (~230km), there are 8 such holes