Related papers: Connectivity for square percolation and coarse cub…

We consider a family of percolation models in which geometry and connectivity are defined by two independent random processes. Such models merge characteristics of discrete and continuous percolation. We develop an algorithm allowing…

Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…

Let $\Gamma$ be a word hyperbolic group with a cyclic JSJ decomposition that has only rigid vertex groups, which are all fundamental groups of closed surface groups. We show that any group $H$ quasi-isometric to $\Gamma$ is abstractly…

Let $\Gamma=\Gamma(A)$ denote a simple strongly connected digraph with vertex set $X$, diameter $D$, and let $\{A_0,A:=A_1,A_2,\ldots,A_D\}$ denote the set of distance-$i$ matrices of $\Gamma$. Let $\{R_i\}_{i=0}^D$ denote a partition of…

We study the girth of Cayley graphs of finite classical groups G on random sets of generators. Our main tool is an essentially best possible bound we obtain on the probability that a given word w takes the value 1 when evaluated in G in…

A random geometric graph (RGG) with kernel $K$ is constructed by first sampling latent points $x_1,\ldots,x_n$ independently and uniformly from the $d$-dimensional unit sphere, then connecting each pair $(i,j)$ with probability $K(\langle…

Rigidity Percolation with g degrees of freedom per site is analyzed on randomly diluted Erdos-Renyi graphs with average connectivity gamma, in the presence of a field h. In the (gamma,h) plane, the rigid and flexible phases are separated by…

$\gamma$-Liouville quantum gravity ($\gamma$-LQG) constitutes a family of planar random geometries whose geodesics exhibit intricate fractal behaviour. As is observed in various planar models of random geometry as part of the phenomenon of…

Jigsaw percolation is a nonlocal process that iteratively merges connected clusters in a deterministic "puzzle graph" by using connectivity properties of a random "people graph" on the same set of vertices. We presume the Erdos--Renyi…

Given a Coxeter system $(W,S)$ there is a contractible simplicial complex $\Sigma$ called the Davis complex on which $W$ acts properly and cocompactly. In an article of Dymara, the weighted $L^2$-(co)homology groups of $\Sigma$ were…

We consider a class of random, weighted networks, obtained through a redefinition of patterns in an Hopfield-like model and, by performing percolation processes, we get information about topology and resilience properties of the networks…

This article presents a method for finding the critical probability $p_c$ for the Bernoulli bond percolation on graphs with the so-called tree-like structure. Such a graph can be decomposed into a tree of pieces, each of which has finitely…

Let $K$ be a global field of characteristic $p>0$. We study the cohomology of arithmetic subgroups $\Gamma $ of $SL_{n+1}(K)$ (with respect to a fixed place of $K$), under the hypothesis that these groups have no $p'$-torsion (any…

We derive an asymptotic expansion for the critical percolation density of the random connection model as the dimension of the encapsulating space tends to infinity. We calculate rigorously the first expansion terms for the Gilbert disk…

We study the problem of deterministic approximate counting of matchings and independent sets in graphs of bounded connective constant. More generally, we consider the problem of evaluating the partition functions of the monomer-dimer model…

We prove that every right-angled Coxeter group (RACG) is profinitely rigid amongst all Coxeter groups. On the other hand we exhibit RACGs which have infinite profinite genus amongst all finitely generated residually finite groups. We also…

The formation of sintering bridges in amorphous powders affects both flow behavior and perceived material quality. When sintering is driven by surface tension, bridges emerge sequentially, favoring contacts between smaller particles first.…

In this article, we introduce rotation groups as a common generalisation of Coxeter groups and graph products of groups (including right-angled Artin groups). We characterise algebraically these groups by presentations (periagroups) and we…

Let $G$ be a finite group and $\mathcal{C}$ a normal subset of $G$. The Gill-Guillot graph has vertices $\mathcal C$ and $x, y \in \mathcal C$ are adjacent if and only if $x$ and $y$ commute and $\{xy^{-1},x^{-1}y\} \cap \mathcal C$ is…

Given a finite group $G$ with a normal subgroup $N$, the simple graph $\Gamma_\textit{G}( \textit{N} )$ is a graph whose vertices are of the form $|x^G|$, where $x\in{N\setminus{Z(G)}}$, and $x^G$ is the $G$-conjugacy class of $N$…