Related papers: Sharp phase transition theorems for hyperbolicity …

In the density model of random groups, we consider presentations with any fixed number m of generators and many random relators of length l, sending l to infinity. If d is a "density" parameter measuring the rate of exponential growth of…

We introduce a new random group model called the square model: we quotient a free group on $n$ generators by a random set of relations, each of which is a reduced word of length four. We prove, as in the Gromov density model, that for…

In this paper, we prove sharpness of the phase transition for the random-cluster model in summable positive external fields, with cluster weight q=2,3,..., on the hypercubic lattice. That is, there exists some nontrivial critical parameter…

We prove that a non-elementary relatively hyperbolic group is statistically hyperbolic with respect to every finite generating set. We also establish statistical hyperbolicity for certain direct products of two groups, one of which is…

We show that low-density random quotients of cubulated hyperbolic groups are again cubulated (and hyperbolic). Ingredients of the proof include cubical small-cancellation theory, the exponential growth of conjugacy classes, and the…

We propose and study a one-dimensional $2\times 2$ hyperbolic Eulerian system with local relaxation from critical threshold phenomena perspective. The system features dynamic transition between strictly and weakly hyperbolic. For different…

The exponential family of random graphs is one of the most promising class of network models. Dependence between the random edges is defined through certain finite subgraphs, analogous to the use of potential energy to provide dependence…

In clean and weakly disordered systems, topological and trivial phases having a finite bulk energy gap can transit to each other via a quantum critical point. In presence of strong disorder, both the nature of the phases and the associated…

For one-dimensional random Schr\"odinger operators, the integrated density of states is known to be given in terms of the (averaged) rotation number of the Pr\"ufer phase dynamics. This paper develops a controlled perturbation theory for…

We consider a model for random hypergraphs with identifiability, an analogue of connectedness. This model has a phase transition in the proportion of identifiable vertices when the underlying random graph becomes critical. The phase…

We propose a new model for random quotients of groups using independent random walks. In this model, we show that random quotients of acylindrical hyperbolic groups asymptotically almost surely remain acylindrically hyperbolic. Our main…

We give a simple combinatorial criterion, in terms of an action on a hyperbolic simplicial complex, for a group to be hierarchically hyperbolic. We apply this to show that quotients of mapping class groups by large powers of Dehn twists are…

We introduce a model for random groups in varieties of $n$-periodic groups as $n$-periodic quotients of triangular random groups. We show that for an explicit $d_{\mathrm{crit}}\in(1/3,1/2)$, for densities $d\in(1/3,d_{\mathrm{crit}})$ and…

The standard $(n, k, d)$ model of random groups is a model where the relators are chosen randomly from the set of cyclically reduced words of length $k$ on an $n$-element generating set. Gromov's density model of random groups considers the…

It is shown that for non-hyperbolic real quadratic polynomials topological and quasisymmetric conjugacy classes are the same. By quasiconformal rigidity, each class has only one representative in the quadratic family, which proves that…

We prove results related to robust transitivity and density of periodic points of Partially Hyperbolic Diffeomorphisms under conditions involving Accessibility and a property in the tangent bundle .

We show that a relatively hyperbolic group either is virtually cyclic or has uniform exponential growth.

We give a quantitative interpretation of the Frequent Hypercyclicity Criterion. Actually we show that an operator which satisfies the Frequent Hypercyclicity Criterion is necessarily A-frequently hypercyclic, where A refers to some weighted…

We establish the conditions under which several algorithmically exploitable structural features hold for random intersection graphs, a natural model for many real-world networks where edges correspond to shared attributes. Specifically, we…

In this paper, we consider accessibility percolation on hypercubes, i.e., we place i.i.d. uniform [0,1] random variables on vertices of a hypercube, and study whether there is a path connecting two vertices such that the values of these…