%A Eyal Castiel
%A Sem Borst
%A Laurent Miclo
%A Florian Simatos
%A Phil Whiting
%J Annals of Applied Probability
%T Induced idleness leads to deterministicheavy traffic limits for queue-basedrandom-access algorithms
%X We examine a queue-based random-access algorithm where ac-tivation and deactivation rates are adapted as functions of queue lengths.We establish its heavy traffic behavior on a complete interference graph,which turns out to be nonstandard in two respects: (1) the scaling dependson some parameter of the algorithm and is not theN/N2scaling usuallyfound  in  functional  central  limit  theorems;  (2)  the  heavy  traffic  limit  isdeterministic. We discuss how this nonstandard behavior arises from theidleness  induced  by  the  distributed  nature  of  the  algorithm.  In  order  toprove our main result, we develop a new method for obtaining a fully cou-pled stochastic averaging principle.
%N n°2
%P 941-971
%V vol. 31
%C Hayward, Cal.
%D 2021
%I Institute of Mathematical Statistics
%R 10.1214/20-AAP1609
%L publications42349