English
Related papers

Related papers: Edge sliding and ergodic hyperfinite decomposition

200 papers

In this note, we extend results about unique $n^{\textrm{th}}$ roots and cancellation of finite disconnected graphs with respect to the Cartesian, the strong and the direct product, to the rooted hierarchical products, and to a modified…

Combinatorics · Mathematics 2026-01-13 Wilfried Imrich , Igor Klep , Daniel Smertnig

This is a companion paper to the paper "Hyperstability in the Erdos-Sos Conjecture". In that paper the following rough structure theorem was proved for graphs G containing no copy of a bounded degree tree T: from any such G, one can delete…

Combinatorics · Mathematics 2024-09-24 Alexey Pokrovskiy

We determine the structure of automorphism groups of finite graphs of bounded Hadwiger number. Our proof includes a structural analysis of finite edge-transitive graphs. In particular, we show that for connected, $K_{h+1}$-minor-free,…

Combinatorics · Mathematics 2025-09-24 Martin Grohe , Pascal Schweitzer , Daniel Wiebking

We give the analysis of the computational complexity of coalition structure generation over graphs. Given an undirected graph G = (N,E) and a valuation function v : P(N) \to R over the subsets of nodes, the problem is to find a partition of…

Data Structures and Algorithms · Computer Science 2014-01-27 Thomas Voice , Maria Polukarov , Nicholas R. Jennings

We prove that there is a randomized polynomial-time algorithm that given an edge-weighted graph $G$ excluding a fixed-minor $Q$ on $n$ vertices and an accuracy parameter $\varepsilon>0$, constructs an edge-weighted graph~$H$ and an…

Data Structures and Algorithms · Computer Science 2023-04-17 Vincent Cohen-Addad , Hung Le , Marcin Pilipczuk , Michał Pilipczuk

We prove that any ergodic nonatomic probability-preserving action of an irreducible lattice in a semisimple group, at least one factor being connected and higher-rank, is essentially free. This generalizes the result of Stuck and Zimmer…

Dynamical Systems · Mathematics 2016-03-30 Darren Creutz

We relate ergodic-theoretic properties of a very small tree or lamination to the behavior of folding and unfolding paths in Outer space that approximate it, and we obtain a criterion for unique ergodicity in both cases. Our main result is…

Geometric Topology · Mathematics 2014-11-03 Hossein Namazi , Alexandra Pettet , Patrick Reynolds

Given a free group $F_k$ of rank $k\ge 2$ with a fixed set of free generators we associate to any homomorphism $\phi$ from $F_k$ to a group $G$ with a left-invariant semi-norm a generic stretching factor, $\lambda(\phi)$, which is a…

Group Theory · Mathematics 2007-05-23 Vadim Kaimanovich , Ilya Kapovich , Paul Schupp

Let (G,+) be a compact, abelian, and metrizable topological group. In this group we take $g\in G$ such that the corresponding automorphism t_g is ergodic. The main result of this paper is a new ergodic theorem for functions in L^1(G,M),…

Metric Geometry · Mathematics 2018-08-08 Jorge Antezana , Eduardo Ghiglioni , Demetrio Stojanoff

The Addition Theorem for the algebraic entropy of group endomorphisms of torsion abelian groups was proved by Dikranjan, Goldsmith, Salce and Zanardo. It was later extended by Shlossberg to torsion nilpotent groups of class 2. As our main…

Group Theory · Mathematics 2026-01-26 Menachem Shlossberg

We present a new family of zero-field Ising models over N binary variables/spins obtained by consecutive "gluing" of planar and $O(1)$-sized components along with subsets of at most three vertices into a tree. The polynomial time algorithm…

Data Structures and Algorithms · Computer Science 2019-06-18 Valerii Likhosherstov , Yury Maximov , Michael Chertkov

A classical fact in ergodic theory is that ergodicity is equivalent to almost everywhere divergence of ergodic sums of all nonnegative integrable functions which are not identically zero. We show two methods, one in the measure preserving…

Dynamical Systems · Mathematics 2018-02-23 Zemer Kosloff

We present a conceptually clear and algorithmically useful framework for parameterizing the costs of tensor network contraction. Our framework is completely general, applying to tensor networks with arbitrary bond dimensions, open legs, and…

Data Structures and Algorithms · Computer Science 2019-06-04 Bryan O'Gorman

Random directed acyclic graphs (DAGs) based on imposing an order on Erd\H{o}s-R\'enyi and scale free random graphs are widely used for evaluating causal discovery algorithms. We show that in such DAGs, the set of nodes reachable via open…

Methodology · Statistics 2026-05-08 Alexander G. Reisach , Antoine Chambaz , Gilles Blanchard , Sebastian Weichwald

Let $(X,\tau)$ be a Polish space with Borel probability measure $\mu,$ and $G$ a locally finite one-ended Borel graph on $X.$ We show that $G$ admits a Borel one-ended spanning tree generically. If $G$ is induced by a free Borel action of…

Combinatorics · Mathematics 2022-10-27 Matthew Bowen , Antoine Poulin , Jenna Zomback

We give necessary and sufficient conditions for joint ergodicity results of collections of sequences with respect to systems of commuting measure preserving transformations. Combining these results with a new technique that we call…

Dynamical Systems · Mathematics 2024-12-19 Nikos Frantzikinakis , Borys Kuca

Online matching is a fundamental problem in the study of online algorithms. We study the problem under a very general arrival model: the edge arrival model. Free disposal is an important notion in the online matching literature, which…

Data Structures and Algorithms · Computer Science 2024-10-30 Tianle Jiang , Yuhao Zhang

We introduce `braidability' as a new symmetry for (infinite) sequences of noncommutative random variables related to representations of the braid group $B_\infty$. It provides an extension of exchangeability which is tied to the symmetric…

Operator Algebras · Mathematics 2009-11-13 Rolf Gohm , Claus Köstler

The topological Tverberg theorem claims that for any continuous map of the (q-1)(d+1)-simplex to R^d there are q disjoint faces such that their images have a non-empty intersection. This has been proved for affine maps, and if $q$ is a…

Combinatorics · Mathematics 2008-02-25 Stephan Hell

Let $p$ be a prime, let $r$ and $q$ be powers of $p$, and let $a$ and $b$ be relatively prime integers not divisible by $p$. Let $C/\mathbb F_{r}(t)$ be the superelliptic curve with affine equation $y^b+x^a=t^q-t$. Let $J$ be the Jacobian…

Number Theory · Mathematics 2021-08-31 Sarah Arpin , Richard Griffon , Libby Taylor , Nicholas Triantafillou