MAX-plus objects to study the complexity of graphs

DOI10.1007/s11009-012-9311-xzbMath1303.05104arXiv1111.1352OpenAlexW2022875037MaRDI QIDQ479164

Luca Chiantini, Fabio Rapallo, Cristiano Bocci

Publication date: 5 December 2014

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.1352

zbMATH Keywords

matchingscomplement graphrandom permutationscombinatorial central limit theorem

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Density (toughness, etc.) (05C42)

Uses Software

• Maple
• R

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries
• Matching behaviour is asymptotically normal
• Statistical equilibrium wealth distributions in an exchange economy with stochastic preferences.
• Statistical mechanics of complex networks
• Graph Theory and Economic Models: from Small to Large Size Applications
• The number of graphs and a random graph with a given degree sequence
• Contributions to Central Limit Theory for Dependent Variables
• A Combinatorial Central Limit Theorem
• A normal law for matchings