Related papers: Constant Slope Models for Finitely Generated Maps
We study the graphs generated when the formula for linking Markov triples is applied to general triples of integers. We find there are a finite number of equivalence classes of graphs, each with particular properties.
The problem of map enumeration concerns counting connected spatial graphs, with a specified number $j$ of vertices, that can be embedded in a compact surface of genus $g$ in such a way that its complement yields a cellular decomposition of…
We consider a class of finite Markov moment problems with arbitrary number of positive and negative branches. We show criteria for the existence and uniqueness of solutions, and we characterize in detail the non-unique solution families.…
Coupled Map Lattice (CML) models are particularly suitable to study spatially extended behaviours, such as wave-like patterns, spatio-temporal chaos, and synchronisation. Complete synchronisation in CMLs emerges when all maps have their…
We prove global-local mixing for a large class of dynamical systems with infinite invariant measure. In particular, we treat intermittent maps including maps with multiple neutral fixed points, nonMarkovian intermittent maps, and…
This paper is a survey of methods for solving smooth (strongly) monotone stochastic variational inequalities. To begin with, we give the deterministic foundation from which the stochastic methods eventually evolved. Then we review methods…
In this work, we propose a global model selection criterion to estimate the graph of conditional dependencies of a random vector based on a finite sample. By global criterion, we mean optimizing a function over the entire set of possible…
This paper surveys various results about Markov chains on general (non-countable) state spaces. It begins with an introduction to Markov chain Monte Carlo (MCMC) algorithms, which provide the motivation and context for the theory which…
We study open-closed discrete mappings that satisfy the weighted estimate of the distortion of modulus of families of paths. It is proved that the mappings mentioned above have a continuous extension into the isolated point of the boundary,…
We consider metrics which are preserved under a $p$-Wasserstein transport map, up to a possible contraction. In the case $p=1$ this corresponds to a metric which is uniformly curved in the sense of coarse Ricci curvature. We investigate the…
This paper investigates when countable graphs have a finite or an infinite chromatic number through model theoretic methods. For Fra\"{i}ss\'{e} limits, we show that instability forces the chromatic number to be infinite, yielding a…
We determine the probability thresholds for the existence of monotone paths, of finite and infinite length, in random oriented graphs with vertex set $\mathbb N^{[k]}$, the set of all increasing $k$-tuples in $\mathbb N$. These graphs…
Using the setting of $G$-metric spaces, common fixed point theorems for four maps satisfying the weakly commuting conditions are obtained for various generalized contractive conditions. Several examples are also presented to show the…
A continuous approximation framework for non-linear stochastic as well as deterministic discrete maps is developed. For the stochastic map with uncorelated Gaussian noise, by successively applying the It\^o lemma, we obtain a Langevin type…
In this paper we investigate the use of staged tree models for discrete longitudinal data. Staged trees are a type of probabilistic graphical model for finite sample space processes. They are a natural fit for longitudinal data because a…
Understanding the dynamics of road networks has theoretical implications for urban science and practical applications for sustainable long-term planning. Various generative models to explain road network growth have been introduced in the…
We present a computational approach for generating Markov bases for multi-way contingency tables whose cells counts might be constrained by fixed marginals and by lower and upper bounds. Our framework includes tables with structural zeros…
We introduce the concept of a 1-coaligned $k$-graph and prove that the shift maps of a $k$-graph pairwise *-commute if and only if the $k$-graph is 1-coaligned. We then prove that for 2-graphs $\Lambda$ generated from basic data *-commuting…
This paper analyzes the performance of sequential importance sampling algorithms for estimating the number of perfect matchings in bipartite graphs. Precise bounds on the number of samples required to yield an accurate estimate are derived.…
We introduce an extension of finite mixture models by incorporating skew-normal distributions within a Hidden Markov Model framework. By assuming a constant transition probability matrix and allowing emission distributions to vary according…