activity
20102026
most citedOn Ergodicity, Infinite Flow and Consensus in Random Models

96 citations · 174 across the 32 of their papers we have counts for

collaborators
Showing math.OCShow all

24 papers · 1 filter

math.OC2026

Heterogeneous Hegselmann-Krause Dynamics Need Not Converge

S. Rasoul Etesami, Behrouz Touri

We give a six-agent counterexample to convergence of scalar heterogeneous Hegselmann--Krause dynamics.

math.OC2026

Convex and Non-convex Federated Learning with Stale Stochastic Gradients: Diminishing Step Size is All You Need

Xinran Zheng, Tara Javidi, Behrouz Touri

We propose a general framework for distributed stochastic optimization under delayed gradient models. In this setting, local agents leverage their own data and computation to a…

math.OC2025

Multi-Agent Fact Checking

Ashwin Verma, Soheil Mohajer, Behrouz Touri

We formulate the problem of fake news detection using distributed fact-checkers (agents) with unknown reliability. The stream of news/statements is modeled as an independent and id…

math.OC2024★ 2 cited

Zeroth-Order Non-Convex Optimization for Cooperative Multi-Agent Systems with Diminishing Step Size and Smoothing Radius

Xinran Zheng, Tara Javidi, Behrouz Touri

We study a class of zeroth-order distributed optimization problems, where each agent can control a partial vector and observe a local cost that depends on the joint vector of all a…

math.OC2022

A Unified Framework for Continuous-time Unconstrained Distributed Optimization

Behrouz Touri, Bahman Gharesifard

We introduce a class of distributed nonlinear control systems, termed as the flow-tracker dynamics, which capture phenomena where the average state is controlled by the average con…

math.OC2022★ 2 cited

Almost Sure Convergence of Distributed Optimization with Imperfect Information Sharing

Hadi Reisizadeh, Anand Gokhale, Behrouz Touri +1

To design algorithms that reduce communication cost or meet rate constraints and are robust to communication noise, we study convex distributed optimization problems where a set of…

math.OC2022

A Random Adaptation Perspective on Distributed Averaging

Rohit Parasnis, Ashwin Verma, Massimo Franceschetti +1

We propose a random adaptation variant of time-varying distributed averaging dynamics in discrete time. We show that this leads to novel interpretations of fundamental concepts in…

math.OC2022★ 1 cited

Maximal Dissent: a State-Dependent Way to Agree in Distributed Convex Optimization

Ashwin Verma, Marcos M. Vasconcelos, Urbashi Mitra +1

Consider a set of agents collaboratively solving a distributed convex optimization problem, asynchronously, under stringent communication constraints. In such situations, when an a…

math.OC2022★ 1 cited

DIMIX: DIminishing MIXing for Sloppy Agents

Hadi Reisizadeh, Behrouz Touri, Soheil Mohajer

We study non-convex distributed optimization problems where a set of agents collaboratively solve a separable optimization problem that is distributed over a time-varying network.…

math.OC2022★ 1 cited

A Perron-Frobenius Theorem for Strongly Aperiodic Stochastic Chains

Rohit Parasnis, Massimo Franceschetti, Behrouz Touri

We derive a generalization of the Perron-Frobenius theorem to time-varying row-stochastic matrices as follows: using Kolmogorov's concept of absolute probability sequences, which a…

math.OC2022★ 2 cited

Usefulness of the Age-Structured SIR Dynamics in Modelling COVID-19

Rohit Parasnis, Ryosuke Kato, Amol Sakhale +2

We examine the age-structured SIR model, a variant of the classical Susceptible-Infected-Recovered (SIR) model of epidemic propagation, in the context of COVID-19. In doing so, we…

math.OC2021

Distributed Optimization over Time-varying Graphs with Imperfect Sharing of Information

Hadi Reisizadeh, Behrouz Touri, Soheil Mohajer

We study strongly convex distributed optimization problems where a set of agents are interested in solving a separable optimization problem collaboratively. In this paper, we propo…

math.OC2020★ 4 cited

Distributed Optimization Over Dependent Random Networks

Adel Aghajan, Behrouz Touri

We study the averaging-based distributed optimization solvers over random networks. We show a general result on the convergence of such schemes using weight-matrices that are row-s…

math.OC2020

Non-Bayesian Social Learning on Random Digraphs with Aperiodically Varying Network Connectivity

Rohit Parasnis, Massimo Franceschetti, Behrouz Touri

We study non-Bayesian social learning on random directed graphs and show that under mild connectivity assumptions, all the agents almost surely learn the true state of the world as…

math.OC2019

On the Convergence Properties of Social Hegselmann-Krause Dynamics

Rohit Parasnis, Massimo Franceschetti, Behrouz Touri

We study the convergence properties of Social Hegselmann-Krause dynamics, a {variant} of the Hegselmann-Krause (HK) model of opinion dynamics where a physical connectivity graph th…

math.OC2018★ 19 cited

Control of Energy Storage in Home Energy Management Systems: Non-Simultaneous Charging and Discharging Guarantees

Kaitlyn Garifi, Kyri Baker, Dane Christensen +1

In this paper we provide non-simultaneous charging and discharging guarantees for a linear energy storage system (ESS) model for a model predictive control (MPC) based home energy…

math.OC2017★ 5 cited

Push-sum on random graphs

Pouya Rezaeinia, Bahman Gharesifard, Tamas Linder +1

In this paper, we study the problem of achieving average consensus over a random time-varying sequence of directed graphs by extending the class of so-called push-sum algorithms to…

math.OC2016★ 2 cited

Almost-Sure Reachability in Stochastic Multi-Mode System

Fabio Somenzi, Behrouz Touri, Ashutosh Trivedi

A constant-rate multi-mode system is a hybrid system that can switch freely among a finite set of modes, and whose dynamics is specified by a finite number of real-valued variables…

math.OC2015

Non-Convex Distributed Optimization

Tatiana Tatarenko, Behrouz Touri

We study distributed non-convex optimization on a time-varying multi-agent network. Each node has access to its own smooth local cost function, and the collective goal is to minimi…

math.OC2015

On a conjecture of Godsil concerning controllable random graphs

Sean O'Rourke, Behrouz Touri

It is conjectured by Godsil that the relative number of controllable graphs compared to the total number of simple graphs on n vertices approaches one as n tends to infinity. We pr…

math.OC2014

On Endogenous Random Consensus and Averaging Dynamics

Behrouz Touri, Cedric Langbort

Motivated by various random variations of Hegselmann-Krause model for opinion dynamics and gossip algorithm in an endogenously changing environment, we propose a general framework…

math.OC2013

Robust Distributed Averaging on Networks with Adversarial Intervention

Ali Khanafer, Behrouz Touri, Tamer Başar

We study the interaction between a network designer and an adversary over a dynamical network. The network consists of nodes performing continuous-time distributed averaging. The g…

math.OC2013★ 1 cited

Robust Distributed Averaging in Networks

Ali Khanafer, Behrouz Touri, Tamer Başar

In this work, we consider two types of adversarial attacks on a network of nodes seeking to reach consensus. The first type involves an adversary that is capable of breaking a spec…

math.OC2010★ 96 cited

On Ergodicity, Infinite Flow and Consensus in Random Models

Behrouz Touri, Angelia Nedi'c

We consider the ergodicity and consensus problem for a discrete-time linear dynamic model driven by random stochastic matrices, which is equivalent to studying these concepts for t…