Related papers: A Markov model for factorisation of iterated cubic…

In this paper we derive the Wiener-Hopf factorization for a finite-state time-inhomogeneous Markov chain. To the best of our knowledge, this study is the first attempt to investigate the Wiener-Hopf factorization for time-inhomogeneous…

We study the orbits of the solutions to the Markoff-type equation $$X^2 + Y^2 + Z^2 = XYZ +AX + BY + CZ + D$$ in $\mathbb{F}_p$ for fixed integers $A, B, C,$ and $D$ under the group of symmetries $\Gamma$ generated by \[\begin{split}&V_1:…

We consider the problem of computing critical points of the restriction of a polynomial map to an algebraic variety. This is of first importance since the global minimum of such a map is reached at a critical point. Thus, these points…

We construct quadratic stochastic processes (QSP) (also known as Markov processes of cubic matrices) in continuous and discrete times. These are dynamical systems given by (a fixed type, called $\sigma$) stochastic cubic matrices satisfying…

We provide an effective classification of postcritically finite polynomials as dynamical systems by means of Hubbard Trees. This can be viewed as an application of the results developed in part 1 (Stony Brook IMS 1993/5).

Parametric Markov chains (pMCs) are Markov chains (MCs) with symbolic probabilities. A pMC encodes a family of MCs, where each member is obtained by replacing parameters with constants. The parameters allow encoding dependencies between…

This paper constructs a combinatorial model for all postcritically finite rational maps arising as the Newton's method of a complex polynomial. This model is used in [LMS] to give a combinatorial classification of postcritically finite…

An efficient simulation-based methodology is proposed for the rolling window estimation of state space models, called particle rolling Markov chain Monte Carlo (MCMC) with double block sampling. In our method, which is based on Sequential…

The separability assumption (Donoho & Stodden, 2003; Arora et al., 2012) turns non-negative matrix factorization (NMF) into a tractable problem. Recently, a new class of provably-correct NMF algorithms have emerged under this assumption. In…

Given a map f:Z-->Z and an initial argument alpha, we can iterate the map to get a finite set of iterates modulo a prime p. In particular, for a quadratic map f(z)=z^2 +c, c constant, work by Pollard suggests that this set should have…

The Pairwise Markov Chain (PMC) is a probabilistic graphical model extending the well-known Hidden Markov Model. This model, although highly effective for many tasks, has been scarcely utilized for continuous value prediction. This is…

The behavior under iteration of the critical points of polynomial maps plays an essential role in understanding its dynamics. We study the special case where the forward orbits of the critical points are finite. Thurston's theorem tells us…

We define a discrete-time Markov chain for abstract polymer models and show that under sufficient decay of the polymer weights, this chain mixes rapidly. We apply this Markov chain to polymer models derived from the hard-core and…

In this note, we consider general growth-fragmentation equations from a probabilistic point of view. Using Foster-Lyapunov techniques, we study the recurrence of the associated Markov process depending on the growth and fragmentation rates.…

Let $K$ be a number field with ring of integers $\mathcal{O}_K$, and let $f(x)\in\mathcal{O}_K[x]$ be a monic, irreducible polynomial. We establish necessary and sufficient conditions in terms of the critical points of $f(x)$ for the…

This is a course project report with complete methodology, experiments, references and mathematical derivations. Matrix factorization [1] is a widely used technique in recommendation systems. Probabilistic Matrix Factorization (PMF) [2]…

In this paper we propose a novel algorithm, factored value iteration (FVI), for the approximate solution of factored Markov decision processes (fMDPs). The traditional approximate value iteration algorithm is modified in two ways. For one,…

For a Baer-local (composition) Fitting formation $\mathfrak{F}$ the polynomial time algorithm for the computation of the $\mathfrak{F}$-radical of a permutation group is suggested. In particular it is showed how one can compute the…

We give a complete description of the arboreal Galois representation of a certain postcritically finite cubic polynomial over a large class of number fields and for a large class of basepoints. This is the first such example that is not…

Given an integer $q$ and a polynomial $f\in \mathbb Z_{q}[X]$ of degree $d$ with coefficients in the residue ring $\mathbb Z_q=\mathbb Z/q\mathbb Z,$ we obtain new results concerning the number of solutions to congruences of the form…