Related papers: Density of random subsets and applications to grou…
Let $\mathrm{d}(A)$ be the asymptotic density (if it exists) of a sequence of integers $A$. For any real numbers $0\leq\alpha\leq\beta\leq 1$, we solve the question of the existence of a sequence $A$ of positive integers such that…
We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…
We propose a notion of graph convergence that interpolates between the Benjamini--Schramm convergence of bounded degree graphs and the dense graph convergence developed by L\'aszl\'o Lov\'asz and his coauthors. We prove that spectra of…
We prove that random groups in the Gromov density model at density d <1/4 do not have Property (T), answering a conjecture of Przytycki. We also prove similar results in the k-angular model of random groups.
We investigate conformal dimension for the class of infinite hyperbolic groups in the Gromov density model $\mathcal{G}^d_{m,l}$ of random groups with $m \geq 2$ fixed generators, density $0 < d < 1/2$ and relator length $l \to \infty$. Our…
Formulas are derived for the average level density of deformed, or transition, Gaussian orthogonal random matrix ensembles. After some general considerations about Gaussian ensembles we derive formulas for the average level density for (i)…
A random intersection graph is constructed by assigning independently to each vertex a subset of a given set and drawing an edge between two vertices if and only if their respective subsets intersect. In this paper a model is developed in…
This paper studies a statistical network model generated by a large number of randomly sized overlapping communities, where any pair of nodes sharing a community is linked with probability $q$ via the community. In the special case with…
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…
We consider models of random groups in which the typical group is of intermediate rank (in particular, it is not hyperbolic). These models are parallel to M. Gromov's well-known constructions and include for example a "density model" for…
In this work, we define a family of probability densities involving the generalized trigonometric functions defined by Dr\'abek and Man\'asevich [1], which we name Generalized Trigonometric Densities. We show their relationship with the…
Turn the set of permutations of $n$ objects into a graph $G_n$ by connecting two permutations that differ by one transposition, and let $\sigma_t$ be the simple random walk on this graph. In a previous paper, Berestycki and Durrett [In…
We compute the equation of state, the gap as well as the density fluctuations of a two-component superfluid Fermi gas over the whole range of BEC-BCS crossover at vanishing temperature within the functional renormalisation group approach.…
An instance of a random constraint satisfaction problem defines a random subset S (the set of solutions) of a large product space (the set of assignments). We consider two prototypical problem ensembles (random k-satisfiability and…
We propose a novel approach for density estimation with exponential families for the case when the true density may not fall within the chosen family. Our approach augments the sufficient statistics with features designed to accumulate…
In this paper we define the $p$-density of a finite subset $D\subset\ma{N}^r$, and show that it gives a good lower bound for the $p$-adic valuation of exponential sums over finite fields of characteristic $p$. We also give an application:…
A mixing time density of $A + B \to 0$ on a finite one dimensional domain is defined for general initial and boundary conditions in which $A$ and $B$ diffuse at the same rate. The density is a measure of the number of $A$ and $B$ particles…
We introduce a novel set-intersection operator called `most-intersection' based on the logical quantifier `most', via natural density of countable sets, to be used in determining the majority characteristic of a given countable (possibly…
We work in the density model of random groups. We prove that they satisfy an isoperimetric inequality with sharp constant $1-2d$ depending upon the density parameter $d$. This implies in particular a property generalizing the ordinary $C'$…
A group $G$ is said to be intersection-saturated if for every strictly positive integer $n$ and every map $c\colon \mathcal{P}(\{1,\dots, n\})\setminus \emptyset \rightarrow \{0,1\}$, one can find subgroups $H_1,\dots, H_n\leq G$ such that…