mdh.sePublications
Change search
Refine search result
1234 1 - 50 of 189
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Abola, Benard
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics. Department of Mathematics, School of Physical Sciences, Makerere University, Kampala, Uganda.
    Biganda, Pitos
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics. Department of Mathematics, College of Natural and Applied Sciences, University of Dar es Salaam,Tanzania.
    Engström, Christopher
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Mango, J. M.
    Department of Mathematics, School of Physical Sciences, Makerere University, Kampala, Uganda.
    Kakuba, G.
    Department of Mathematics, School of Physical Sciences, Makerere University, Kampala, Uganda.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    PageRank in evolving tree graphs2018In: Stochastic Processes and Applications: SPAS2017, Västerås and Stockholm, Sweden, October 4-6, 2017 / [ed] Sergei Silvestrov, Anatoliy Malyarenko, Milica Rančić, Springer, 2018, Vol. 271, p. 375-390Chapter in book (Refereed)
    Abstract [en]

    In this article, we study how PageRank can be updated in an evolving tree graph. We are interested in finding how ranks of the graph can be updated simultaneously and effectively using previous ranks without resorting to iterative methods such as the Jacobi or Power method. We demonstrate and discuss how PageRank can be updated when a leaf is added to a tree, at least one leaf is added to a vertex with at least one outgoing edge, an edge added to vertices at the same level and forward edge is added in a tree graph. The results of this paper provide new insights and applications of standard partitioning of vertices of the graph into levels using breadth-first search algorithm. Then, one determines PageRanks as the expected numbers of random walk starting from any vertex in the graph. We noted that time complexity of the proposed method is linear, which is quite good. Also, it is important to point out that the types of vertex play essential role in updating of PageRank.

  • 2. Abramov, V.
    et al.
    Paal, E.Tallinn University of Technology.Silvestrov, Sergei D.Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.Stolin, A.Chalmers University of Techology.
    Proceedings of the 3rd Baltic-Nordic Workshop “Algebra, Geometry, and Mathematical Physics”2008Conference proceedings (editor) (Refereed)
  • 3. Abramov, Viktor
    et al.
    Paal, Eugen
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication.
    Stolin, Alexander
    Preface [Special issue devoted to the 4th Baltic-Nordic Workshop “Algebra, Geometry and Mathematical Physics”]2010In: Proceedings of the Estonian Academy of Sciences, ISSN 1736-6046, E-ISSN 1736-7530, Vol. 59, no 4Article in journal (Refereed)
  • 4.
    Ammar, F.
    et al.
    Faculté des Sciences, Université de Sfax, Tunisia .
    Makhlouf, A.
    Université de Haute Alsace, France .
    Silvestrov, S. D.
    Lund University.
    Ternary q-Virasoro-Witt Hom-Nambu-Lie algebras2010In: Journal of Physics A: Mathematical and Theoretical, ISSN 1751-8113, E-ISSN 1751-8121, Vol. 43, no 26, p. 265204-Article in journal (Refereed)
    Abstract [en]

    In this paper we construct ternary q-Virasoro-Witt algebras which q-deform the ternary Virasoro-Witt algebras constructed by Curtright, Fairlie and Zachos using su(1, 1) enveloping algebra techniques. The ternary Virasoro-Witt algebras constructed by Curtright, Fairlie and Zachos depend on a parameter and are not Nambu-Lie algebras for all but finitely many values of this parameter. For the parameter values for which the ternary Virasoro-Witt algebras are Nambu-Lie, the corresponding ternary q-Virasoro-Witt algebras constructed in this paper are also Hom-Nambu-Lie because they are obtained from the ternary Nambu-Lie algebras using the composition method. For other parameter values this composition method does not yield a Hom-Nambu-Lie algebra structure for q-Virasoro-Witt algebras. We show however, using a different construction, that the ternary Virasoro-Witt algebras of Curtright, Fairlie and Zachos, as well as the general ternary q-Virasoro-Witt algebras we construct, carry a structure of the ternary Hom-Nambu-Lie algebra for all values of the involved parameters.

  • 5.
    Andersson, Fredrik K.
    et al.
    WorldLight.com AB, Sweden.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication.
    The mathematics of internet search engines2008In: Acta Applicandae Mathematicae - An International Survey Journal on Applying Mathematics and Mathematical Applications, ISSN 0167-8019, E-ISSN 1572-9036, Vol. 104, no 2, p. 211-242Article in journal (Refereed)
    Abstract [en]

    This article presents a survey of techniques for ranking results in search engines, with emphasis on link-based ranking methods and the PageRank algorithm. The problem of selecting, in relation to a user search query, the most relevant documents from an unstructured source such as the WWW is discussed in detail. The need for extending classical information retrieval techniques such as boolean searching and vector space models with link-based ranking methods is demonstrated. The PageRank algorithm is introduced, and its numerical and spectral properties are discussed. The article concludes with an alternative means of computing PageRank, along with some example applications of this new method.

  • 6.
    Armakan, Abdoreza
    et al.
    Shiraz Univ, Coll Sci, Dept Math, Shiraz, Iran..
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Farhangdoost, Mohammad Reza
    Shiraz Univ, Coll Sci, Dept Math, Shiraz, Iran..
    Enveloping algebras of color hom-Lie algebras2019In: Turkish Journal of Mathematics, ISSN 1300-0098, E-ISSN 1303-6149, Vol. 43, no 1, p. 316-339Article in journal (Refereed)
    Abstract [en]

    In this paper, the universal enveloping algebra of color hom-Lie algebras is studied. A construction of the free involutive hom-associative color algebra on a hom-module is described and applied to obtain the universal enveloping algebra of an involutive hom-Lie color algebra. Finally, the construction is applied to obtain the well-known Poincare- Birkhoff-Witt theorem for Lie algebras to the enveloping algebra of an involutive color hom-Lie algebra.

  • 7.
    Arnlind, Joakim
    et al.
    Linköping University, Sweden.
    Kitouni, Abdennour
    Université de Haute-Alsace, Mulhouse, France.
    Makhlouf, Abdenacer
    Université de Haute-Alsace, Mulhouse, France .
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Structure and Cohomology of 3-Lie Algebras Induced by Lie Algebras2014In: Springer Proceedings in Mathematics and Statistics, Berlin, Heidelberg: Springer, 2014, Vol. 85, p. 123-144Conference paper (Refereed)
    Abstract [en]

    The aim of this paper is to compare the structure and the cohomology spaces of Lie algebras and induced 3-Lie algebras

  • 8.
    Arnlind, Joakim
    et al.
    Max Planck Institute for Gravitational Physics (AEI), Am Mühlenberg 1, D-14476 Golm, Germany.
    Makhlouf, Abdenacer
    Université de Haute Alsace, Lab. de Mathématiques Informatique et Applications, 4, rue des Frères Lumière, F-68093 Mulhouse, France.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication.
    Construction of n-Lie algebras and n-ary Hom-Nambu-Lie algebras2011In: Journal of Mathematical Physics, ISSN 0022-2488, E-ISSN 1089-7658, Vol. 52, no 12, p. 123502-Article in journal (Refereed)
    Abstract [en]

    As n-ary operations, generalizing Lie and Poisson algebras, arise in many different physical contexts, it is interesting to study general ways of constructing explicit realizations of such multilinear structures. Generically, they describe the dynamics of a physical system, and there is a need of understanding their quantization. Hom-Nambu-Lie algebras provide a framework that might be an appropriate setting in which n-Lie algebras (n-ary Nambu-Lie algebras) can be deformed, and their quantization studied. We present a procedure to construct (n + 1)-ary Hom-Nambu-Lie algebras from n-ary Hom-Nambu-Lie algebras equipped with a generalized trace function. It turns out that the implications of the compatibility conditions, that are necessary for this construction, can be understood in terms of the kernel of the trace function and the range of the twisting maps. Furthermore, we investigate the possibility of defining (n + k)-Lie algebras from n-Lie algebras and a k-form satisfying certain conditions. (C) 2011 American Institute of Physics. [doi:10.1063/1.3653197]

  • 9.
    Arnlind, Joakim
    et al.
    Max Planck Institute for Gravitational Physics (AEI), Germany.
    Makhlouf, Abdenacer
    Université de Haute Alsace, France .
    Silvestrov, Sergei
    Lund University, Sweden.
    Ternary Hom-Nambu-Lie algebras induced by Hom-Lie algebras2010In: Journal of Mathematical Physics, ISSN 0022-2488, E-ISSN 1089-7658, Vol. 51, no 4, p. 043515-11Article in journal (Refereed)
    Abstract [en]

    The need to consider n-ary algebraic structures, generalizing Lie and Poisson algebras, has become increasingly important in physics, and it should therefore be of interest to study the mathematical concepts related to n-ary algebras. The purpose of this paper is to investigate ternary multiplications (as deformations of n-Lie structures) constructed from the binary multiplication of a Hom-Lie algebra, a linear twisting map, and a trace function satisfying certain compatibility conditions. We show that the relation between the kernels of the twisting maps and the trace function plays an important role in this context and provide examples of Hom-Nambu-Lie algebras obtained using this construction.

  • 10.
    Arnlind, Joakim
    et al.
    Albert Einstein Institute, Golm, Germany.
    Silvestrov, Sergei
    Lund University.
    Affine transformation crossed product type algebras and noncommutative surfaces2009In: Operator structures and dynamical systems: July 21-25 2008, Lorentz Center, Leiden, The Netherlands, satellite conference of the fifth European Congress of Mathematics, Amer. Math. Soc. , 2009, Vol. 503, p. 1-25Chapter in book (Refereed)
  • 11.
    Ataguema, H.
    et al.
    Universit́e de Haute Alsace, France .
    Makhlouf, A.
    Universit́e de Haute Alsace, France .
    Silvestrov, S. D.
    Lund University.
    Generalization of n-ary Nambu algebras and beyond2009In: Journal of Mathematical Physics, ISSN 0022-2488, E-ISSN 1089-7658, Vol. 50, no 8, p. Article number 083501-Article in journal (Refereed)
    Abstract [en]

    The aim of this paper is to introduce n-ary Hom-algebra structures generalizing the n-ary algebras of Lie type including n-ary Nambu algebras, n-ary Nambu-Lie algebras and n-ary Lie algebras, and n-ary algebras of associative type including n-ary totally associative and n-ary partially associative algebras. We provide examples of the new structures and present some properties and construction theorems. We describe the general method allowing one to obtain an n-ary Hom-algebra structure starting from an n-ary algebra and an n-ary algebra endomorphism. Several examples are derived using this process. Also we initiate investigation of classification problems for algebraic structures introduced in the article and describe all ternary three-dimensional Hom-Nambu-Lie structures with diagonal homomorphism.

  • 12.
    Betuel, Canhanga
    et al.
    Faculty of Sciences, Dept of Mathematics and Computer Sciences, Eduardo Mondlane University, Mozambique.
    Malyarenko, Anatoliy
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Ni, Ying
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Rancic, Milica
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Calibration of Multiscale Two-Factor Stochastic Volatility Models: A Second-Order Asymptotic Expansion Approach2018In: / [ed] Christos H Skiadas, ISAST: International Society for the Advancement of Science and Technology , 2018Conference paper (Refereed)
    Abstract [en]

    The development of financial markets imposes more complex models on the option pricing problems. On the previous papers by the authors, we consider a model under which the underlying asset is driven by two independent Heston-type stochastic volatility processes of multiscale (fast and slow) mean-reverting rates and we compute an approximate solution for the option pricing problem, using asymptotic expansion method. In the present paper, we aim to calibrate the model using the market prices of options on Euro Stoxx 50 index and an equity stock in the European market. Our approach is to use the market implied volatility surface for calibrating directly a set of new parameters required in our second-order asymptotic expansion pricing formula for European options. This secondorder asymptotic expansion formula provides a better approximation formula for European option prices than the first-order formula, as explained in an earlier work of the authors.

  • 13.
    Biganda, Pitos
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics. Department of Mathematics, College of Natural and Applied Sciences, University of Dar es Salaam,Tanzania.
    Abola, Benard
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics. Department of Mathematics, School of Physical Sciences, Makerere University, Kampala, Uganda.
    Engström, Christopher
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Mango, J. M.
    Department of Mathematics, School of Physical Sciences, Makerere University, Kampala, Uganda.
    Kakuba, G.
    Department of Mathematics, School of Physical Sciences, Makerere University, Kampala, Uganda.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Traditional and lazy pageranks for a line of nodes connected with complete graphs2018In: Stochastic Processes and Applications: SPAS2017, Västerås and Stockholm, Sweden, October 4-6, 2017 / [ed] Sergei Silvestrov, Anatoliy Malyarenko, Milica Rančić, Springer, 2018, Vol. 271, p. 391-412Chapter in book (Refereed)
    Abstract [en]

    PageRank was initially defined by S. Brin and L. Page for the purpose of measuring the importance of web pages (nodes) based on the structure of links between them. Due to existence of diverse methods of random walk on the graph, variants of PageRank now exists. They include traditional (or normal) PageRank due to normal random walk and Lazy PageRank due to lazy random walk on a graph. In this article, we establish how the two variants of PageRank changes when complete graphs are connected to a line of nodes whose links between the nodes are in one direction. Explicit formulae for the two variants of PageRank are presented. We have noted that the ranks on a line graph are the same except their numerical values which differ. Further, we have observed that both normal random walk and lazy random walk on complete graphs spend almost the same time at each node.

  • 14.
    Boulougari, Andromachi
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Lundengård, Karl
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Rancic, Milica
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Strass, Belinda
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Application of a power-exponential function-based model to mortality rates forecasting2019In: Communications in Statistics: Case Studies, Data Analysis and Applications, E-ISSN 2373-7484, Vol. 5, no 1, p. 3-10Article in journal (Refereed)
    Abstract [en]

    There are many models for mortality rates. A well-known problem that complicates modeling of human mortality rates is the “accident hump” occurring in early adulthood. Here, two models of mortality rate based on power-exponential functions are presented and compared to a few other models. The models will be fitted to known data of measured death rates from several different countries using numerical techniques for curve-fitting with the nonlinear least-squares method. The properties of the model with respect to forecasting with the Lee–Carter method will be discussed.

  • 15.
    Bäck, Per
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Richter, Johan
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Hom-associative Ore extensions2018In: Journal of Physics, Conference Series, ISSN 1742-6588, E-ISSN 1742-6596, Vol. 965, no 1, article id 012006Article in journal (Refereed)
    Abstract [en]

    We introduce hom-associative Ore extensions as non-associative, non-unital Ore extensions with a hom-associative multiplication, as well as give some necessary and sufficient conditions when such exist. Within this framework, we also construct a family of hom-associative Weyl algebras as generalizations of the classical analogue, and prove that they are simple.

  • 16.
    Bäck, Per
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Richter, Johan
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Hom-associative Ore extensions and weak unitalizations2018In: International Electronic Journal of Algebra, ISSN 1306-6048, E-ISSN 1306-6048, Vol. 24, p. 174-194Article in journal (Refereed)
    Abstract [en]

    We introduce hom-associative Ore extensions as non-unital, nonassociative Ore extensions with a hom-associative multiplication, and give some necessary and sucient conditions when such exist. Within this framework, we construct families of hom-associative quantum planes, universal enveloping algebras of a Lie algebra, and Weyl algebras, all being hom-associative generalizations of their classical counterparts, as well as prove that the latter are simple. We also provide a way of embedding any multiplicative hom-associative algebra into a multiplicative, weakly unital hom-associative algebra, which we call a weak unitalization.

  • 17.
    Canhanga, Betuel
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Malyarenko, Anatoliy
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Murara, Jean-Paul
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Ni, Ying
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Numerical Studies on Asymptotics of European Option under Multiscale Stochastic Volatility2015In: ASMDA 2015 Proceedings: 16th Applied Stochastic Models and Data Analysis International Conference with 4th Demographics 2015 Workshop / [ed] Christos H Skiadas, ISAST: International Society for the Advancement of Science and Technology , 2015, p. 53-66Conference paper (Refereed)
    Abstract [en]

    Multiscale stochastic volatilities models relax the constant volatility assumption from Black-Scholes option pricing model. Such model can capture the smile and skew of volatilities and therefore describe more accurately the movements of the trading prices. Christoffersen et al. [3] presented a model where the underlying priceis governed by two volatility components, one changing fast and another changing slowly. Chiarella and Ziveyi [2] transformed Christoffersen’s model and computed an approximate formula for pricing American options. They used Duhamel’s principle to derive an integral form solution of the boundary value problem associated to the option price. Using method of characteristics, Fourier and Laplace transforms, they obtained with good accuracy the American options prices. In a previous research of the authors (Canhanga et al. [1]), a particular case of Chiarella and Ziveyi [2] model is used for pricing of European options. The novelty of this earlier work is to present an asymptotic expansion for the option price. The present paper provides experimental and numerical studies on investigating the accuracy of the approximation formulae given by this asymptotic expansion. We present also a procedure for calibrating the parameters produced by our first-order asymptotic approximation formulae. Our approximated option prices will be compared to the approximation obtained by Chiarella and Ziveyi [2].

    1. Canhanga B., Malyarenko, A., Ni, Y. and Silvestrov S. Perturbation methods for pricing European options in a model with two stochastic volatilities. 3rd SMTDA Conference Proceedings. 11-14 June 2014, Lisbon Porturgal, C. H. Skiadas (Ed.) 489-500 (2014).

    2. Chiarella, C, and Ziveyi, J. American option pricing under two stochastic volatility processes. J. Appl. Math. Comput. 224:283–310 (2013).

    3. Christoffersen, P.; Heston, S.; Jacobs, K. The shape and term structure of the index option smirk: why multifactor stochastic volatility models work so well. Manage. Sci. 55 (2) 1914-1932; (2009).

  • 18.
    Canhanga, Betuel
    et al.
    DMI, Eduardo Mondlane University, Maputo, Mozambique.
    Malyarenko, Anatoliy
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Murara, Jean-Paul
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Ni, Ying
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Numerical Studies on Asymptotics of European Option Under Multiscale Stochastic Volatility2017In: Methodology and Computing in Applied Probability, ISSN 1387-5841, E-ISSN 1573-7713, Vol. 19, no 4, p. 1075-1087Article in journal (Refereed)
    Abstract [en]

    Multiscale stochastic volatilities models relax the constant volatility assumption from Black-Scholes option pricing model. Such models can capture the smile and skew of volatilities and therefore describe more accurately the movements of the trading prices. Christoffersen et al. Manag Sci 55(2):1914–1932 (2009) presented a model where the underlying price is governed by two volatility components, one changing fast and another changing slowly. Chiarella and Ziveyi Appl Math Comput 224:283–310 (2013) transformed Christoffersen’s model and computed an approximate formula for pricing American options. They used Duhamel’s principle to derive an integral form solution of the boundary value problem associated to the option price. Using method of characteristics, Fourier and Laplace transforms, they obtained with good accuracy the American option prices. In a previous research of the authors (Canhanga et al. 2014), a particular case of Chiarella and Ziveyi Appl Math Comput 224:283–310 (2013) model is used for pricing of European options. The novelty of this earlier work is to present an asymptotic expansion for the option price. The present paper provides experimental and numerical studies on investigating the accuracy of the approximation formulae given by this asymptotic expansion. We present also a procedure for calibrating the parameters produced by our first-order asymptotic approximation formulae. Our approximated option prices will be compared to the approximation obtained by Chiarella and Ziveyi Appl Math Comput 224:283–310 (2013).

  • 19.
    Canhanga, Betuel
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Malyarenko, Anatoliy
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Murara, Jean-Paul
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Pricing European Options Under Stochastic Volatilities Models2016In: Engineering Mathematics I: Electromagnetics, Fluid Mechanics, Material Physics and Financial Engineering / [ed] Sergei Silvestrov; Milica Rancic, Springer, 2016, p. 315-338Chapter in book (Refereed)
    Abstract [en]

    Interested by the volatility behavior, different models have been developed for option pricing. Starting from constant volatility model which did not succeed on capturing the effects of volatility smiles and skews; stochastic volatility models appearas a response to the weakness of the constant volatility models. Constant elasticity of volatility, Heston, Hull and White, Schöbel-Zhu, Schöbel-Zhu-Hull-Whiteand many others are examples of models where the volatility is itself a random process. Along the chapter we deal with this class of models and we present the techniques of pricing European options. Comparing single factor stochastic volatility models to constant factor volatility models it seems evident that the stochastic volatility models represent nicely the movement of the asset price and its relations with changes in the risk. However, these models fail to explain the large independent fluctuations in the volatility levels and slope. Christoffersen et al. in [4] proposed a model with two-factor stochastic volatilities where the correlation between the underlying asset price and the volatilities varies randomly. In the last section of this chapter we introduce a variation of Chiarella and Ziveyi model, which is a subclass of the model presented in [4] and we use the first order asymptotic expansion methods to determine the price of European options.

  • 20.
    Canhanga, Betuel
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics. Faculty of Sciences, Department of Mathematics and Computer Sciences, Eduardo Mondlane University, Maputo, Mozambique.
    Malyarenko, Anatoliy
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Ni, Ying
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Rancic, Milica
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Analytical and Numerical Studies on the Second Order Asymptotic Expansion Method for European Option Pricing under Two-factor Stochastic Volatilities2018In: Communications in Statistics - Theory and Methods, ISSN 0361-0926, E-ISSN 1532-415X, Vol. 47, no 6, p. 1328-1349Article in journal (Refereed)
    Abstract [en]

    The celebrated Black–Scholes model made the assumption of constant volatility but empirical studies on implied volatility and asset dynamics motivated the use of stochastic volatilities. Christoffersen in 2009 showed that multi-factor stochastic volatilities models capture the asset dynamics more realistically. Fouque in 2012 used it to price European options. In 2013 Chiarella and Ziveyi considered Christoffersen's ideas and introduced an asset dynamics where the two volatilities of the Heston type act separately and independently on the asset price, and using Fourier transform for the asset price process and double Laplace transform for the two volatilities processes, solved a pricing problem for American options. This paper considers the Chiarella and Ziveyi model and parameterizes it so that the volatilities revert to the long-run-mean with reversion rates that mimic fast(for example daily) and slow(for example seasonal) random effects. Applying asymptotic expansion method presented by Fouque in 2012, we make an extensive and detailed derivation of the approximation prices for European options. We also present numerical studies on the behavior and accuracy of our first and the second order asymptotic expansion formulas.

  • 21.
    Canhanga, Betuel
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Malyarenko, Anatoliy
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Ni, Ying
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Perturbation Methods for Pricing European Options in a Model with Two Stochastic Volatilities2015In: New Trends in Stochastic Modelling and Data Analysis / [ed] Raimondo Manca, Sally McClean, Christos H Skiadas, ISAST , 2015, p. 199-210Chapter in book (Refereed)
    Abstract [en]

    Financial models have to reflect the characteristics of markets in which they are developed to be able to predict the future behavior of a financial system. The nature of most trading environments is characterized by uncertainties which are expressed in mathematical models in terms of volatilities. In contrast to the classical Black-Scholes model with constant volatility, our model includes one fast-changing and another slow-changing stochastic volatilities of mean-reversion type. The different changing frequencies of volatilities can be interpreted as the effects of weekends and effects of seasons of the year (summer and winter) on the asset price.

    We perform explicitly the transition from the real-world to the risk-neutral probability measure by introducing market prices of risk and applying Girsanov Theorem. To solve the boundary value problem for the partial differential equation that corresponds to the case of a European option, we perform both regular and singular multiscale expansions in fractional powers of the speed of mean-reversion factors. We then construct an approximate solution given by the two-dimensional Black-Scholes model plus some terms that expand the results obtained by Black and Scholes.

  • 22.
    Canhanga, Betuel
    et al.
    Faculty of Sciences, Department of Mathematics and Computer Sciences, Eduardo Mondlane University, Maputo, Mozambique.
    Malyarenko, Anatoliy
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Ni, Ying
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Second Order Asymptotic Expansion for Pricing European Options in a Model with Two Stochastic Volatilities2015In: ASMDA 2015 Proceedings: 16th Applied Stochastic Models and Data Analysis International Conference with 4th Demographics 2015 Workshop, 30 June – 4 July 2015 University of Piraeus, Greece / [ed] C. H. Skiadas, ISAST: International Society for the Advancement of Science and Technology , 2015, p. 37-52Conference paper (Refereed)
    Abstract [en]

    Asset price processes with stochastic volatilities have been actively used by researchers in financial mathematics for valuing derivative securities. This type of models allows characterizing the uncertainties in the asset price process in financial markets. In a recent paper Chiarella and Ziveyi analyzed a model with two stochastic volatilities of mean reversion type with one variable changing fast and the other changing slowly. They used method of characteristics to solve the obtained partial differential equation and determine the price of an American option. Fouque et al presented also a similar model in which the volatility of the underlying asset is governed by two diffusion processes which are not of mean reversion type. They developed a first-order asymptotic expansion for the European option price via a perturbation method.

    In this chapter we consider the model given in Chiarella and Ziveyi. Instead of pricing American options we price European options by generalizing the techniques presented in Fouque et al to a more complex model with mean reverting stochastic volatility factors. We analyse both regular and singular perturbations to obtain an asymptotic expansion up to second order which can serve as an approximation for the price of non-path-dependent European options. Similar work is done in authors earlier work Canhanga et al where a first-order asymptotic expansion has been developed. Involving the second order terms has the advantage of capturing more accurately the effects of volatility smile and skew on the option pricing. Analytical approximation formula for pricing European Option is presented.

  • 23.
    Canhanga, Betuel
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Ni, Ying
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Rancic, Milica
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Malyarenko, Anatoliy
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Numerical Methods on European Options Second Order Asymptotic Expansions for Multiscale Stochastic Volatility2017In: INCPAA 2016 Proceedings: 11th International Conference on Mathematical Problems in Engineering, Aerospace, and Sciences, ICNPAA 2016, La Rochelle, France, 4 - 8 July 2016. / [ed] S. Sivasundaram, 2017, Vol. 1798, p. 020035-1-020035-10, article id 020035Conference paper (Refereed)
    Abstract [en]

    After Black-Scholes proposed a model for pricing European Option in 1973, Cox, Ross and Rubinstein in 1979, and Heston in 1993, showed that the constant volatility assumption in the Black-Scholes model was one of the main reasons for the model to be unable to capture some market details. Instead of constant volatilities, they introduced non-constant volatilities to the asset dynamic modeling. In 2009, Christoffersen empirically showed "why multi-factor stochastic volatility models work so well". Four years later, Chiarella and Ziveyi solved the model proposed by Christoffersen. They considered an underlying asset whose price is governed by two factor stochastic volatilities of mean reversion type. Applying Fourier transforms, Laplace transforms and the method of characteristics they presented an approximate formula for pricing American option.The huge calculation involved in the Chiarella and Ziveyi approach motivated us to investigate another approach to compute European option prices on a Christoffersen type model. Using the first and second order asymptotic expansion method we presented a closed form solution for European option, and provided experimental and numerical studies on investigating the accuracy of the approximation formulae given by the first order asymptotic expansion. In the present chapter we will perform experimental and numerical studies for the second order asymptotic expansion and compare the obtained results with results presented by Chiarella and Ziveyi.

  • 24.
    Carlsen, Toke M.
    et al.
    Norwegian University of Science and Technology.
    Eilers, SorenUniversity of Copenhagen.Restorff, GunnarUniversity of the Faroe Islands.Silvestrov, SergeiMälardalen University, School of Education, Culture and Communication.
    Operator Algebra and Dynamics: Nordforsk Network Closing Conference, Faroe Islands, May 20122013Collection (editor) (Refereed)
  • 25.
    Carlsen, Toke Meier
    et al.
    University of Southern Denmark.
    Silvestrov, Sergei
    Lund University.
    On the Exel crossed product of topological covering maps2009In: Acta Applicandae Mathematicae - An International Survey Journal on Applying Mathematics and Mathematical Applications, ISSN 0167-8019, E-ISSN 1572-9036, ISSN 0167-8019, Vol. 108, no 3, p. 573-583Article in journal (Refereed)
    Abstract [en]

    For dynamical systems defined by a covering map of a compact Hausdorff space and the corresponding transfer operator, the associated crossed product C *-algebras C(X)⋊ α,ℒℕintroduced by Exel and Vershik are considered. An important property for homeomorphism dynamical systems is topological freeness. It can be extended in a natural way to in general non-invertible dynamical systems generated by covering maps. In this article, it is shown that the following four properties are equivalent: the dynamical system generated by a covering map is topologically free; the canonical embedding of C(X) into C(X)⋊ α,ℒℕis a maximal abelian C *-subalgebra of C(X)⋊ α,ℒN; any nontrivial two sided ideal of C(X)⋊ α,ℒℕhas non-zero intersection with the embedded copy of C(X); a certain natural representation of C(X)⋊ α,ℒℕis faithful. This result is a generalization to non-invertible dynamics of the corresponding results for crossed product C *-algebras of homeomorphism dynamical systems. 

  • 26.
    Carlsen, Toke Meier
    et al.
    Norwegian University of Science and Technology (NTNU), Trondheim, Norway .
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication.
    On the K-theory of the C*-algebra associated with a one-sided shift space2010In: Proceedings of the Estonian Academy of Sciences, ISSN 1736-6046, E-ISSN 1736-7530, Vol. 59, no 4, p. 272-279Article in journal (Refereed)
    Abstract [en]

    One-sided shift spaces are a special kind of non-invertible topological dynamical system with which one can associate a C*-algebra. We show how to construct the C*-algebra associated with a one-sided shift space as the Cuntz-Pimsner C*-algebra of a C*-correspondence and use this to compute its K-theory.

  • 27.
    Casazza, P. G.
    et al.
    University of Missouri.
    Jorgensen, Palle E. T.
    The University of Iowa.
    Kornelson, Keri A.
    University of Oklahoma.
    Kutyniok, Gitta
    Technische Universität Berlin.
    Larson, David R.
    Texas A&M University.
    Massopust, Peter
    Institute for Biomathematics and Biometry, Helmholtz Zentrum München.
    Olafsson, Gestur
    Lousiana State University.
    Packer, Judith A.
    University of Colorado at Boulder.
    Silvestrov, Sergei D.
    Mälardalen University, School of Education, Culture and Communication.
    Sun, Qiyu
    University of Central Florida.
    Preface2012In: Numerical Functional Analysis and Optimization, ISSN 0163-0563, E-ISSN 1532-2467, Vol. 33, no 7-9, p. 705-707Article in journal (Other academic)
  • 28.
    de Jeu, Marcel
    et al.
    Leiden University.
    Silvestrov, SergeiMälardalen University, School of Education, Culture and Communication.Skau, ChristianNorwegian University of Science and Technology (NTNU), Norway.Tomiyama, JunUniversity of Tokyo, Japan.
    Operator structures and dynamical systems2009Conference proceedings (editor) (Refereed)
  • 29.
    de Jeu, Marcel
    et al.
    Leiden University, Netherlands .
    Svensson, Christian
    Lund University.
    Silvestrov, Sergei
    Lund University.
    Algebraic curves for commuting elements in the $q$-deformed Heisenberg algebra2009In: Journal of Algebra, ISSN 0021-8693, E-ISSN 1090-266X, Vol. 321, no 4, p. 1239-1255Article in journal (Refereed)
    Abstract [en]

    In this paper we extend the eliminant construction of Burchnall and Chaundy for commuting differential operators in the Heisenberg algebra to the q-deformed Heisenberg algebra and show that it again provides annihilating curves for commuting elements, provided q satisfies a natural condition. As a side result we obtain estimates on the dimensions of the eigenspaces of elements of this algebra in its faithful module of Laurent series.

  • 30.
    Dupuch, Marie
    et al.
    CNRS UMR 8163 STL, Universit´e Lille 3, 59653 Villeneuve d’Ascq, France.
    Engström, Christopher
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Hamon, Thierry
    LIM&BIO UFR SMBH Universit´e Paris 13, France.
    Grabar, Natalia
    CNRS UMR 8163 STL, Universit´e Lille 3, 59653 Villeneuve d’Ascq, France.
    Comparison of Clustering Approaches through Their Application to Pharmacovigilance Terms2013In: Artificial Intelligence in Medicine. Lecture Notes in Computer Science, vol. 7885 / [ed] Niels Peek, Roque Marín Morales, Mor Peleg, Berlin Heidelberg: Springer, 2013, p. 58-67Chapter in book (Refereed)
    Abstract [en]

    In different applications (i.e., information retrieval, filteringor analysis), it is useful to detect similar terms and to provide the possibilityto use them jointly. Clustering of terms is one of the methods whichcan be exploited for this. In our study, we propose to test three methodsdedicated to the clustering of terms (hierarchical ascendant classification,Radius and maximum), to combine them with the semantic distance algorithmsand to compare them through the results they provide whenapplied to terms from the pharmacovigilance area. The comparison indicatesthat the non disjoint clustering (Radius and maximum) outperformthe disjoint clusters by 10 to up to 20 points in all the experiments.

  • 31. Dutkay, Dorin Ervin
    et al.
    Jorgensen, Palle E. T.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication.
    Decomposition of wavelet representations and Martin boundaries2012In: Journal of Functional Analysis, ISSN 0022-1236, E-ISSN 1096-0783, Vol. 262, no 3, p. 1043-1061Article in journal (Refereed)
    Abstract [en]

    We study a decomposition problem for a class of unitary representations associated with wavelet analysis, wavelet representations, but our framework is wider and has applications to multi-scale expansions arising in dynamical systems theory for non-invertible endomorphisms. Our main results offer a direct integral decomposition for the general wavelet representation, and we solve a question posed by Judith Packer. This entails a direct integral decomposition of the general wavelet representation. We further give a detailed analysis of the measures contributing to the decomposition into irreducible representations. We prove results for associated Martin boundaries, relevant for the understanding of wavelet filters and induced random walks, as well as classes of harmonic functions. Published by Elsevier Inc.

  • 32.
    Dutkay, Dorin Ervin
    et al.
    University of Central Florida, US.
    Larson, David R.
    Texas A and M University, United sTATES.
    Silvestrov, Sergei
    Lund University.
    Irreducible wavelet representations and ergodic automorphisms on solenoids2011In: Operators and Matrices, ISSN 1846-3886, E-ISSN 1848-9974, Vol. 5, no 2, p. 201-219Article in journal (Refereed)
    Abstract [en]

    We focus on the irreducibility of wavelet representations. We present some connections between the following notions: covariant wavelet representations, ergodic shifts on solenoids, fixed points of transfer (Ruelle) operators and solutions of refinement equations. We investigate the irreducibility of the wavelet representations, in particular the representation associated to the Cantor set, introduced in [13], and we present several equivalent formulations of the problem.

  • 33. Dutkay, Dorin Ervin
    et al.
    Larson, David R.
    Silvestrov, Sergei
    IRREDUCIBLE WAVELET REPRESENTATIONS AND ERGODIC AUTOMORPHISMS ON SOLENOIDS2011In: Operators and Matrices, ISSN 1846-3886, E-ISSN 1848-9974, Vol. 5, no 2, p. 201-219Article in journal (Refereed)
    Abstract [en]

    We focus on the irreducibility of wavelet representations. We present some connections between the following notions: covariant wavelet representations, ergodic shifts on solenoids, fixed points of transfer (Ruelle) operators and solutions of refinement equations. We investigate the irreducibility of the wavelet representations, in particular the representation associated to the Cantor set, introduced in [13], and we present several equivalent formulations of the problem.

  • 34. Dutkay, Dorin Ervin
    et al.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication. Lund University.
    REDUCIBILITY OF THE WAVELET REPRESENTATION ASSOCIATED TO THE CANTOR SET2011In: Proceedings of the American Mathematical Society, ISSN 0002-9939, E-ISSN 1088-6826, Vol. 139, no 10, p. 3657-3664Article in journal (Refereed)
    Abstract [en]

    We answer a question by Judith Packer about the irreducibility of the wavelet representation associated to the Cantor set. We prove that if the QMF filter does not have constant absolute value, then the wavelet representation is reducible.

  • 35. Dutkay, Dorin Ervin
    et al.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication.
    Wavelet Representations and Their Commutant2012In: Analysis for Science, Engineering and Beyond / [ed] Åström, Kalle; Persson, Lars-Erik; Silvestrov, Sergei D., Springer Berlin/Heidelberg, 2012, Vol. 6, p. 253-265Chapter in book (Refereed)
    Abstract [en]

    We study the reducibility of the wavelet representation associated to various QMF filters, including those associated to Cantor sets. We show there are connections between this problem, the harmonic analysis of transfer operators and the ergodic properties of shifts on solenoids. We prove that if the QMF filter does not have constant absolute value, then the wavelet representations is reducible.

  • 36.
    Ekström, Fredrik
    et al.
    Lund University.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Commutants and Centers in a 6-Parameter Family of Quadratically Linked Quantum Plane Algebras2014In: Springer Proceedings in Mathematics and Statistics, Springer, 2014, Vol. 85, p. 37-59Conference paper (Refereed)
    Abstract [en]

    We consider a family of associative algebras, defined as the quotient of a free algebra with the ideal generated by a set of multi-parameter deformed commutation relations between four generators consisting of five quantum plane relations between pairs of generators and one sub-quadratic relation inter-linking all four generators. For generic parameter vectors, the center and the commutants of the two of the generators are described and conditions on the parameters for these commutants to be itself commutative or non-commutative are obtained.

  • 37.
    Elchinger, O.
    et al.
    Laboratoire de Mathématiques, Informatique et Applications, Université de Haute Alsace, Mulhouse, France.
    Lundengård, Karl
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Makhlouf, A.
    Laboratoire de Mathématiques Informatique et Applications, Université de Haute Alsace, Mulhouse, France.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Brackets with (τ,σ)-derivations and (p,q)-deformations of Witt and Virasoro algebras2016In: Forum mathematicum, ISSN 0933-7741, E-ISSN 1435-5337, Vol. 28, no 4, p. 657-673Article in journal (Refereed)
    Abstract [en]

    The aim of this paper is to study some brackets defined on (τ,σ)-derivations satisfying quasi-Lie identities. Moreover, we provide examples of (p, q)-deformations of Witt and Virasoro algebras as well as sl(2) algebra. These constructions generalize the results obtained by Hartwig, Larsson and Silvestrov on σ-derivations, arising in connection with discretizations and deformations of algebras of vector fields.

  • 38.
    Engström, Christopher
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    A componentwise PageRank algorithm2015In: ASMDA 2015 Proceedings: 16th Applied Stochastic Models and Data Analysis International Conference with 4th Demographics 2015 Workshop / [ed] Christos H Skiadas, ISAST: International Society for the Advancement of Science and Technology , 2015, p. 185-198Conference paper (Refereed)
    Abstract [en]

    In this article we will take a look at a variant of the PageRank algorithminitially used by S. Brinn and L. Page to rank homepages on the Internet. The aim ofthe article is to see how we can use the topological structure of the graph to speed upcalculations of PageRank without doing any additional approximations. We will seethat by considering a non-normalized version of PageRank it is easy to see how wecan handle dierent types of vertices or strongly connected components in the graphmore eciently. Using this we propose two PageRank algorithms, one similar to theLumping algorithm proposed by Qing et al which handles certain types of verticesfaster and last another PageRank algorithm which can handle more types of verticesas well as strongly connected components more eectively. In the last sections we willlook at some specic types of components as well as verifying the time complexity ofthe algorithm.

  • 39.
    Engström, Christopher
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    An evaluation of centrality measures used in cluster analysis2014In: 10TH INTERNATIONAL CONFERENCE ON MATHEMATICAL PROBLEMS IN ENGINEERING, AEROSPACE AND SCIENCES: ICNPAA 2014 Conference date: 15–18 July 2014 Location: Narvik, Norway ISBN: 978-0-7354-1276-7 Editor: Seenith Sivasundaram Volume number: 1637 Published: 10 december 2014 / [ed] Seenith Sivasundaram, American Institute of Physics (AIP), 2014, p. 313-320Conference paper (Refereed)
    Abstract [en]

    Clustering of data into groups of similar objects plays an important part when analysing many types of data especially when the datasets are large as they often are in for example bioinformatics social networks and computational linguistics. Many clustering algorithms such as K-means and some types of hierarchical clustering need a number of centroids representing the 'center' of the clusters. The choice of centroids for the initial clusters often plays an important role in the quality of the clusters. Since a data point with a high centrality supposedly lies close to the 'center' of some cluster this can be used to assign centroids rather than through some other method such as picking them at random. Some work have been done to evaluate the use of centrality measures such as degree betweenness and eigenvector centrality in clustering algorithms. The aim of this article is to compare and evaluate the usefulness of a number of common centrality measures such as the above mentioned and others such as PageRank and related measures.

  • 40.
    Engström, Christopher
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Calculating PageRank in a changing network with added or removed edges2017In: AIP Conference Proceedings, Volume 1798 / [ed] Seenith Sivasundaram, American Institute of Physics (AIP), 2017, Vol. 1798, p. 020052-1-020052-8, article id 020052Conference paper (Refereed)
    Abstract [en]

    PageRank was initially developed by S. Brinn and L. Page in 1998 to rank homepages on the Internet using the stationary distribution of a Markov chain created using the web graph. Due to the large size of the web graph and many other real worldnetworks fast methods to calculate PageRank is needed and even if the original way of calculating PageRank using a Power iterations is rather fast, many other approaches have been made to improve the speed further. In this paper we will consider the problem of recalculating PageRank of a changing network where the PageRank of a previous version of the network is known. In particular we will consider the special case of adding or removing edges to a single vertex in the graph or graph component

  • 41.
    Engström, Christopher
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Generalisation of the Damping Factor in PageRank for Weighted Networks2014In: Modern Problems in Insurance Mathematics / [ed] Silvestrov, Dmitrii; Martin-Löf, Anders, Springer International Publishing , 2014, p. 313-333Chapter in book (Refereed)
    Abstract [en]

    In this article we will look at the PageRank algorithm used to rank nodes in a network. While the method was originally used by Brin and Page to rank home pages in order of “importance”, since then many similar methods have been used for other networks such as financial or P2P networks. We will work with a non-normalised version of the usual PageRank definition which we will then generalise to enable better options, such as adapting the method or allowing more types of data. We will show what kind of effects the new options creates using examples as well as giving some thoughts on what it can be used for. We will also take a brief look at how adding new connections between otherwise unconnected networks can change the ranking.

  • 42.
    Engström, Christopher
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Non-normalized PageRank and random walks on N-partite graphs2014In: SMTDA 2014 Proceedings / [ed] H. Skiadas (Ed), 2014, p. 193-202Conference paper (Refereed)
    Abstract [en]

    In this article we will look at a variation of the PageRank algorithmoriginally used by L. Page and S. Brin to rank home pages on the Web. Wewill look at a non-normalized variation of PageRank and show how this version ofPageRank relates to a random walk on a graph. The article has its main focus inunderstanding the behavior of the ranking depending on the structure of the graphand how the ranking changes as the graph change. More specic we will look atN-partite graphs and see that by considering a random walk on the graph we cannd explicit formulas for PageRank of the vertices in the graph. Both the case withuniform and non-uniform personalization vector are considered.

  • 43.
    Engström, Christopher
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    PageRank, a Look at Small Changes in a Line of Nodes and the Complete Graph2016In: Engineering Mathematics II: Algebraic, Stochastic and Analysis Structures for Networks, Data Classification and Optimization / [ed] Sergei Silvestrov; Milica Rancic, Springer, 2016, p. 223-247Chapter in book (Refereed)
    Abstract [en]

    In this article we will look at the PageRank algorithm used as part of the ranking process of different Internet pages in search engines by for example Google. This article has its main focus in the understanding of the behavior of PageRank as the system dynamically changes either by contracting or expanding such as when adding or subtracting nodes or links or groups of nodes or links. In particular we will take a look at link structures consisting of a line of nodes or a complete graph where every node links to all others. We will look at PageRank as the solution of a linear system of equations and do our examination in both the ordinary normalized version of PageRank as well as the non-normalized version found by solving corresponding linear system. We will show that using two different methods we can find explicit formulas for the PageRank of some simple link structures.

  • 44.
    Engström, Christopher
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    PageRank, Connecting a Line of Nodes with a Complete Graph2016In: Engineering Mathematics II: Algebraic, Stochastic and Analysis Structures for Networks, Data Classification and Optimization / [ed] Sergei Silvestrov; Milica Rancic, Springer, 2016Chapter in book (Refereed)
    Abstract [en]

    The focus of this article is the PageRank algorithm originally defined by S. Brin and L. Page as the stationary distribution of a certain random walk on a graph used to rank homepages on the Internet. We will attempt to get a better understanding of how PageRank changes after you make some changes to the graph such as adding or removing edge between otherwise disjoint subgraphs. In particular we will take a look at link structures consisting of a line of nodes or a complete graph where every node links to all others and different ways to combine the two. Both the ordinary normalized version of PageRank as well as a non-normalized version of PageRank found by solving corresponding linear system will be considered. We will see that it is possible to find explicit formulas for the PageRank in some simple link structures and using these formulas take a more in-depth look at the behavior of the ranking as the system changes.

  • 45.
    Engström, Christopher
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    PageRank for networks, graphs and Markov chains2017In: Theory of Probability and Mathematical Statistics, ISSN 0868-6904, Vol. 96, p. 61-83Article in journal (Refereed)
    Abstract [en]

    In this work it is described how a partitioning of a graph into components can be used to calculate PageRank in a large network and how such a partitioning can be used to re-calculate PageRank as the network changes. Although considered problem is that of calculating PageRank, it is worth to note that the same partitioning method could be used when working with Markov chains in general or solving linear systems as long as the method used for solving a single component is chosen appropriately. An algorithm for calculating PageRank using a modified partitioning of the graph into strongly connected components is described. Moreover, the paper focuses also on the calculation of PageRank in a changing graph from two different perspectives, by considering specific types of changes in the graph and calculating the difference in rank before and after certain types of edge additions or removals between components. Moreover, some common specific types of graphs for which it is possible to find analytic expressions for PageRank are considered, and in particular the complete bipartite graph and how PageRank can be calculated for such a graph. Finally, several open directions and problems are described.

  • 46.
    Engström, Christopher
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Using graph partitioning to calculate PageRank in a changing networkManuscript (preprint) (Other academic)
    Abstract [en]

    PageRank was first defined by S. Brinn and L. Page in 1998 in order to rank homepages on the Internet by ranking pages according to the stationary distribution of a random walk on the web graph. While the original way to calculate PageRank is fast, due to the huge size and growth of the web there have been many attempts at improving upon the calculation speed of PageRank through various means. In this article we will look at a slightly different but equally important problem, namely how to improve the calculation of PageRank in a changing network where PageRank of an earlier stage of the network is available. In particular we consider two types of changes in the graph, the change in rank after changing the personalization vector used in calculating PageRank as well as added or removed edges between different strongly connected components in the network.

  • 47.
    Engström, Christopher
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Using graph partitioning to calculate PageRank in a changing network2016In: Proceedings of the 4th Stochastic Modeling Techniques and DataAnalysis International Conference with Demographics Workshop (SMTDA2016) / [ed] Christos H Skiadas, 2016, p. 155-164Conference paper (Refereed)
    Abstract [en]

    PageRank was first defined by S. Brinn and L. Page in 1998 in order to rank homepages on the Internet for use in search engines using a random walk on the web graph. While the original way to calculate PageRank is fast, due to the huge size and growth of the web there have been many attempts at improving upon the calculation speed of PageRank through various means. In this article we will look at a slightly dierent but equally important problem, namely how to improve the calculation speed of PageRank in a changing network where PageRank of an earlier stage of the network is available. In particular we consider two types of changes in the graph, the change in rank after changing the personalization vector used in calculating PageRank as well as added or removed edges between dierent strongly connected components in the network.

  • 48. Frégier, Yaël
    et al.
    Gohr, Aron
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication.
    Unital algebras of Hom-associative type and surjective or injective twistings2009In: Journal of Generalized Lie Theory and Applications, ISSN 1736-5279, E-ISSN 1736-4337, Vol. 3, no 4, p. 285-295Article in journal (Refereed)
  • 49.
    Ghimire, Sushil
    et al.
    Pulchowk Campus, Institute of Engineering, Tribhuvan University, Nepal.
    Gyan, Bahadur Thapa
    Pulchowk Campus, Institute of Engineering, Tribhuvan University, Nepal.
    Ghimire, Ram Prasad
    Department of Mathematical Sciences, School of Science, Kathmandu University, Nepal.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    A Survey on Queueing Systems with Mathematical Models and Applications2017In: American Journal of Operational Research, ISSN 2324-6537, E-ISSN 2324-6545, ISSN 2324-6537, Vol. 7, no 1, p. 1-14Article in journal (Refereed)
    Abstract [en]

    Queuing systems consist of one or more servers that provide some sort of services to arriving customers. Almost everyone has some experience of tedious time being in a queue during several daily life activities. It is reasonable to accept that service should be provided to the one who arrives first in the queue. But this rule always may not work. Sometimes the last comer or the customer in the high priority gets service earlier than the one who is waiting in the queue for a long time. All these characteristics are the interesting areas of research in the queueing theory. In this paper, we present some of the previous works of various researchers with brief explanations. We then carry out some of the mathematical expressions which represent the different queueing behaviors. In almost all the literatures, these queueing behaviors are examined with the help of mathematical simulations. Based on the previous contributions of researchers, our specific point of attraction is to study the finite capacity queueing models in which limited number of customers are served by a single or multiple number of servers and the batch queueing models where arrival or service or both occur in a bulk. Furthermore, we present some performance measure equations of some queueing models together with necessary components used in the queueing theory. Finally, we report some applications of queueing systems in supply chain management pointing out some areas of research as further works.

  • 50.
    Guariglia, Emanuel
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics. University of Salerno, Italy.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    A functional equation for the Riemann zeta fractional derivative2017In: Proceedings of INCPAA 2016, 11th International Conference on Mathematical Problems in Engineering, Aerospace and Sciences / [ed] Sivasundaram, S, American Institute of Physics (AIP), 2017, Vol. 1798, p. 020063-1-020063-10, article id UNSP 020063Conference paper (Refereed)
    Abstract [en]

    In this paper a functional equation for the fractional derivative of the Riemann zeta function is presented. The fractional derivative of the zeta function is computed by a generalization of the Grunwald-Letnikov fractional operator, which satisfies the generalized Leibniz rule. It is applied to the asymmetric functional equation of the Rieman zeta function in order to obtain the result sought. Moreover, further properties of this fractional derivative are proposed and discussed.

1234 1 - 50 of 189
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf