Alexander Roitershtein
Research Subjects
Alexander Roitershtein has a total of 80 co-authors. Here are the top co-authors by number of shared publications:
- Reza Rastegar
Occidental Petroleum Corporation 77046 Houston TX USA
10 shared publications - Toufik Mansour
University of Haifa
10 shared publications - Arka P. Ghosh
Iowa State University
5 shared publications - Reza Rastegar
Woodinville WA
5 shared publications - Anastasios Matzavinos
Division of Applied Mathematics, Brown University, Providence, RI 02912, USA
4 shared publications Arka P. Ghosh
Department of Statistics, Iowa State University, Ames, USA
4 shared publications
Latest Publications
- Open Access
Balancing art and money in pursuit of a Kelly-type optimality
We introduce and study a mathematical model of an art collector. In our model, the collector is a rational agent whose actions in the art market are driven by two competing long-term objectives, namely sustainable financial health and maintaining the collection. Mathematically, our model is a two-dimensional random linear dynamical system with transformation matrix of a peculiar type. In some examples we are able to show that within the Kelly-type optimization paradigm, that is optimizing the system's Lyapunov exponent over a set of policy parameters, the dilemma ``art or money" can be successfully resolved, namely the optimal policy creates a coexistence equilibrium where the value of both is increasing over the time.
Open AccessBalancing art and money in pursuit of a Kelly-type optimality
We introduce and study a mathematical model of an art collector. In our model, the collector is a rational agent whose actions in the art market are driven by two competing long-term objectives, namely sustainable financial health and maintaining the collection. Mathematically, our model is a two-dimensional random linear dynamical system with transformation matrix of a peculiar type. In some examples we are able to show that within the Kelly-type optimization paradigm, that is optimizing the system's Lyapunov exponent over a set of policy parameters, the dilemma ``art or money" can be successfully resolved, namely the optimal policy creates a coexistence equilibrium where the value of both is increasing over the time.
- 26 September 2023
- Published by Springer Nature in Journal of Mathematical Biology
- Vol. 87 (4) , 1-55
Extinction scenarios in evolutionary processes: a multinomial Wright–Fisher approach
We study a discrete-time multi-type Wright–Fisher population process. The mean-field dynamics of the stochastic process is induced by a general replicator difference equation. We prove several results regarding the asymptotic behavior of the model, focusing on the impact of the mean-field dynamics on it. One of the results is a limit theorem that describes sufficient conditions for an almost certain path to extinction, first eliminating the type which is the least fit at the mean-field equilibrium. The effect is explained by the metastability of the stochastic system, which under the conditions of the theorem spends almost all time before the extinction event in a neighborhood of the equilibrium. In addition to the limit theorems, we propose a maximization principle for a general deterministic replicator dynamics and study its implications for the stochastic model.
- 26 September 2023
- Published by Springer Nature in Journal of Mathematical Biology
- Vol. 87 (4) , 1-55
Extinction scenarios in evolutionary processes: a multinomial Wright–Fisher approach
We study a discrete-time multi-type Wright–Fisher population process. The mean-field dynamics of the stochastic process is induced by a general replicator difference equation. We prove several results regarding the asymptotic behavior of the model, focusing on the impact of the mean-field dynamics on it. One of the results is a limit theorem that describes sufficient conditions for an almost certain path to extinction, first eliminating the type which is the least fit at the mean-field equilibrium. The effect is explained by the metastability of the stochastic system, which under the conditions of the theorem spends almost all time before the extinction event in a neighborhood of the equilibrium. In addition to the limit theorems, we propose a maximization principle for a general deterministic replicator dynamics and study its implications for the stochastic model.
- Open Access
- 1 December 2022
- Published by Walter de Gruyter GmbH in Pure Mathematics and Applications
- Vol. 30 (4) , 11-21
The longest increasing subsequence in involutions avoiding 3412 and another pattern
In this note, we study the mean length of the longest increasing subsequence of a uniformly sampled involution that avoids the pattern 3412 and another pattern.
- 1 December 2022
- Published by Walter de Gruyter GmbH in Pure Mathematics and Applications
- Vol. 30 (4) , 11-21
Open AccessThe longest increasing subsequence in involutions avoiding 3412 and another pattern
In this note, we study the mean length of the longest increasing subsequence of a uniformly sampled involution that avoids the pattern 3412 and another pattern.
- 11 January 2022
- Published by Taylor & Francis in Stochastic Models
- Vol. 38 (2) , 250-267
Distribution tails of a history-dependent random linear recursion
We consider a history-dependent random linear recursion, adapting a continuous-time framework introduced by Clifford and Stirzaker. Typically, the main object of interest in the study of history-dependent processes is the evolution and asymptotic behavior of their first and second moments. We apply the methodology developed by Clifford and Stirzaker to study the evolution of distribution tails of the process by utilizing a certain affinity between the asymptotic structure of the tails in a regular variation regime and a linear structure of moments in the class of models introduced by Clifford and Stirzaker.
- 11 January 2022
- Published by Taylor & Francis in Stochastic Models
- Vol. 38 (2) , 250-267
Distribution tails of a history-dependent random linear recursion
We consider a history-dependent random linear recursion, adapting a continuous-time framework introduced by Clifford and Stirzaker. Typically, the main object of interest in the study of history-dependent processes is the evolution and asymptotic behavior of their first and second moments. We apply the methodology developed by Clifford and Stirzaker to study the evolution of distribution tails of the process by utilizing a certain affinity between the asymptotic structure of the tails in a regular variation regime and a linear structure of moments in the class of models introduced by Clifford and Stirzaker.
- 8 October 2021
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 53 (3) , 609-648
Avalanches in a short-memory excitable network
We study propagation of avalanches in a certain excitable network. The model is a particular case of the one introduced by Larremoreet al.(Phys. Rev. E, 2012) and is mathematically equivalent to an endemic variation of the Reed–Frost epidemic model introduced by Longini (Math. Biosci., 1980). Two types of heuristic approximation are frequently used for models of this type in applications: a branching process for avalanches of a small size at the beginning of the process and a deterministic dynamical system once the avalanche spreads to a significant fraction of a large network. In this paper we prove several results concerning the exact relation between the avalanche model and these limits, including rates of convergence and rigorous bounds for common characteristics of the model.
- 8 October 2021
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 53 (3) , 609-648
Avalanches in a short-memory excitable network
We study propagation of avalanches in a certain excitable network. The model is a particular case of the one introduced by Larremoreet al.(Phys. Rev. E, 2012) and is mathematically equivalent to an endemic variation of the Reed–Frost epidemic model introduced by Longini (Math. Biosci., 1980). Two types of heuristic approximation are frequently used for models of this type in applications: a branching process for avalanches of a small size at the beginning of the process and a deterministic dynamical system once the avalanche spreads to a significant fraction of a large network. In this paper we prove several results concerning the exact relation between the avalanche model and these limits, including rates of convergence and rigorous bounds for common characteristics of the model.
- 1 March 2021
- Published by Elsevier in Advances in Applied Mathematics
- Vol. 124
Horizontal visibility graph of a random restricted growth sequence
- 1 March 2021
- Published by Elsevier in Advances in Applied Mathematics
- Vol. 124
Horizontal visibility graph of a random restricted growth sequence
- 4 December 2020
- Published by National Inquiry Services Center (NISC) in Quaestiones Mathematicae
- Vol. 45 (1) , 55-69
Shifting powers in Spivey's Bell number formula
In this paper, we consider extensions of Spivey's Bell number formula wherein the argument of the polynomial factor is translated by an arbitrary amount. This idea is applied more generally to the r-Whitney numbers of the second kind, denoted by W (n, k), where some new identities are found by means of algebraic and combinatorial arguments. The former makes use of infinite series manipulations and Dobinski-like formulas satisfied by W (n, k), whereas the latter considers distributions of certain statistics on the underlying enumerated class of set partitions. Further-more, these two approaches provide new ways in which to deduce the Spivey formula for W (n, k). Finally, we establish an analogous result involving the r-Lah numbers wherein the order matters in which the elements are written within the blocks of the aforementioned set partitions.
- 4 December 2020
- Published by National Inquiry Services Center (NISC) in Quaestiones Mathematicae
- Vol. 45 (1) , 55-69
Shifting powers in Spivey's Bell number formula
In this paper, we consider extensions of Spivey's Bell number formula wherein the argument of the polynomial factor is translated by an arbitrary amount. This idea is applied more generally to the r-Whitney numbers of the second kind, denoted by W (n, k), where some new identities are found by means of algebraic and combinatorial arguments. The former makes use of infinite series manipulations and Dobinski-like formulas satisfied by W (n, k), whereas the latter considers distributions of certain statistics on the underlying enumerated class of set partitions. Further-more, these two approaches provide new ways in which to deduce the Spivey formula for W (n, k). Finally, we establish an analogous result involving the r-Lah numbers wherein the order matters in which the elements are written within the blocks of the aforementioned set partitions.
- Open Access
The longest increasing subsequence in involutions avoiding 3412 and another pattern
In this note, we study the mean length of the longest increasing subsequence of a uniformly sampled involution that avoids the pattern $3412$ and another pattern.Open AccessThe longest increasing subsequence in involutions avoiding 3412 and another pattern
In this note, we study the mean length of the longest increasing subsequence of a uniformly sampled involution that avoids the pattern $3412$ and another pattern. - Open Access
- 30 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 35 (4) , 3224-3235
A Markovian Influence Graph Formed From Utility Line Outage Data to Mitigate Large Cascades
We use observed transmission line outage data to make a Markovian influence graph that describes the probabilities of transitions between generations of cascading line outages. Each generation of a cascade consists of a single line outage or multiple line outages. The new influence graph defines a Markov chain and generalizes previous influence graphs by including multiple line outages as Markov chain states. The generalized influence graph can reproduce the distribution of cascade size in the utility data. In particular, it can estimate the probabilities of small, medium and large cascades. The influence graph has the key advantage of allowing the effect of mitigations to be analyzed and readily tested, which is not available from the observed data. We exploit the asymptotic properties of the Markov chain to find the lines most involved in large cascades and show how upgrades to these critical lines can reduce the probability of large cascades.
- 30 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 35 (4) , 3224-3235
Open AccessA Markovian Influence Graph Formed From Utility Line Outage Data to Mitigate Large Cascades
We use observed transmission line outage data to make a Markovian influence graph that describes the probabilities of transitions between generations of cascading line outages. Each generation of a cascade consists of a single line outage or multiple line outages. The new influence graph defines a Markov chain and generalizes previous influence graphs by including multiple line outages as Markov chain states. The generalized influence graph can reproduce the distribution of cascade size in the utility data. In particular, it can estimate the probabilities of small, medium and large cascades. The influence graph has the key advantage of allowing the effect of mitigations to be analyzed and readily tested, which is not available from the observed data. We exploit the asymptotic properties of the Markov chain to find the lines most involved in large cascades and show how upgrades to these critical lines can reduce the probability of large cascades.
- 1 January 2020
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 34 (2) , 1011-1038
Finite Automata, Probabilistic Method, and Occurrence Enumeration of a Pattern in Words and Permutations
The main theme of this paper is the enumeration of the order-isomorphic occurrence of a pattern in words and permutations. We mainly focus on asymptotic properties of the sequence $f_r^v(k,n),$ the...- 1 January 2020
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 34 (2) , 1011-1038
Finite Automata, Probabilistic Method, and Occurrence Enumeration of a Pattern in Words and Permutations
The main theme of this paper is the enumeration of the order-isomorphic occurrence of a pattern in words and permutations. We mainly focus on asymptotic properties of the sequence $f_r^v(k,n),$ the...