Related papers: Property (T) in density-type models of random grou…

Let $\Gamma$ be a sub-semigroup of $G=GL(d,\mathbb R),$ $d>1.$ We assume that the action of $\Gamma$ on $\R^d$ is strongly irreducible and that $\Gamma$ contains a proximal and expanding element. We describe contraction properties of the…

We prove that every sofic approximation of a property (T) group is approximately isomorphic to one having geometric property (T), and more generally, a box space of graphs which has boundary geometric property (T) is approximately…

Let $\Gamma $ be an infinite discrete group and $\mathsf{A}\subset \Gamma $ a nonempty finite subset. The set of permutations $\sigma $ of $\Gamma $ such that $s^{-1}\sigma (s)\in \mathsf{A}$ for every $s\in \Gamma $ can be identified with…

For a finite state Markov process and a finite collection $\{ \Gamma_k, k \in K \}$ of subsets of its state space, let $\tau_k$ be the first time the process visits the set $\Gamma_k$. We derive explicit/recursive formulas for the joint…

For an arbitrary discrete probability-measure-preserving groupoid $G$, we provide a characterization of property (T) for $G$ in terms of the groupoid von Neumann algebra $L(G)$. More generally, we obtain a characterization of relative…

Consider a class of probability distributions which is dense in the space of all probability distributions on $\mathbb{R}^{d}$ with respect to weak convergence, for every $d\in\mathbb{N}$. Then, we construct various explicit classes of…

We show that, for a finitely generated residually finite group $\Gamma$, the word $[x_1, \ldots, x_k]$ is a probabilistic identity of $\Gamma$ if and only if $\Gamma$ is virtually nilpotent of class less than $k$. Related results,…

We study the largest component of a random (multi)graph on n vertices with a given degree sequence. We let n tend to infinity. Then, under some regularity conditions on the degree sequences, we give conditions on the asymptotic shape of the…

Consider a uniformly sampled random $d$-regular graph on $n$ vertices. If $d$ is fixed and $n$ goes to $\infty$ then we can relate typical (large probability) properties of such random graph to a family of invariant random processes (called…

Property $(TTT)$ was introduced by Ozawa as a strengthening of Kazhdan's property $(T)$ and Burger and Monod's property $(TT)$. In this paper, we improve Ozawa's result by showing that any simple algebraic group of rank $\geq 2$ over a…

We consider a transitive action of a finitely generated group $G$ and the Schreier graph $\Gamma$ defined by this action for some fixed generating set. For a probability measure $\mu$ on $G$ with a finite first moment we show that if the…

Let $\Gamma$ be a discrete group with property $(T)$ of Kazhdan. We prove that any Riemannian isometric action of $\Gamma$ on a compact manifold $X$ is locally rigid. We also prove a more general foliated version of this result. The…

Suppose that $\Gamma=(V,E)$ is a graph with vertices $V$, edges $E$, a free group action on the vertices $\mathbb{Z}^d \curvearrowright V$ with finitely many orbits, and a linear operator $D$ on the Hilbert space $l^2(V)$ such that $D$…

We introduce a density model for random quotients of a free product of finitely generated groups. We prove that a random quotient in this model has the following properties with overwhelming probability: if the density is below $1/2$, the…

We introduce the notion of the $k$-closure of a group of automorphisms of a locally finite tree, and give several examples of the construction. We show that the $k$-closure satisfies a new property of automorphism groups of trees that…

The $(t,r)$ broadcast domination number of a graph $G$, $\gamma_{t,r}(G)$, is a generalization of the domination number of a graph. $\gamma_{t,r}(G)$ is the minimal number of towers needed, placed on vertices of $G$, each transmitting a…

Finding models for linear-time properties is a central problem in verification and planning. We study the distribution of linear-time models by investigating the density of linear-time properties over the space of ultimately periodic words.…

For a graph $G$, we write $G\rightarrow \big(K_{r+1},\mathcal{T}(n,D)\big)$ if every blue-red colouring of the edges of $G$ contains either a blue copy of $K_{r+1}$, or a red copy of each tree with $n$ edges and maximum degree at most $D$.…

Let $w \in F_2$ be a word and let $m$ and $n$ be two positive integers. We say that a finite group $G$ has the $w_{m,n}$-property if however a set $M$ of $m$ elements and a set $N$ of $n$ elements of the group is chosen, there exist at…

We say that $x,y\in \Gamma$ are in the same $\phi$-twisted conjugacy class and write $x\sim_\phi y$ if there exists an element $\gamma\in \Gamma$ such that $y=\gamma x\phi(\gamma^{-1})$. This is an equivalence relation on $\Gamma$ called…