Related papers: Density of random subsets and applications to grou…
We study a mean field model of a complex network, focusing on edge and triangle densities. Our first result is the derivation of a variational characterization of the entropy density, compatible with the infinite node limit. We then…
Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…
We theoretically investigate the dynamic structure factor of a strongly interacting Fermi gas at the crossover from Bardeen-Cooper-Schrieffer superfluids to Bose-Einstein condensates, by developing an improved random phase approximation…
For subsets X,Y of a finite group G, we write Pr(X,Y) for the probability that two random elements x in X and y in Y commute. This paper addresses the relation between the structure of an approximate subgroup A of G and the probabilities…
In this paper we determine the percolation threshold for an arbitrary sequence of dense graphs $(G_n)$. Let $\lambda_n$ be the largest eigenvalue of the adjacency matrix of $G_n$, and let $G_n(p_n)$ be the random subgraph of $G_n$ obtained…
We find new bounds on the conformal dimension of small cancellation groups. These are used to show that a random few relator group has conformal dimension 2+o(1) asymptotically almost surely (a.a.s.). In fact, if the number of relators…
We revisit the problem of condensation for independent, identically distributed random variables with a power-law tail, conditioned by the value of their sum. For large values of the sum, and for a large number of summands, a condensation…
We study the connections between the notions of combinatorial discrepancy and graph degeneracy. In particular, we prove that the maximum discrepancy over all subgraphs $H$ of a graph $G$ of the neighborhood set system of $H$ is sandwiched…
We describe a simple and yet surprisingly powerful probabilistic technique which shows how to find in a dense graph a large subset of vertices in which all (or almost all) small subsets have many common neighbors. Recently this technique…
The phenomenon of superconvergence is proved for all freely infinitely divisible distributions. Precisely, suppose that the partial sums of a sequence of free identically distributed, infinitesimal random variables converge in distribution…
This paper presents an empirical study of the relationship between the density of small-medium sized random graphs and their planarity. It is well known that, when the number of vertices tends to infinite, there is a sharp transition…
In this paper, we present several density-type theorems which show how to find a copy of a sparse bipartite graph in a graph of positive density. Our results imply several new bounds for classical problems in graph Ramsey theory and improve…
We give some natural sufficient conditions for balls in a metric space to have small intersection. Roughly speaking, this happens when the metric space is (i) expanding and (ii) well-spread, and (iii) a certain random variable on the…
\textit{Let $E$ be an infinite set on which a property $(\bf P)$ is defined. Suppose that $E=\cup_{i\in I} E_i$ is a partition, where each $E_i$ is infinite. Suppose also that, in each $E_i$, the number of elements satisfying $(\bf P)$ is…
The divergence of a group is a quasi-isometry invariant defined in terms of pairs of points and lengths of paths avoiding a suitable ball around the identity. In this paper we study "random divergence'', meaning the divergence at two points…
We derive a message passing method for computing the spectra of locally tree-like networks and an approximation to it that allows us to compute closed-form expressions or fast numerical approximates for the spectral density of random graphs…
Given an infinite group $G$ and a subset $A$ of $G$ we let $\Delta(A) = {g \in G : |gA \cap A| =\infty}$ (this is sometimes called the combinatorial derivation of $A$). A subset $A$ of $G$ is called large if there exists a finite subset $F$…
We study the evolution of a quantum particle interacting with a random potential in the low density limit (Boltzmann-Grad). The phase space density of the quantum evolution defined through the Husimi function converges weakly to a linear…
We study density of rational languages under shift invariant probability measures on spaces of two-sided infinite words, which generalizes the classical notion of density studied in formal languages and automata theory. The density for a…
Szemeredi's regularity lemma is one instance in a family of regularity lemmas, replacing the definition of density of a graph by a more general coefficient. Recently, Fan Chung proved another instance, a regularity lemma for clustering…