LiFE-CD computes the full probability distribution of convergence time for max-consensus over networks with Bernoulli link failures, exactly for acyclic graphs and with tight bounds for cyclic ones via spanning tree reduction.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
eess.SP 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
New candidate-ranking tone injection algorithms for OFDM and AFDM deliver more than 1 dB PAPR gain over baselines at FFT-comparable complexity.
citing papers explorer
-
Convergence Time Distributions for Max-Consensus over Unreliable Networks
LiFE-CD computes the full probability distribution of convergence time for max-consensus over networks with Bernoulli link failures, exactly for acyclic graphs and with tight bounds for cyclic ones via spanning tree reduction.
-
Low-Complexity Tone Injection via Candidate Ranking for PAPR Reduction in OFDM and AFDM Systems
New candidate-ranking tone injection algorithms for OFDM and AFDM deliver more than 1 dB PAPR gain over baselines at FFT-comparable complexity.