Lossy Gossip and Composition of Metrics

被引:5
|
作者
Brouwer, Andries E. [1 ]
Draisma, Jan [1 ]
Frenk, Bart J. [1 ]
机构
[1] Eindhoven Univ Technol, Dept Math & Comp Sci, NL-5600 MB Eindhoven, Netherlands
关键词
Min-plus matrix multiplication; Finite metrics; Gossip; Tropical algebraic groups; OPTIMAL REALIZATIONS;
D O I
10.1007/s00454-015-9666-1
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We study the monoid generated by distance matrices under tropical (or min-plus) multiplication. Using the tropical geometry of the orthogonal group, we prove that this monoid is a finite polyhedral fan of dimension , and we compute the structure of this fan for up to . The monoid captures gossip among gossipers over lossy phone lines, and contains the gossip monoid over ordinary phone lines as a submonoid. We prove several new results about this submonoid as well. In particular, we establish a sharp bound on chains of calls in each of which someone learns something new.
引用
收藏
页码:890 / 913
页数:24
相关论文
共 50 条
  • [31] GOSSIP
    JAKUBOWICZ, A
    ESPRIT, 1981, (05) : 141 - 145
  • [32] 'Gossip'
    Sadoff, I
    NEW ENGLAND REVIEW-MIDDLEBURY SERIES, 1998, 19 (03): : 71 - 79
  • [33] 'Gossip'
    Morris, D
    CONFRONTATION, 2003, (82-83): : 327 - 329
  • [34] 'GOSSIP'
    GILLIATT, P
    PARIS REVIEW, 1977, (72): : 51 - 51
  • [35] Composition of Saliency Metrics for Pruning with a Myopic Oracle
    Persand, Kaveena
    Anderson, Andrew
    Gregg, David
    2020 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (SSCI), 2020, : 753 - 759
  • [36] Clinical presentation of breast tissue composition metrics
    Kaufhold, J
    Eberhard, JW
    Galbo, CE
    Thomas, JA
    DIGITAL MAMMOGRAPHY, PROCEEDINGS, 2003, : 460 - 462
  • [37] 'GOSSIP'
    KAUFFMAN, J
    ANTAEUS, 1982, (44): : 70 - 73
  • [38] GOSSIP
    SAMPSON, A
    ENCOUNTER, 1959, 13 (06): : 10 - 16
  • [39] Improved Routing Metrics for Energy Constrained Interconnected Devices in Low-Power and Lossy Networks
    Hassan, Ali
    Alshomrani, Saleh
    Altalhi, Abdulrahman
    Ahsan, Syed
    JOURNAL OF COMMUNICATIONS AND NETWORKS, 2016, 18 (03) : 327 - 332
  • [40] Directional gossip: Gossip in a wide area network
    Lin, MJ
    Marzullo, K
    DEPENDABLE COMPUTING - EDCC-3, 1999, 1667 : 364 - 379