Agaev Rafig Pashaevich

Publications in Math-Net.Ru

1. On the boundary value of the time-delay and the asymptotic behavior of a continuous first-order consensus protocol
   
   Avtomat. i Telemekh., 2024, no. 6,  83–96
2. On the properties of orthogonal projection method for reaching consensus
   
   Avtomat. i Telemekh., 2023, no. 5,  3–20
3. On the role of the eigenprojector of the laplacian matrix for reaching consensus in multiagent second-order systems
   
   Avtomat. i Telemekh., 2019, no. 11,  127–139
4. Models of latent consensus
   
   Avtomat. i Telemekh., 2017, no. 1,  106–120
5. The projection method for continuous-time consensus seeking
   
   Avtomat. i Telemekh., 2015, no. 8,  140–152
6. On the asymptotics of consensus protocols
   
   UBS, 43 (2013),  55–77
7. A cyclic representation of discrete coordination procedures
   
   Avtomat. i Telemekh., 2012, no. 1,  178–183
8. The region of convergence of the differential model of consensus
   
   UBS, 36 (2012),  81–92
9. The projection method for reaching consensus and the regularized power limit of a stochastic matrix
   
   Avtomat. i Telemekh., 2011, no. 12,  38–59
10. Discrete consensus convergence procedure via minimal cycle combining strong components
    
    UBS, 34 (2011),  46–61
11. Convergence and stability in consensus and coordination problems (a survey of basic results)
    
    UBS, 30.1 (2010),  470–505
12. Coordination in multiagent systems and Laplacian spectra of digraphs
    
    Avtomat. i Telemekh., 2009, no. 3,  136–151
13. Investigation and application of Laplace spectra of orgraphs with the ring structure
    
    Avtomat. i Telemekh., 2008, no. 2,  3–16
14. On the spectrum of a ring-structured directed graph's adjacency matrix and its application
    
    Probl. Upr., 2008, no. 4,  11–15
15. Laplace spectra of orgraphs and their applications
    
    Avtomat. i Telemekh., 2005, no. 5,  47–62
16. On Determining the Eigenprojection and Components of a Matrix
    
    Avtomat. i Telemekh., 2002, no. 10,  3–12
17. A Characteristic Condition for Simple Partial Ordering Relations
    
    Avtomat. i Telemekh., 2002, no. 2,  172–173
18. Spanning Forests of a Digraph and Their Applications
    
    Avtomat. i Telemekh., 2001, no. 3,  108–133
19. The matrix of maximal outgoing forests of a digraph and its applications
    
    Avtomat. i Telemekh., 2000, no. 9,  15–43
20. Generalized interval choice mechanisms and functions generated by them
    
    Avtomat. i Telemekh., 1993, no. 4,  147–159


21. Addendum to the paper “On determining the eigenprojection and components of a matrix”
    
    Avtomat. i Telemekh., 2011, no. 3,  173