Related papers: Ergodic currents dual to a real tree
We study the arboricity A and the maximum number T of edge-disjoint spanning trees of the Erdos-Renyi random graph G(n,p). For all p(n) in [0,1], we show that, with high probability, T is precisely the minimum between delta and…
We construct a piecewise onto 3-to-1 dynamical system on the positive quadrant of the unit circle, such that for rational points (which correspond to normalized Primitive Pythagorean Triples), the associated ternary expansion is finite, and…
We introduce notions of absolutely non-free and perfectly non-free group actions and use them to study the associated unitary representations. We show that every weakly branch group acts absolutely non-freely on the boundary of the…
The ergodic hypothesis is examined for energetically open fluid systems represented by the barotropic Navier--Stokes equations with general inflow/outflow boundary conditions. We show that any globally bounded trajectory generates a…
We show that there are an irrational rotation $Tx=x+\alpha$ on the circle $\mathbb{T}$ and a continuous $\varphi\colon\mathbb{T}\to\mathbb{R}$ such that for each (continuous) uniquely ergodic flow $\mathcal{S}=(S_t)_{t\in\mathbb{R}}$ acting…
We study the continuum limit of adjoint SU(2) LGT by means of a suppression term for Z2 monopoles. High barriers for tunnelling among different twist sectors are overcome through parallel tempering. Monopole condensation is used to study…
Consider a growing system of random walks on the 3,2-alternating tree, where generations of nodes alternate between having two and three children. Any time a particle lands on a node which has not been visited previously, a new particle is…
In this paper we study the ergodic theory of the geodesic flow on negatively curved geometrically finite manifolds. We prove that the measure theoretic entropy is upper semicontinuous when there is no loss of mass. In case we are losing…
We study mean ergodicity in amenable operator semigroups and establish the connection to the convergence of strong and weak ergodic nets. We then use these results in order to show the convergence of uniform families of ergodic nets that…
We prove that if a tree $T$ has $n$ vertices and maximum degree at most $\Delta$, then a copy of $T$ can almost surely be found in the random graph $\mathcal{G}(n,\Delta\log^5 n/n)$.
We prove ergodicity for random dynamics satisfying some expansion and irreducibility conditions. As a particular application, we show that if $R_1,R_2\in \mathrm{SO}(d+1)$, $d\ge 2$, generate a dense subgroup, then the random dynamics of…
Given a spanning tree $T$ of a planar graph $G$, the co-tree of $T$ is the spanning tree of the dual graph $G^*$ with edge set $(E(G)-E(T))^*$. Gr\"unbaum conjectured in 1970 that every planar 3-connected graph $G$ contains a spanning tree…
The notion of tree entropy was introduced by the author as a normalized limit of the number of spanning trees in finite graphs, but is defined on random infinite rooted graphs. We give some new expressions for tree entropy; one uses…
Let $(X, \mathcal{A},\mu)$ be a probability space and let $T$ be a contraction on $L^2(\mu)$. We provide suitable conditions over sequences $(w_k)$, $(u_k)$ and $(A_k)$ in such a way that the weighted ergodic limit…
We prove that, in the random stirring model of parameter T on an infinite rooted tree each of whose vertices has at least two offspring, infinite cycles exist almost surely, provided that T is sufficiently high. In the appendices, the bound…
Given a sequence of curves on a surface, we provide conditions which ensure that (1) the sequence is an infinite quasi-geodesic in the curve complex, (2) the limit in the Gromov boundary is represented by a nonuniquely ergodic ending…
We consider a transformation of a normalized measure space such that the image of any point is a finite set. We call such transformation $m$-transformation. In this case the orbit of any point looks like a tree. In the study of…
The Erd\H{o}s-S\'os Conjecture states that every graph with average degree exceeding $k-1$ contains every tree with $k$ edges as a subgraph. We prove that there are $\delta>0$ and $k_0\in\mathbb N$ such that the conjecture holds for every…
The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an…
Bonato and Tardif conjectured that the number of isomorphism classes of trees mutually embeddable with a given tree T is either 1 or infinite. We prove the analogue of their conjecture for rooted trees. We also discuss the original…