Max-plus objects to study the complexity of graphs
Probability
2011-11-09 v2 Combinatorics
Abstract
Given an undirected graph , we define a new object , called the mp-chart of , in the max-plus algebra. We use it, together with the max-plus permanent, to describe the complexity of graphs. We show how to compute the mean and the variance of in terms of the adjacency matrix of and we give a central limit theorem for . Finally, we show that the mp-chart is easily tractable also for the complement graph.
Cite
@article{arxiv.1111.1352,
title = {Max-plus objects to study the complexity of graphs},
author = {Cristiano Bocci and Luca Chiantini and Fabio Rapallo},
journal= {arXiv preprint arXiv:1111.1352},
year = {2011}
}
Comments
16 pages, 7 figures. 2 figures were not displayed properly in the first version