Aleksandar Stamenković
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Aleksandar Stamenković has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Miroslav Ćirić
Faculty of Sciences and Mathematics, University of Niš, Višegradska 33, 18108 Niš, Serbia
6 shared publications - Jelena Ignjatović
Department of Computer Science, Faculty of Sciences and Mathematics, University of Niš, Niš, Serbia
2 shared publications - Milan Bašić
University of Niš Niš Serbia
2 shared publications - Stefan Stanimirović
Univ Nis, Fac Sci & Math, Visegradska 33, Nish 18000, Serbia
2 shared publications - Aleksandar Ilic
Facebook Inc Menlo Park California USA
1 shared publication - Dragan Djurdjanovic
The University of Texas at Austin
1 shared publication
Latest Publications
- Open Access
Analysis of Approximation Methods of Laplacian Eigenvectors of the Kronecker Product of Graphs
This paper analyzes two approximation methods for the Laplacian eigenvectors of the Kronecker product, as recently presented in the literature. We enhance the approximations by comparing the correlation coefficients of the eigenvectors, which indicate how well an arbitrary vector approximates a matrix’s eigenvector. In the first method, some correlation coefficients are explicitly calculable, while others are not. In the second method, only certain coefficients can be estimated with good accuracy, as supported by empirical and theoretical evidence, with the rest remaining incalculable. The primary objective is to evaluate the accuracy of the approximation methods by analyzing and comparing limited sets of coefficients on one hand and the estimation on the other. Therefore, we compute the extreme values of the mentioned sets and theoretically compare them. Our observations indicate that, in most cases, the relationship between the majority of the values in the first set and those in the second set reflects the relationship between the remaining coefficients of both approximations. Moreover, it can be observed that each of the sets generally contains smaller values compared to the values found among the remaining correlation coefficients. Finally, we find that the performance of the two approximation methods is significantly influenced by imbalanced graph structures, exemplified by a class of almost regular graphs discussed in the paper.
Open AccessAnalysis of Approximation Methods of Laplacian Eigenvectors of the Kronecker Product of Graphs
This paper analyzes two approximation methods for the Laplacian eigenvectors of the Kronecker product, as recently presented in the literature. We enhance the approximations by comparing the correlation coefficients of the eigenvectors, which indicate how well an arbitrary vector approximates a matrix’s eigenvector. In the first method, some correlation coefficients are explicitly calculable, while others are not. In the second method, only certain coefficients can be estimated with good accuracy, as supported by empirical and theoretical evidence, with the rest remaining incalculable. The primary objective is to evaluate the accuracy of the approximation methods by analyzing and comparing limited sets of coefficients on one hand and the estimation on the other. Therefore, we compute the extreme values of the mentioned sets and theoretically compare them. Our observations indicate that, in most cases, the relationship between the majority of the values in the first set and those in the second set reflects the relationship between the remaining coefficients of both approximations. Moreover, it can be observed that each of the sets generally contains smaller values compared to the values found among the remaining correlation coefficients. Finally, we find that the performance of the two approximation methods is significantly influenced by imbalanced graph structures, exemplified by a class of almost regular graphs discussed in the paper.
- 2 March 2024
- Published by Springer Nature in Discrete Event Dynamic Systems
- Vol. 34 (2) , 269-295
Simulations and bisimulations for max-plus automata
- 2 March 2024
- Published by Springer Nature in Discrete Event Dynamic Systems
- Vol. 34 (2) , 269-295
Simulations and bisimulations for max-plus automata
- Open Access
Maximal diameter of integral circulant graphs
Integral circulant graphs are proposed as models for quantum spin networks that permit a quantum phenomenon called perfect state transfer. Specifically, it is important to know how far information can potentially be transferred between nodes of the quantum networks modelled by integral circulant graphs and this task is related to calculating the maximal diameter of a graph. The integral circulant graph $ICG_n (D)$ has the vertex set $Z_n = \{0, 1, 2, \ldots, n - 1\}$ and vertices $a$ and $b$ are adjacent if $\gcd(a-b,n)\in D$, where $D \subseteq \{d : d \mid n,\ 1\leq d 1,\ 1\leq i\leq k \}|$, depending on whether $n\not\in 4N+2$ or not, respectively. Furthermore, we show that, for a given order $n$, a divisor set $D$ with $|D|\leq k$ can always be found such that this bound is attained. Finally, we calculate the maximal diameter in the class of integral circulant graphs of a given order $n$ and cardinality of the divisor set $t\leq k$ and characterize all extremal graphs. We actually show that the maximal diameter can have the values $2t$, $2t+1$, $r(n)$ and $r(n)+1$ depending on the values of $t$ and $n$. This way we further improve the upper bound of Saxena, Severini and Shparlinski and we also characterize all graphs whose diameters are equal to $2|D|+1$, thus generalizing a result in that paper.Open AccessMaximal diameter of integral circulant graphs
Integral circulant graphs are proposed as models for quantum spin networks that permit a quantum phenomenon called perfect state transfer. Specifically, it is important to know how far information can potentially be transferred between nodes of the quantum networks modelled by integral circulant graphs and this task is related to calculating the maximal diameter of a graph. The integral circulant graph $ICG_n (D)$ has the vertex set $Z_n = \{0, 1, 2, \ldots, n - 1\}$ and vertices $a$ and $b$ are adjacent if $\gcd(a-b,n)\in D$, where $D \subseteq \{d : d \mid n,\ 1\leq d 1,\ 1\leq i\leq k \}|$, depending on whether $n\not\in 4N+2$ or not, respectively. Furthermore, we show that, for a given order $n$, a divisor set $D$ with $|D|\leq k$ can always be found such that this bound is attained. Finally, we calculate the maximal diameter in the class of integral circulant graphs of a given order $n$ and cardinality of the divisor set $t\leq k$ and characterize all extremal graphs. We actually show that the maximal diameter can have the values $2t$, $2t+1$, $r(n)$ and $r(n)+1$ depending on the values of $t$ and $n$. This way we further improve the upper bound of Saxena, Severini and Shparlinski and we also characterize all graphs whose diameters are equal to $2|D|+1$, thus generalizing a result in that paper. - Open Access
- 1 January 2023
- Published by National Library of Serbia in Filomat
- Vol. 37 (5) , 1341-1365
Positive fuzzy quasi-orders on semigroups
In this paper we study certain types of positive fuzzy quasi-orders on semigroups and their links with completely semiprime fuzzy ideals, completely prime fuzzy ideals, and fuzzy filters. We characterize various properties of a positive fuzzy quasi-order Q in terms of the properties of its left and right eigen spaces IQ and CQ, the solution sets of eigen fuzzy set equations corresponding to Q. We also demonstrate certain applications of the obtained results to semilattice decompositions of semigroups. The results of this paper shed new light on the known links between positive (crisp) quasi-orders, completely semiprime ideals, completely prime ideals, and filters of semigroups, and make these links much clearer.
- 1 January 2023
- Published by National Library of Serbia in Filomat
- Vol. 37 (5) , 1341-1365
Open AccessPositive fuzzy quasi-orders on semigroups
In this paper we study certain types of positive fuzzy quasi-orders on semigroups and their links with completely semiprime fuzzy ideals, completely prime fuzzy ideals, and fuzzy filters. We characterize various properties of a positive fuzzy quasi-order Q in terms of the properties of its left and right eigen spaces IQ and CQ, the solution sets of eigen fuzzy set equations corresponding to Q. We also demonstrate certain applications of the obtained results to semilattice decompositions of semigroups. The results of this paper shed new light on the known links between positive (crisp) quasi-orders, completely semiprime ideals, completely prime ideals, and filters of semigroups, and make these links much clearer.
- Open Access
- 1 January 2022
- Published by National Library of Serbia in Filomat
- Vol. 36 (8) , 2775-2793
Certain linear and weakly linear systems of matrix equations over semirings. Applications in a state reduction of weighted automata
In this paper we study particular linear and weakly linear systems of matrix equations over semirings, with the aim of describing and computing functions as solutions to those systems. Our special attention is devoted to solutions whose ranks are as small as possible. We prove the existence of solutions with the smallest ranks, give their characterizations, and present a method for their computations. Regarding weakly linear systems, the method is based on the well known partition refinement algorithm by Kanellakis and Smolka, adapted to work with weighted labeled transition systems. Moreover, we give a state reduction procedure of weighted automata based on a decomposition of solutions to particular linear and weakly linear systems.
- 1 January 2022
- Published by National Library of Serbia in Filomat
- Vol. 36 (8) , 2775-2793
Open AccessCertain linear and weakly linear systems of matrix equations over semirings. Applications in a state reduction of weighted automata
In this paper we study particular linear and weakly linear systems of matrix equations over semirings, with the aim of describing and computing functions as solutions to those systems. Our special attention is devoted to solutions whose ranks are as small as possible. We prove the existence of solutions with the smallest ranks, give their characterizations, and present a method for their computations. Regarding weakly linear systems, the method is based on the well known partition refinement algorithm by Kanellakis and Smolka, adapted to work with weighted labeled transition systems. Moreover, we give a state reduction procedure of weighted automata based on a decomposition of solutions to particular linear and weakly linear systems.
- 13 September 2021
- Published by Springer Nature in Discrete Event Dynamic Systems
- Vol. 32 (1) , 1-25
Weakly linear systems for matrices over the max-plus quantale
- 13 September 2021
- Published by Springer Nature in Discrete Event Dynamic Systems
- Vol. 32 (1) , 1-25
Weakly linear systems for matrices over the max-plus quantale
- Open Access
- 1 January 2019
- Published by National Library of Serbia in Filomat
- Vol. 33 (9) , 2809-2831
Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application
We define right and left invariant matrices as Boolean matrices that are solutions to certain systems of matrix equations and inequalities over additively idempotent semirings. We provide improved algorithms for computing the greatest right and left invariant equivalence and quasi-order matrices. The improvements are based on the usage of the well-known partition refinement technique. Afterwards, we present the application of right invariant matrices in the determinization of weighted automata over additively idempotent, commutative and zero-divisor free semirings. In particular, we provide improvements of the well-known determinization method of weighted automata over tropical semirings given by Mohri [Computational Linguistics 23 (2) (1997) 269-311].
- 1 January 2019
- Published by National Library of Serbia in Filomat
- Vol. 33 (9) , 2809-2831
Open AccessImproved algorithms for computing the greatest right and left invariant Boolean matrices and their application
We define right and left invariant matrices as Boolean matrices that are solutions to certain systems of matrix equations and inequalities over additively idempotent semirings. We provide improved algorithms for computing the greatest right and left invariant equivalence and quasi-order matrices. The improvements are based on the usage of the well-known partition refinement technique. Afterwards, we present the application of right invariant matrices in the determinization of weighted automata over additively idempotent, commutative and zero-divisor free semirings. In particular, we provide improvements of the well-known determinization method of weighted automata over tropical semirings given by Mohri [Computational Linguistics 23 (2) (1997) 269-311].
- Open Access
Construction of fuzzy automata from fuzzy regular expressions
Li and Pedrycz [Y. M. Li, W. Pedrycz, Fuzzy finite automata and fuzzy regular expressions with membership values in lattice ordered monoids, Fuzzy Sets and Systems 156 (2005) 68--92] have proved fundamental results that provide different equivalent ways to represent fuzzy languages with membership values in a lattice-ordered monoid, and generalize the well-known results of the classical theory of formal languages. In particular, they have shown that a fuzzy language over an integral lattice-ordered monoid can be represented by a fuzzy regular expression if and only if it can be recognized by a fuzzy finite automaton. However, they did not give any effective method for constructing an equivalent fuzzy finite automaton from a given fuzzy regular expression. In this paper we provide such an effective method. Transforming scalars appearing in a fuzzy regular expression {\alpha} into letters of the new extended alphabet, we convert the fuzzy regular expression {\alpha} to an ordinary regular expression {\alpha}_{R}. Then, starting from an arbitrary nondeterministic finite automaton A that recognizes the language ||{\alpha}_R|| represented by the regular expression {\alpha}_R, we construct fuzzy finite automata A_{\alpha} and A_{\alpha}^r with the same or even less number of states than the automaton A, which recognize the fuzzy language ||{\alpha}|| represented by the fuzzy regular expression {\alpha}. The starting nondeterministic finite automaton A can be obtained from {\alpha}_R using any of the well-known constructions for converting regular expressions to nondeterministic finite automata, such as Glushkov-McNaughton-Yamada's position automaton, Brzozowski's derivative automaton, Antimirov's partial derivative automaton, or Ilie-Yu's follow automaton.
Open AccessConstruction of fuzzy automata from fuzzy regular expressions
Li and Pedrycz [Y. M. Li, W. Pedrycz, Fuzzy finite automata and fuzzy regular expressions with membership values in lattice ordered monoids, Fuzzy Sets and Systems 156 (2005) 68--92] have proved fundamental results that provide different equivalent ways to represent fuzzy languages with membership values in a lattice-ordered monoid, and generalize the well-known results of the classical theory of formal languages. In particular, they have shown that a fuzzy language over an integral lattice-ordered monoid can be represented by a fuzzy regular expression if and only if it can be recognized by a fuzzy finite automaton. However, they did not give any effective method for constructing an equivalent fuzzy finite automaton from a given fuzzy regular expression. In this paper we provide such an effective method. Transforming scalars appearing in a fuzzy regular expression {\alpha} into letters of the new extended alphabet, we convert the fuzzy regular expression {\alpha} to an ordinary regular expression {\alpha}_{R}. Then, starting from an arbitrary nondeterministic finite automaton A that recognizes the language ||{\alpha}_R|| represented by the regular expression {\alpha}_R, we construct fuzzy finite automata A_{\alpha} and A_{\alpha}^r with the same or even less number of states than the automaton A, which recognize the fuzzy language ||{\alpha}|| represented by the fuzzy regular expression {\alpha}. The starting nondeterministic finite automaton A can be obtained from {\alpha}_R using any of the well-known constructions for converting regular expressions to nondeterministic finite automata, such as Glushkov-McNaughton-Yamada's position automaton, Brzozowski's derivative automaton, Antimirov's partial derivative automaton, or Ilie-Yu's follow automaton.
- Open Access
Reduction of fuzzy automata by means of fuzzy quasi-orders
In our recent paper we have established close relationships between state reduction of a fuzzy recognizer and resolution of a particular system of fuzzy relation equations. In that paper we have also studied reductions by means of those solutions which are fuzzy equivalences. In this paper we will see that in some cases better reductions can be obtained using the solutions of this system that are fuzzy quasi-orders. Generally, fuzzy quasi-orders and fuzzy equivalences are equally good in the state reduction, but we show that right and left invariant fuzzy quasi-orders give better reductions than right and left invariant fuzzy equivalences. We also show that alternate reductions by means of fuzzy quasi-orders give better results than alternate reductions by means of fuzzy equivalences. Furthermore we study a more general type of fuzzy quasi-orders, weakly right and left invariant ones, and we show that they are closely related to determinization of fuzzy recognizers. We also demonstrate some applications of weakly left invariant fuzzy quasi-orders in conflict analysis of fuzzy discrete event systems.
Open AccessReduction of fuzzy automata by means of fuzzy quasi-orders
In our recent paper we have established close relationships between state reduction of a fuzzy recognizer and resolution of a particular system of fuzzy relation equations. In that paper we have also studied reductions by means of those solutions which are fuzzy equivalences. In this paper we will see that in some cases better reductions can be obtained using the solutions of this system that are fuzzy quasi-orders. Generally, fuzzy quasi-orders and fuzzy equivalences are equally good in the state reduction, but we show that right and left invariant fuzzy quasi-orders give better reductions than right and left invariant fuzzy equivalences. We also show that alternate reductions by means of fuzzy quasi-orders give better results than alternate reductions by means of fuzzy equivalences. Furthermore we study a more general type of fuzzy quasi-orders, weakly right and left invariant ones, and we show that they are closely related to determinization of fuzzy recognizers. We also demonstrate some applications of weakly left invariant fuzzy quasi-orders in conflict analysis of fuzzy discrete event systems.