activity
20202026
most citedRandom Coordinate Descent for Resource Allocation in Open Multi-Agent Systems

4 citations · 4 across the 11 of their papers we have counts for

collaborators

15 papers

math.OC2026

Identification of Nonlinear Acyclic Networks in Continuous Time from Nonzero Initial Conditions and Full Excitations

Ramachandran Anantharaman, Renato Vizuete, Julien M. Hendrickx +1

This paper addresses the identifiability and identification of nonlinear acyclic networks in continuous time when the dynamics are located on the edges and all the nodes are excite…

math.OC2025

Path-Based Conditions for the Identifiability of Non-additive Nonlinear Networks with Full Measurements

Renato Vizuete, Julien M. Hendrickx

We analyze the identifiability of nonlinear networks with non necessarily additive node dynamics, where the influence of in-neighbors is represented by a multivariate nonlinear fun…

eess.SY2025

Consensus on Open Multi-Agent Systems Over Graphs Sampled from Graphons

Renato Vizuete, Julien M. Hendrickx

We show how graphons can be used to model and analyze open multi-agent systems, which are multi-agent systems subject to arrivals and departures, in the specific case of linear con…

math.OC2024

Nonlinear identifiability of directed acyclic graphs with partial excitation and measurement

Renato Vizuete, Julien M. Hendrickx

We analyze the identifiability of directed acyclic graphs in the case of partial excitation and measurement. We consider an additive model where the nonlinear functions located in…

math.OC2024

Corrections to and improvements on results from "The Laplacian spectrum of large graphs sampled from graphons"

Federica Garin, Paolo Frasca, Renato Vizuete

In this note we correct the proof of Proposition 4 in our paper "The Laplacian Spectrum of Large Graphs Sampled from Graphons" (arXiv:2004.09177) and we improve several results the…

math.OC2024

Nonlinear Network Identifiability with Full Excitations

Renato Vizuete, Julien M. Hendrickx

We derive conditions for the identifiability of nonlinear networks characterized by additive dynamics at the level of the edges when all the nodes are excited. In contrast to linea…

eess.SY2024

SIS epidemics on open networks: A replacement-based approximation

Renato Vizuete, Paolo Frasca, Elena Panteley

In this paper we analyze continuous-time SIS epidemics subject to arrivals and departures of agents, by using an approximated process based on replacements. In defining the SIS dyn…

math.OC2023

Nonlinear network identifiability: The static case

Renato Vizuete, Julien M. Hendrickx

We analyze the problem of network identifiability with nonlinear functions associated with the edges. We consider a static model for the output of each node and by assuming a perfe…

eess.SY2023

On Lyapunov functions for open Hegselmann-Krause dynamics

Renato Vizuete, Paolo Frasca, Elena Panteley

In this paper, we provide a formulation of an open Hegselmann-Krause (HK) dynamics where agents can join and leave the system during the interactions. We consider a stochastic fram…

cs.MA2022

Resource allocation in open multi-agent systems: an online optimization analysis

Renato Vizuete, Charles Monnoyer de Galland, Julien M. Hendrickx +2

The resource allocation problem consists of the optimal distribution of a budget between agents in a group. We consider such a problem in the context of open systems, where agents…

cs.MA2022★ 4 cited

Random Coordinate Descent for Resource Allocation in Open Multi-Agent Systems

Charles Monnoyer de Galland, Renato Vizuete, Julien M. Hendrickx +2

We propose a method for analyzing the distributed random coordinate descent algorithm for solving separable resource allocation problems in the context of an open multiagent system…

cs.MA2021

Random coordinate descent algorithm for open multi-agent systems with complete topology and homogeneous agents

Charles Monnoyer de Galland, Renato Vizuete, Julien M. Hendrickx +2

We study the convergence in expectation of the Random Coordinate Descent algorithm (RCD) for solving optimal resource allocations problems in open multi-agent systems, i.e., multi-…

eess.SY2020

On the Influence of Noise in Randomized Consensus Algorithms

Renato Vizuete, Paolo Frasca, Elena Panteley

In this paper we study the influence of additive noise in randomized consensus algorithms. Assuming that the update matrices are symmetric, we derive a closed form expression for t…

math.PR2020

The Laplacian Spectrum of Large Graphs Sampled from Graphons

Renato Vizuete, Federica Garin, Paolo Frasca

This paper studies the Laplacian spectrum and the average effective resistance of (large) graphs that are sampled from graphons. Broadly speaking, our main finding is that the Lapl…

eess.SY2020

Graphon-based sensitivity analysis of SIS epidemics

Renato Vizuete, Paolo Frasca, Federica Garin

In this work, we use the spectral properties of graphons to study stability and sensitivity to noise of deterministic SIS epidemics over large networks. We consider the presence of…