Marija Rašajski
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Marija Rašajski has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Branko Malesevic
School of Electrical Engineering, University of Belgrade, Bulevar kralja Aleksandra 73, 11000 Belgrade, Serbia
7 shared publications - Tatjana Lutovac
School of Electrical Engineering, University of Belgrade, Bulevar kralja Aleksandra 73, 11000 Belgrade, Serbia
7 shared publications Z. Radosavljević
Faculty of Electrical Engineering, University of Belgrade, Belgrade, Serbia
3 shared publicationsB. Mihailović
Faculty of Electrical Engineering, University of Belgrade, Belgrade, Serbia
2 shared publications- Nataša Pržulj
Mohamed bin Zayed University of Artificial Intelligence Computational Biology Department Abu Dhabi, 00000, United Arabic Emirates
2 shared publications B. Mihailovic
Faculty of Electrical Engineering, Belgrade
1 shared publication
Latest Publications
- Open Access
- 30 May 2023
- Published by Hacettepe University in Hacettepe Journal of Mathematics and Statistics
- Vol. 52 (3) , 560-571
Convexity and double-sided Taylor's approximations
Using convexity and double-sided Taylor's approximations of functions, we establish new general results in this field which can be used to refine and/or sharp some analytic inequalities in the existing literature.
- 30 May 2023
- Published by Hacettepe University in Hacettepe Journal of Mathematics and Statistics
- Vol. 52 (3) , 560-571
Open AccessConvexity and double-sided Taylor's approximations
Using convexity and double-sided Taylor's approximations of functions, we establish new general results in this field which can be used to refine and/or sharp some analytic inequalities in the existing literature.
- Open Access
Evolution of Cohesion between USA Financial Sector Companies before, during, and Post-Economic Crisis: Complex Networks Approach
Various mathematical frameworks play an essential role in understanding the economic systems and the emergence of crises in them. Understanding the relation between the structure of connections between the system’s constituents and the emergence of a crisis is of great importance. In this paper, we propose a novel method for the inference of economic systems’ structures based on complex networks theory utilizing the time series of prices. Our network is obtained from the correlation matrix between the time series of companies’ prices by imposing a threshold on the values of the correlation coefficients. The optimal value of the threshold is determined by comparing the spectral properties of the threshold network and the correlation matrix. We analyze the community structure of the obtained networks and the relation between communities’ inter and intra-connectivity as indicators of systemic risk. Our results show how an economic system’s behavior is related to its structure and how the crisis is reflected in changes in the structure. We show how regulation and deregulation affect the structure of the system. We demonstrate that our method can identify high systemic risks and measure the impact of the actions taken to increase the system’s stability.
Open AccessEvolution of Cohesion between USA Financial Sector Companies before, during, and Post-Economic Crisis: Complex Networks Approach
Various mathematical frameworks play an essential role in understanding the economic systems and the emergence of crises in them. Understanding the relation between the structure of connections between the system’s constituents and the emergence of a crisis is of great importance. In this paper, we propose a novel method for the inference of economic systems’ structures based on complex networks theory utilizing the time series of prices. Our network is obtained from the correlation matrix between the time series of companies’ prices by imposing a threshold on the values of the correlation coefficients. The optimal value of the threshold is determined by comparing the spectral properties of the threshold network and the correlation matrix. We analyze the community structure of the obtained networks and the relation between communities’ inter and intra-connectivity as indicators of systemic risk. Our results show how an economic system’s behavior is related to its structure and how the crisis is reflected in changes in the structure. We show how regulation and deregulation affect the structure of the system. We demonstrate that our method can identify high systemic risks and measure the impact of the actions taken to increase the system’s stability.
- 5 May 2022
- Published by Springer Nature
- p. 589-608
Generalizations and Improvements of Approximations of Some Analytic Functions: A Survey
- 5 May 2022
- Published by Springer Nature
- p. 589-608
Generalizations and Improvements of Approximations of Some Analytic Functions: A Survey
- Open Access
- 1 January 2020
- Published by National Library of Serbia in Applicable Analysis and Discrete Mathematics
- Vol. 14 (3) , 599-613
Error-functions in double-sided Taylor's approximations
In this paper we introduce the error-functions for one-sided and double-sided Taylor's approximations of real analytic functions. We illustrate the application of error-functions in the process of generalization of one trigonometric inequality.
- 1 January 2020
- Published by National Library of Serbia in Applicable Analysis and Discrete Mathematics
- Vol. 14 (3) , 599-613
Open AccessError-functions in double-sided Taylor's approximations
In this paper we introduce the error-functions for one-sided and double-sided Taylor's approximations of real analytic functions. We illustrate the application of error-functions in the process of generalization of one trigonometric inequality.
- 3 July 2018
- Published by Springer Nature in Results in Mathematics
- Vol. 73 (3) , 100
A New Method for Proving Some Inequalities Related to Several Special Functions
- 3 July 2018
- Published by Springer Nature in Results in Mathematics
- Vol. 73 (3) , 100
A New Method for Proving Some Inequalities Related to Several Special Functions
- 16 May 2018
- Published by International Scientific Research Publications in Journal of Nonlinear Sciences and Applications
- Vol. 11 (7) , 885-893
Sharpening and generalizations of Shafer-Fink and Wilker type inequalities: a new approach
- 16 May 2018
- Published by International Scientific Research Publications in Journal of Nonlinear Sciences and Applications
- Vol. 11 (7) , 885-893
Sharpening and generalizations of Shafer-Fink and Wilker type inequalities: a new approach
- Open Access
A new method for proving some inequalities related to several special functions
In this paper we present a new approach to proving some exponential inequalities involving the sinc function. Power series expansions are used to generate new polynomial inequalities that are sufficient to prove the given exponential inequalities.
Open AccessA new method for proving some inequalities related to several special functions
In this paper we present a new approach to proving some exponential inequalities involving the sinc function. Power series expansions are used to generate new polynomial inequalities that are sufficient to prove the given exponential inequalities.
- Open Access
- 3 November 2017
- Published by Springer Nature in Journal of Inequalities and Applications
- Vol. 2017 (1) , 1-9
Refinements and generalizations of some inequalities of Shafer-Fink’s type for the inverse sine function
In this paper, we give some sharper refinements and generalizations of inequalities related to Shafer-Fink’s inequality for the inverse sine function stated in Theorems 1, 2, and 3 of Bercu (Math. Probl. Eng. 2017: Article ID 9237932, 2017).
- 3 November 2017
- Published by Springer Nature in Journal of Inequalities and Applications
- Vol. 2017 (1) , 1-9
Open AccessRefinements and generalizations of some inequalities of Shafer-Fink’s type for the inverse sine function
In this paper, we give some sharper refinements and generalizations of inequalities related to Shafer-Fink’s inequality for the inverse sine function stated in Theorems 1, 2, and 3 of Bercu (Math. Probl. Eng. 2017: Article ID 9237932, 2017).
- Open Access
- 1 January 2017
- Published by National Library of Serbia in Applicable Analysis and Discrete Mathematics
- Vol. 11 (1) , 148-165
Some graph mappings that preserve the sign of λ2 - r
In this article we deal with the sign of ?2 - r, r > 0, where ?2 is the second largest eigenvalue of (adjacency matrix of) a simple graph and present some methods of determining it for some classes of graphs. The main result is a set of graph mappings that preserve the value of sgn (?2 - r). These mappings induce equivalence relations among involved graphs, thus providing a way to indirectly apply the GRS-theorem (the generalization of so-called RS-theorem) to some GRS-undecidable (or RS-undecidable) graphs. To present possible applications, we revisit some of the previous results for reexive graphs (graphs whose second largest eigenvalue does not exceed 2). We show how maximal reexive graphs that belong to various families depending on their cyclic structure, can be reduced to RS-decidable graphs in terms of corresponding equivalence relations.
- 1 January 2017
- Published by National Library of Serbia in Applicable Analysis and Discrete Mathematics
- Vol. 11 (1) , 148-165
Open AccessSome graph mappings that preserve the sign of λ2 - r
In this article we deal with the sign of ?2 - r, r > 0, where ?2 is the second largest eigenvalue of (adjacency matrix of) a simple graph and present some methods of determining it for some classes of graphs. The main result is a set of graph mappings that preserve the value of sgn (?2 - r). These mappings induce equivalence relations among involved graphs, thus providing a way to indirectly apply the GRS-theorem (the generalization of so-called RS-theorem) to some GRS-undecidable (or RS-undecidable) graphs. To present possible applications, we revisit some of the previous results for reexive graphs (graphs whose second largest eigenvalue does not exceed 2). We show how maximal reexive graphs that belong to various families depending on their cyclic structure, can be reduced to RS-decidable graphs in terms of corresponding equivalence relations.
- Open Access
- 1 January 2016
- Published by National Library of Serbia in Applicable Analysis and Discrete Mathematics
- Vol. 10 (2) , 552-568
Reflexive cacti: A survey
A graph is called reexive if its second largest eigenvalue does not exceed 2. We survey the results on reexive cacti obtained in the last two decades. We also discuss various patterns of appearing of Smith graphs as subgraphs of reexive cacti. In the Appendix, we survey the recent results concerning reexive bipartite regular graphs.
- 1 January 2016
- Published by National Library of Serbia in Applicable Analysis and Discrete Mathematics
- Vol. 10 (2) , 552-568
Open AccessReflexive cacti: A survey
A graph is called reexive if its second largest eigenvalue does not exceed 2. We survey the results on reexive cacti obtained in the last two decades. We also discuss various patterns of appearing of Smith graphs as subgraphs of reexive cacti. In the Appendix, we survey the recent results concerning reexive bipartite regular graphs.