scientific article

Devavrat Shah, Arpita Ghosh, Balaji Prabhakar, Stephen P. Boyd

Publication date: 21 December 2008

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Communication networks in operations research (90B18) Communication theory (94A05)

Related Items

Node and network resistance to bribery in multi-agent systems, Topology selection for multi-agent systems with opposite leaders, Controlling opinions in Deffuant model by reconfiguring the network topology, Broadcasting on paths and cycles, Consensus-based modeling using distributed feature construction with ILP, Fraud and data availability proofs: detecting invalid blocks in light clients, On mixing and edge expansion properties in randomized broadcasting, Distributed resource allocation over random networks based on stochastic approximation, On backward product of stochastic matrices, On robust and optimal imperfect information state equipartitioning for network systems, Distributed parametric and nonparametric regression with on-line performance bounds computation, The total acquisition number of random geometric graphs, Fault-tolerant aggregation: flow-updating meets mass-distribution, Distributed parameter estimation in unreliable sensor networks via broadcast gossip algorithms, Convergence properties of the heterogeneous Deffuant-Weisbuch model, Distributed average consensus via gossip algorithm with real-valued and quantized data for \(0<q<1\), Distributed semistable LQR control for discrete-time dynamically coupled systems, Gossip based asynchronous and randomized distributed task assignment with guaranteed performance on heterogeneous networks, Distributed strategies for generating weight-balanced and doubly stochastic digraphs, Randomised broadcasting: memory vs. randomness, Randomized transmission protocols for protection against jamming attacks in multi-agent consensus, Fast discrete consensus based on gossip for makespan minimization in networked systems, Randomized optimal consensus of multi-agent systems, PageRank computation via a distributed randomized approach with lossy communication, On the mixing time of geographical threshold graphs, On the consensus protocol of conspecific agents, Safe Metropolis-Hastings algorithm and its application to swarm control, An analytical model for multi-epidemic information dissemination, On the uniformity of peer sampling based on view shuffling, Scaling limits for continuous opinion dynamics systems, Markov chain analysis of self-organizing mobile nodes self-organizing mobile nodes, Target containment control of multi-agent systems with random switching interconnection topologies, Improved degree search algorithms in unstructured P2P networks, Phase transitions for detecting latent geometry in random graphs, Distributed consensus over digital networks with limited bandwidth and time-varying topologies, A majorization inequality and its application to distributed Kalman filtering, Quantized consensus in Hamiltonian graphs, Opinion dynamics in social networks with stubborn agents: an issue-based perspective, Multi-stage discrete time and randomized dynamic average consensus, Efficient distributed sensing using adaptive censoring-based inference, Approximate dual averaging method for multiagent saddle-point problems with stochastic subgradients, Average consensus in multiagent systems with the problem of packet losses when using the second-order neighbors' information, Inexact dual averaging method for distributed multi-agent optimization, Convergence of gossip algorithms for consensus in wireless sensor networks with intermittent links and mobile nodes, Streaming techniques and data aggregation in networks of tiny artefacts, Event-triggered control for multiagent systems with the problem of packet losses and communication delays when using the second-order neighbors' information, Asynchronous gossip-based gradient-free method for multiagent optimization, A queueing network-based distributed Laplacian solver for directed graphs, The worst case behavior of randomized gossip protocols, Meeting the deadline: on the complexity of fault-tolerant continuous gossip, Burning the plane. Densities of the infinite Cartesian grid, Optimal distributed linear averaging, Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra, Dobrushin's ergodicity coefficient for Markov operators on cones, Identifying frequent items in a network using gossip, A distributed asynchronous method of multipliers for constrained nonconvex optimization, A queueing network-based distributed Laplacian solver, Convergence rate of the asymmetric Deffuant-Weisbuch dynamics, Polynomial anonymous dynamic distributed computing without a unique leader, Distributed Nash equilibrium seeking in networked graphical games, Tight estimates for convergence of some non-stationary consensus algorithms, Distributed constrained stochastic subgradient algorithms based on random projection and asynchronous broadcast over networks, Stochastic and deterministic fault detection for randomized gossip algorithms, Mitigation of complex behavior over networked systems: analysis of spatially invariant structures, Distributed randomized algorithms for opinion formation, centrality computation and power systems estimation: a tutorial overview, Distributed dual averaging method for multi-agent optimization with quantized communication, Average consensus on general strongly connected digraphs, Faster rumor spreading with multiple calls, LiMoSense: live monitoring in dynamic sensor networks, Consensus-based page's test in sensor networks, Gradient-free method for nonsmooth distributed optimization, Distributed stochastic gradient tracking methods, Triangulated Laman graphs, local stochastic matrices, and limits of their products, Discrete-time dynamic average consensus, Gossip consensus algorithms via quantized communication, Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods, Distributed scheduling of measurements in a sensor network for parameter estimation of spatio-temporal systems, Convergence rate on periodic gossiping, Data collection in population protocols with non-uniformly random scheduler, Interval consensus over random networks, Request-based gossiping without deadlocks, Consensus in asynchronous multiagent systems. I: Asynchronous consensus models, Consensus for first- and second-order discrete-time multi-agent systems with delays based on model predictive control schemes, A zero-gradient-sum algorithm for distributed cooperative learning using a feedforward neural network with random weights, The unit acquisition number of binomial random graphs, Distributed learning of average belief over networks using sequential observations, Gossip over holonomic graphs, Gossip consensus algorithm based on time-varying influence factors and weakly connected graph for opinion evolution in social networks, A Riemannian gossip approach to subspace learning on Grassmann manifold, Opinion dynamics on social networks, Gossip algorithm for multi-agent systems via random walk, Self-triggered and event-triggered set-valued observers, Second-order consensus of hybrid multi-agent systems, Convergence results of a nested decentralized gradient method for non-strongly convex problems, Nonlinear gossip algorithms for wireless sensor networks, Distributed composite optimization for multi-agent systems with asynchrony, Reach almost sure consensus with only group information, Lossy gossip and composition of metrics, Distributed detection of clusters of arbitrary size, Dynamic averaging load balancing on cycles, Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes, Optimal Algorithms for Non-Smooth Distributed Optimization in Networks, The total acquisition number of random graphs, Asynchronous Distributed Algorithms for Heading Consensus of Multi-Agent Systems with Communication Delay, Adaptive Rumor Spreading, The Cost of Fault Tolerance in Multi-Party Communication Complexity, Bounds for algebraic gossip on graphs, Average consensus on networks with quantized communication, Asymptotic Properties of Primal-Dual Algorithm for Distributed Stochastic Optimization over Random Networks with Imperfect Communications, On broadcasting time in the model of travelling agents, Quantized Consensus of Multi-Agent Systems Via Broadcast Gossip Algorithms, Distributed methods for synchronization of orthogonal matrices over graphs, Convergence time of average consensus with heterogeneous random link failures, Asynchronous rumor spreading on random graphs, Event-triggered tracking control for couple-group multi-agent systems, Doubly Stochastic Pairwise Interactions for Agreement and Alignment, On the Push&Pull Protocol for Rumor Spreading, On effective temperature in network models of collective behavior, Find Your Place: Simple Distributed Algorithms for Community Detection, Secure gossip against intermittently malicious agents, An accurate, scalable and verifiable protocol for federated differentially private averaging, Scaled consensus problems of multi agent systems via impulsive protocols, On Synchronous, Asynchronous, and Randomized Best-Response Schemes for Stochastic Nash Games, Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency, Biased opinion dynamics: when the devil is in the details, Linear Time Average Consensus and Distributed Optimization on Fixed Graphs, Multi-agent natural actor-critic reinforcement learning algorithms, Decentralized personalized federated learning: lower bounds and optimal algorithm for all personalization modes, Community structure recovery and interaction probability estimation for gossip opinion dynamics, Design and Analysis of Reset Strategy for Consensus in Networks with Cluster Pattern, Rumor Spreading with No Dependence on Conductance, Asynchronous Optimization over Weakly Coupled Renewal Systems, Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model, Distributed Averaging in Opinion Dynamics, OPINION DIFFUSION ON MULTILAYER SOCIAL NETWORKS, Randomized Rumour Spreading: The Effect of the Network Topology, Unnamed Item, Communication constraints in the average consensus problem, Consensus for Quantum Networks: Symmetry From Gossip Interactions, Order optimal information spreading using algebraic gossip, Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs, Generalised gossip-based subgradient method for distributed optimisation, A graph-theoretic approach on optimizing informed-node selection in multi-agent tracking control, Recent theoretical advances in decentralized distributed convex optimization, Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting, Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems, Near-Optimal Decentralized Algorithms for Saddle Point Problems over Time-Varying Networks, On Mixing and Edge Expansion Properties in Randomized Broadcasting, Asynchronous Schemes for Stochastic and Misspecified Potential Games and Nonconvex Optimization, Eigenvector Computation and Community Detection in Asynchronous Gossip Models, The Pleasure of Gossip, The String of Diamonds Is Tight for Rumor Spreading, Distributed scheduling of sensor networks for identification of spatio-temporal processes, Unnamed Item, Distributed primal–dual stochastic subgradient algorithms for multi‐agent optimization under inequality constraints, An Optimal Algorithm for Decentralized Finite-Sum Optimization, Unnamed Item, Smoothed analysis of dynamic networks, Unnamed Item, Efficient Broadcasting in Random Power Law Networks, Monte Carlo and Las Vegas randomized algorithms for systems and control. An introduction, A first hitting time approach to finding effective spreaders in a network, Discovery Through Gossip, Lyapunov Exponent of Rank-One Matrices: Ergodic Formula and Inapproximability of the Optimal Distribution, Randomized rumor spreading in poorly connected small-world networks, Consensus‐based distributed sensor calibration and least‐square parameter identification in WSNs, The Evolution of Beliefs over Signed Social Networks, Distributed Algorithms for Aggregative Games on Graphs, Dynamics over Signed Networks, Decentralized Time-Constrained Scheduling for Sensor Network in Identification of Distributed Parameter Systems, The string of diamonds is nearly tight for rumour spreading, Robustness of randomized rumour spreading, Average consensus with weighting matrix design for quantized communication on directed switching graphs, Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin, Almost sure exponential convergence to consensus of random gossip algorithms, Polynomial anonymous dynamic distributed computing without a unique leader, Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations, Convergence Analysis of Inexact Randomized Iterative Methods, Unnamed Item, Gradient‐free method for distributed multi‐agent optimization via push‐sum algorithms, Designing linear distributed algorithms with memory for fast convergence, Unnamed Item, Unnamed Item, Decentralized Scheduling of Sensor Networks for Parameter Estimation of Spatio-Temporal Processes, General resilient consensus algorithms, Distributed user profiling via spectral methods, Connectivity threshold of Bluetooth graphs, Optimizing the Diffusion System Based on Continuous-Time Consensus Algorithm, Accelerated Gossip in Networks of Given Dimension Using Jacobi Polynomial Iterations