Related papers: Mixing and equipartition for automorphism invarian…

Many important problems in extremal combinatorics can be stated as certifying polynomial inequalities in graph homomorphism numbers, and in particular, many ask to certify pure binomial inequalities. For a fixed collection of graphs…

Pairwise ordered tree alignment are combinatorial objects that appear in RNA secondary structure comparison. However, the usual representation of tree alignments as supertrees is ambiguous, i.e. two distinct supertrees may induce identical…

We establish a multivariate empirical process central limit theorem for stationary $\R^d$-valued stochastic processes $(X_i)_{i\geq 1}$ under very weak conditions concerning the dependence structure of the process. As an application we can…

We prove that mixing on rank-one transformations is equivalent to the spacer sequence being slice-ergodic. Slice-ergodicity, introduced in this paper, generalizes the notion of ergodic sequence to the uniform convergence of ergodic averages…

Permutation entropy quantifies the diversity of possible orderings of the values a random or deterministic system can take, as Shannon entropy quantifies the diversity of values. We show that the metric and permutation entropy…

We study properties of eigenvalues of a matrix associated with a randomly chosen partial automorphism of a regular rooted tree. We show that asymptotically, as the numbers of levels goes to infinity, the fraction of non-zero eigenvalues…

We discuss a notion of shuffle for trees which extends the usual notion of a shuffle for two natural numbers. We give several equivalent descriptions, and prove some algebraic and combinatorial properties. In addition, we characterize…

We combine conditions found in [Wh] with results from [MPR] to show that quasi-isometries between uniformly discrete bounded geometry spaces that satisfy linear isoperimetric inequalities are within bounded distance to bilipschitz…

Consider a non-elementary Gromov-hyperbolic group $\Gamma$ with a suitable invariant hyperbolic metric, and an ergodic probability measure preserving (p.m.p.) action on $(X,\mu)$. We construct special increasing sequences of finite subsets…

In this paper, unstable metric entropy, unstable topological entropy and unstable pressure for partially hyperbolic endomorphisms are introduced and investigated. A version of Shannon-McMillan-Breiman Theorem is established, and a…

This paper derives a unifying theorem establishing consistency results for a broad class of tree-based algorithms. It improves current results in two aspects. First of all, it can be applied to algorithms that vary from traditional Random…

We make the first steps towards an understanding of the ergodic properties of a rational map defined over a complete algebraically closed non-archimedean field. For such a rational map R, we construct a natural invariant probability measure…

We interpret the probabilistic notion of unimodularity for measures on the space of rooted locally finite connected graphs in terms of the theory of measured equivalence relations. It turns out that the right framework for this consists in…

We prove asymptotic normality for the number of fringe subtrees isomorphic to any given tree in uniformly random trees with given vertex degrees. As applications, we also prove corresponding results for random labelled trees with given…

We establish results with an arithmetic flavor that generalize the polynomial multidimensional Szemeredi theorem and related multiple recurrence and convergence results in ergodic theory. For instance, we show that in all these statements…

We compute the continuous bounded cohomology of the full automorphism groups of regular trees in all positive degrees, with coefficients arising from any irreducible continuous unitary representations. To the author's knowledge, this seems…

Many integrable physical systems exhibit Keplerian shear. We look at this phenomenon from the point of view of ergodic theory, where it can be seen as mixing conditionally to an invariant $\sigma$-algebra. In this context, we give a…

We show that every connected graph can be approximated by a normal tree, up to some arbitrarily small error phrased in terms of neighbourhoods around its ends. The existence of such approximate normal trees has consequences of both…

We provide a new representation of an $\mathbb R$-tree by using a special set of metric rays. We have captured the four-point condition from these metric rays and shown an equivalence between the $\mathbb R$-trees with radial and river…

We study self-similarity in random binary rooted trees. In a well-understood case of Galton-Watson trees, a distribution on a space of trees is said to be self-similar if it is invariant with respect to the operation of pruning, which cuts…