Skip to main content
SpringerLink
Log in

A cyclic representation of discrete coordination procedures

  • Notes, Chronicles, Information
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

We show that any discrete opinion pooling procedure with positive weights can be asymptotically approximated by DeGroot’s procedure whose communication digraph is a Hamiltonian cycle with loops. In this cycle, the weight of each arc (which is not a loop) is inversely proportional to the influence of the agent the arc leads to.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. DeGroot, M.H., Reaching a Consensus, J. Am. Stat. Ass., 1974, vol. 69, pp. 118–121.

    Article  MATH  Google Scholar 

  2. Agaev, R.P. and Chebotarev, P.Yu., The ProjectionMethod for Reaching Consensus and the Regularized Power Limit of a Stochastic Matrix, Autom. Remote Control, 2011, vol. 72, no. 12, pp. 2458–2476.

    Article  MathSciNet  Google Scholar 

  3. Tutte, W.T., Graph Theory, Reading: Addison-Wesley, 1984. Translated under the title Teoriya grafov, Moscow: Mir, 1988.

    MATH  Google Scholar 

  4. Chebotarev, P. and Agaev, R., Forest Matrices Around the Laplacian Matrix, Linear Algebra Appl., 2002, vol. 356, pp. 253–274.

    MATH  MathSciNet  Google Scholar 

  5. Wentzell, A.D. and Freidlin, M.I., On Small Random Perturbations of Dynamical Systems, Russ. Math. Surveys, 1970, vol. 25, no. 1, pp. 1–55.

    Article  Google Scholar 

  6. Agaev, R.P. and Chebotarev, P.Yu., The Matrix of Maximum Out Forests of a Digraph and Its Applications, Autom. Remote Control, 2000, vol. 61, no. 9, pp. 1424–1450.

    MATH  MathSciNet  Google Scholar 

  7. Jackson, M.O., Social and Economic Networks, Princeton: Princeton Univ. Press, 2008.

    MATH  Google Scholar 

  8. Agaev, R.P. and Chebotarev, P.Yu., Convergence and Stability in Consensus and Coordination Problems (A Survey of Basic Results), Upravlen. Bol’shimi Sist., 2010, vol. 30, no. 1, pp. 470–505.

    Google Scholar 

  9. Gilardoni, G.L. and Clayton, M.K., On Reaching a Consensus Using DeGroot’s Iterative Pooling, Ann. Stat., 1993, vol. 21, pp. 391–401.

    Article  MATH  MathSciNet  Google Scholar 

  10. Barabanov, I.N., Korgin, N.A., Novikov, D.A. and Chkhartishvili, A.G., Dynamic Models of Informational Control in Social Networks, Autom. Remote Control, 2010, vol. 71, no. 11, pp. 2417–2426.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia

    R. P. Agaev & P. Yu. Chebotarev

Authors
  1. R. P. Agaev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Yu. Chebotarev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © R.P. Agaev, P.Yu. Chebotarev, 2012, published in Avtomatika i Telemekhanika, 2012, No. 1, pp. 178–183.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Agaev, R.P., Chebotarev, P.Y. A cyclic representation of discrete coordination procedures. Autom Remote Control 73, 161–166 (2012). https://doi.org/10.1134/S0005117912010134

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117912010134

Keywords

Search

Navigation