P
Paolo Frasca
Researcher at University of Grenoble
Publications - 169
Citations - 3586
Paolo Frasca is an academic researcher from University of Grenoble. The author has contributed to research in topics: Distributed algorithm & Graph (abstract data type). The author has an hindex of 27, co-authored 157 publications receiving 3047 citations. Previous affiliations of Paolo Frasca include Polytechnic University of Turin & Centre national de la recherche scientifique.
Papers
More filters
Journal ArticleDOI
Discontinuities and hysteresis in quantized average consensus
TL;DR: In this paper, the authors consider continuous-time average consensus dynamics in which the agents' states are communicated through uniform quantizers and prove that solutions to the resulting system are defined in the Krasowskii sense and converge to conditions of practical consensus.
Journal ArticleDOI
Average consensus on networks with quantized communication
TL;DR: A simple and effective adaptation is proposed that is able to preserve the average of states and to drive the system near to the consensus value, when a uniform quantization is applied to communication between agents.
Journal ArticleDOI
Gossip consensus algorithms via quantized communication
TL;DR: In this paper, a set of algorithms based on pairwise ''gossip'' communications and updates is proposed to solve the average consensus problem on a network of digital links, and the convergence properties of such algorithms with the goal of answering two design questions, arising from the literature.
Posted Content
Gossip consensus algorithms via quantized communication
TL;DR: This paper considers the average consensus problem on a network of digital links, and proposes a set of algorithms based on pairwise ''gossip'' communications and updates, which study the convergence properties of such algorithms with the goal of answering two design questions.
Journal ArticleDOI
Ergodic Randomized Algorithms and Dynamics Over Networks
TL;DR: In this paper, the authors show that the oscillations are ergodic if the expected dynamics is stable, and they apply this result to three problems of network systems, namely, the estimation from relative measurements, the PageRank computation, and the dynamics of opinions in social networks.