English
Related papers

Related papers: Pointwise ergodic theorem for locally countable qu…

200 papers

We prove an ergodic theorem for Markov chains indexed by the Ulam-Harris-Neveu tree over large subsets with arbitrary shape under two assumptions: with high probability, two vertices in the large subset are far from each other and have…

Probability · Mathematics 2026-03-11 Julien Weibel

We show that ergodic flows in noncommutative fully symmetric spaces (associated with a semifinite von Neumann algebra) generated by continuous semigroups of positive Dunford-Schwartz operators and modulated by bounded Besicovitch almost…

Operator Algebras · Mathematics 2018-09-07 Vladimir Chilin , Semyon Litvinov

We introduce a Markov Chain Monte Carlo algorithm which samples from the space of spanning trees of complete graphs using local rewiring operations only. The probability distribution of graphs of this kind is shown to depend on the…

Discrete Mathematics · Computer Science 2017-11-21 Neal McBride , John Bulava

A measure preserving action of a countably infinite group \Gamma is called totally ergodic if every infinite subgroup of \Gamma acts ergodically. For example, all mixing and mildly mixing actions are totally ergodic. This note shows that if…

Dynamical Systems · Mathematics 2012-08-06 Robin Tucker-Drob

The culmination of the papers (arXiv:0905.0518, arXiv:0910.0909) was a proof of the norm convergence in $L^2(\mu)$ of the quadratic nonconventional ergodic averages \frac{1}{N}\sum_{n=1}^N(f_1\circ T_1^{n^2})(f_2\circ…

Dynamical Systems · Mathematics 2010-05-25 Tim Austin

Sidorenko's conjecture states that, for all bipartite graphs $H$, quasirandom graphs contain asymptotically the minimum number of copies of $H$ taken over all graphs with the same order and edge density. While still open for graphs, the…

Combinatorics · Mathematics 2024-05-28 David Conlon , Joonkyung Lee , Alexander Sidorenko

In this paper, we develop the theory of Sobolev spaces on locally finite graphs, including completeness, reflexivity, separability, and Sobolev inequalities. Since there is no exact concept of dimension on graphs, classical methods that…

Analysis of PDEs · Mathematics 2023-06-28 Mengqiu Shao , Yunyan Yang , Liang Zhao

Nowhere dense classes of graphs are very general classes of uniformly sparse graphs with several seemingly unrelated characterisations. From an algorithmic perspective, a characterisation of these classes in terms of uniform quasi-wideness,…

Discrete Mathematics · Computer Science 2018-09-06 Stephan Kreutzer , Roman Rabinovich , Sebastian Siebertz

We give new examples and describe the complete lists of all measures on the set of countable homogeneous universal graphs and $K_s$-free homogeneous universal graphs (for $s\geq 3$) that are invariant with respect to the group of all…

Combinatorics · Mathematics 2009-06-30 F. V. Petrov , A. M. Vershik

This is an earlier, but more general, version of "An L^1 Ergodic Theorem for Sparse Random Subsequences". We prove an L^1 ergodic theorem for averages defined by independent random selector variables, in a setting of general…

Dynamical Systems · Mathematics 2008-12-17 Patrick LaVictoire

We strengthen the maximal ergodic theorem for actions of groups of polynomial growth to a form involving jump quantity, which is the sharpest result among the family of variational or maximal ergodic theorems. As a consequence, we deduce in…

Dynamical Systems · Mathematics 2026-01-14 Guixiang Hong , Wei Liu

Denote by $\mathcal{H}_k (n,p)$ the random $k$-graph in which each $k$-subset of $\{1... n\}$ is present with probability $p$, independent of other choices. More or less answering a question of Balogh, Bohman and Mubayi, we show: there is a…

Combinatorics · Mathematics 2016-08-17 Arran Hamm , Jeff Kahn

For an increasing monotone graph property $\mP$ the \emph{local resilience} of a graph $G$ with respect to $\mP$ is the minimal $r$ for which there exists of a subgraph $H\subseteq G$ with all degrees at most $r$ such that the removal of…

Combinatorics · Mathematics 2011-02-01 Sonny Ben-Shimon , Michael Krivelevich , Benny Sudakov

We give a notion of boundary pair $(\mathcal{B}_-,\mathcal{B}_+)$ for measured groupoids which generalizes the one introduced by Bader and Furman \cite{BF14} for locally compact groups. In the case of a semidirect groupoid…

Dynamical Systems · Mathematics 2026-03-04 Filippo Sarti , Alessio Savini

The main result of this note, Theorem 2, is the following: a Borel measure on the space of infinite Hermitian matrices, that is invariant under the action of the infinite unitary group and that admits well-defined projections onto the…

Dynamical Systems · Mathematics 2011-08-16 Alexander I. Bufetov

We consider infinite connected quasi-transitive locally finite graphs and show that every such graph with more than one end is a tree amalgamation of two other such graphs. This can be seen as a graph-theoretical version of Stallings'…

Combinatorics · Mathematics 2019-06-19 Matthias Hamann , Florian Lehner , Babak Miraftab , Tim Rühmann

Let $G$ be a locally compact group with the left Haar measure $m_{G}$. A probability measure ${\mu}$ on $G$ is said to be strictly aperiodic if the support of ${\mu}$ is not contained in a proper closed left coset of $G$. In this paper, we…

Functional Analysis · Mathematics 2023-02-13 H. S. Mustafayev

We prove a multidimensional ergodic theorem with weighted averages for the action of the group $\mathbb{Z}^d$ on a probability space. At level $n$ weights are of the form $n^{-d} \psi(j/n)$, $ j\in \mathbb{Z}^d$, for real functions $\psi$…

Probability · Mathematics 2024-11-19 A. Faggionato

In \cite{Kramer11} Kramer proves for a large class of semisimple Lie groups that they admit just one locally compact $\sigma$-compact Hausdorff topology compatible with the group operations. We present two different methods of generalising…

Group Theory · Mathematics 2014-11-06 Rupert McCallum

We use the theory of graph limits to study several quasi-random properties, mainly dealing with various versions of hereditary subgraph counts. The main idea is to transfer the properties of (sequences of) graphs to properties of graphons,…

Combinatorics · Mathematics 2009-05-21 Svante Janson