Related papers: Markov random fields and iterated toric fibre prod…

The Markov group conjecture, a long-standing open problem in the theory of Markov processes with countable state space, asserts that a strongly continuous Markov semigroup $T = (T_t)_{t \in [0,\infty)}$ on $\ell^1$ has bounded generator if…

We consider unimodular random rooted trees (URTs) and invariant forests in Cayley graphs. We show that URTs of bounded degree are the same as the law of the component of the root in an invariant percolation on a regular tree. We use this to…

We prove that every (possibly infinite) graph of degree at most $d$ has a 4-dependent random proper $4^{d(d+1)/2}$-coloring, and one can construct it as a finitary factor of iid. For unimodular transitive (or unimodular random) graphs we…

We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of a previous one, designed to generate acyclic digraphs, non…

By a finite type-graph we mean a graph whose set of vertices is the set of all $k$-subsets of $[n]=\{1,2,\ldots, n\}$ for some integers $n\ge k\ge 1$, and in which two such sets are adjacent if and only if they realise a certain order type…

Given two convex polytopes, the join, the cartesian product and the direct sum of them are well understood. In this paper we extend these three kinds of products to abstract polytopes and introduce a new product, called the topological…

Braided tensor products have been introduced by the author as a systematic way of making two quantum-group-covariant systems interact in a covariant way, and used in the theory of braided groups. Here we study infinite braided tensor…

A self-similar group of finite type is the profinite group of all automorphisms of a regular rooted tree that locally around every vertex act as elements of a given finite group of allowed actions. We provide criteria for determining when a…

Let G_1,...,G_q be algebraic varieties over a finite field k. We show that, if q >1, the finiteness of the tensor product of G_1, ...,G_q as Mackey functors. We apply this to prove the finiteness of a relative Chow group and an abelian…

We derive conditions on the products of stochastic matrices guaranteeing the existence of a unique limit invariant distribution. Belying our approach is the hereby defined notion of restricted triangulated Laman graphs. The main idea is the…

We discuss the problem of defining a tensor product of profinitely many copies of a vector space $V$, and propose a definition $\bigotimes_X^{\mathrm{mcc}} V$ in the special situation that (1) $V$ is finite-dimensional over $\mathbf{F}_2$,…

Markov chains are used to give a purely probabilistic way of understanding the conjugacy classes of the finite symplectic and orthogonal groups in odd characteristic. As a corollary of these methods one obtains a probabilistic proof of…

Recent work suggests that topological features of certain quantum gravity theories can be interpreted as particles, matching the known fermions and bosons of the first generation in the Standard Model. This is achieved by identifying…

We prove that for a suitable class of representations of free group tensor products are generically irreducible. In particular we prove that there exist irreducible boundary realizations with infinite dimensional fiber.

Conditional independence and Markov properties are powerful tools allowing expression of multidimensional probability distributions by means of low-dimensional ones. As multidimensional possibilistic models have been studied for several…

Given an edge-independent random graph G(n,p), we determine various facts about the cohomology of graph products of groups for the graph G(n,p). In particular, the random graph product of a sequence of finite groups is a rational duality…

The extremes of a univariate Markov chain with regulary varying stationary marginal distribution and asymptotically linear behavior are known to exhibit a multiplicative random walk structure called the tail chain. In this paper, we extend…

We study multifractal decompositions based on Birkhoff averages for sequences of functions belonging to certain classes of symbolically continuous functions. We do this for an expanding interval map with countably many branches, which we…

The successive discrete structures generated by a sequential algorithm from random input constitute a Markov chain that may exhibit long term dependence on its first few input values. Using examples from random graph theory and search…

We consider irreversible Markov chains on finite commutative rings randomly generated using both addition and multiplication. We restrict ourselves to the case where the addition is uniformly random and multiplication is arbitrary. We first…