IDEAS home Printed from https://ideas.repec.org/a/nas/journl/v122y2025pe2423947122.html
   My bibliography  Save this article

The edge-averaging process on graphs with random initial opinions

Author

Listed:
  • Dor Elboim

    (a Department of mathematics , Stanford University , Stanford , CA 94305)

  • Yuval Peres

    (b Beijing Institute of Mathematical Sciences and Applications , Beijing 101408 , China)

  • Ron Peretz

    (c Department of Economics , Bar Ilan University , Ramat Gan 5290002 , Israel)

Abstract

In several settings (e.g., sensor networks and social networks), nodes of a graph are equipped with initial opinions, and the goal is to estimate the average of these opinions using local operations. A natural algorithm to achieve this is the edge-averaging process, where edges are repeatedly selected at random (according to independent Poisson clocks) and the opinions on the nodes of each selected edge are replaced by their average. The effectiveness of this algorithm is determined by its convergence rate. It is known that on a finite graph of n nodes, the opinions reach approximate consensus in polynomial time. We prove that the convergence is much faster when the initial opinions are disordered (independent identically distributed): The time to reach approximate consensus is O ( log 2 n ) , and this bound is sharp. For infinite graphs, we show that for every p ≥ 1 , if the initial opinions are in L p , then the opinion at each vertex converges to the mean in L p , and if p > 4 , then almost sure convergence holds as well.

Suggested Citation

  • Dor Elboim & Yuval Peres & Ron Peretz, 2025. "The edge-averaging process on graphs with random initial opinions," Proceedings of the National Academy of Sciences, Proceedings of the National Academy of Sciences, vol. 122(33), pages 2423947122-, August.
    • Handle: RePEc:nas:journl:v:122:y:2025:p:e2423947122
    DOI: 10.1073/pnas.2423947122
    as

    Download full text from publisher

    File URL: https://doi.org/10.1073/pnas.2423947122
    Download Restriction: no
    File URL: https://libkey.io/10.1073/pnas.2423947122?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:nas:journl:v:122:y:2025:p:e2423947122. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: PNAS Product Team (email available below). General contact details of provider: http://www.pnas.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.