Related papers: Mixing and equipartition for automorphism invarian…
We study the limiting behavior of multiple ergodic averages involving several not necessarily commuting measure preserving transformations. We work on two types of averages, one that uses iterates along combinatorial parallelepipeds, and…
We prove the existence of a successful coupling for $n$ particles in the symmetric inclusion process. As a consequence we characterize the ergodic measures with finite moments, and obtain sufficient conditions for a measure to converge in…
We survey the definition and some elementary properties of real trees. There are no new results, as far as we know. One purpose is to give a number of different definitions and show the equivalence between them. We discuss also, for…
We combine the parameterization method for invariant manifolds with the finite element method for elliptic PDEs,to obtain a new computational framework for high order approximation of invariant manifolds attached to unstable equilibrium…
This work develops a rigorous framework for analysing ergodicity and mixing in time-inhomogeneous quantum dynamics. It considers quantum evolutions generated by sequences of quantum channels and examines in detail the relationship between…
We give new general formulas for the asymptotics of the number of spanning trees of a large graph. A special case answers a question of McKay (1983) for regular graphs. The general answer involves a quantity for infinite graphs that we call…
We study time-reversal symmetry in dynamical systems with finite phase space, with applications to birational maps reduced over finite fields. For a polynomial automorphism with a single family of reversing symmetries, a universal (i.e.,…
We prove that the restriction of a probability measure invariant under a nonhyperbolic, ergodic and totally irreducible automorphism of a compact connected abelian group to the leaves of the central foliation is severely restricted. We also…
In this paper, we study uniform rooted plane trees with given degree sequence. We show, under some natural hypotheses on the degree sequence, that these trees converge toward the so-called Inhomogeneous Continuum Random Tree after…
Generalizing the classical matrix-tree theorem we provide a formula counting subgraphs of a given graph with a fixed 2-core. We use this generalization to obtain an analog of the matrix-tree theorem for the root system $D_n$ (the classical…
We define an analog of Plancherel measure for the set of rooted unlabeled trees on n vertices, and a Markov chain which has this measure as its stationary distribution. Using the combinatorics of commutation relations, we show that order…
We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…
We estimate the distance in total variation between the law of a finite state Markov process at time t, starting from a given initial measure, and its unique invariant measure. We derive upper bounds for the time to reach the equilibrium.…
The dynamical properties of a tracer or impurity particle immersed in a host gas of inelastic and rough hard spheres in the homogeneous cooling state is studied. Specifically, the breakdown of energy equipartition as characterized by the…
These lecture notes focus on a recent result of Mike Hochman: an arbitrary standard Borel system can be embedded into a mixing Markov with equal entropy, respecting all invariant probability measures, with two exceptions: those carried by…
In this paper we study the following problem. Let $A$ be a fixed graph, and let $\hom(G,A)$ denote the number of homomorphisms from a graph $G$ to $A$. Furthermore, let $v(G)$ denote the number of vertices of $G$, and let $\mathcal{G}_d$…
There are several common ways to encode a tree as a matrix, such as the adjacency matrix, the Laplacian matrix (that is, the infinitesimal generator of the natural random walk), and the matrix of pairwise distances between leaves. Such…
Measuring the complexity of tree structures can be beneficial in areas that use tree data structures for storage, communication, and processing purposes. This complexity can then be used to compress tree data structures to their…
This paper proves that, under a monotonicity condition, the invariant probability measure of a McKean--Vlasov process can be approximated by weighted empirical measures of some processes including itself. These processes are described by…
A remarkable connection has been established for antiferromagnetic 2-spin systems, including the Ising and hard-core models, showing that the computational complexity of approximating the partition function for graphs with maximum degree D…