Related papers: On Maximal Correlation, Hypercontractivity, and th…

We study bond percolation for a family of infinite hyperbolic graphs. We relate percolation to the appearance of homology in finite versions of these graphs. As a consequence, we derive an upper bound on the critical probabilities of the…

This paper considers the problem of reconstructing $n$ independent uniform spins $X_1,\dots,X_n$ living on the vertices of an $n$-vertex graph $G$, by observing their interactions on the edges of the graph. This captures instances of models…

For $0<q\le 2,\ 1\le k < n,$ let $X=(X_1,...,X_n)$ and $Y=(Y_1,...,Y_n)$ be symmetric $q$-stable random vectors so that the joint distributions of $X_1,...,X_k$ and $X_{k+1},...,X_n$ are equal to the joint distributions of $Y_1,...,Y_k$ and…

Any infinite graph has site and bond percolation critical probabilities satisfying $p_c^{site}\geq p_c^{bond}$. The strict version of this inequality holds for many, but not all, infinite graphs. In this paper, the class of graphs for which…

We determine some points on the finite size scaling curve for the correlation length in the two dimensional O(3) and icosahedron spin models. The Monte Carlo data are consistent with the two models possessing the same continuum limit. The…

We study a variant of the Erd\H{o}s Matching Problem in random hypergraphs. Let $\mathcal{K}_p(n,k)$ denote the Erd\H{o}s-R\'enyi random $k$-uniform hypergraph on $n$ vertices where each possible edge is included with probability $p$. We…

This paper deals with the problem of graph matching or network alignment for Erd\H{o}s--R\'enyi graphs, which can be viewed as a noisy average-case version of the graph isomorphism problem. Let $G$ and $G'$ be $G(n, p)$ Erd\H{o}s--R\'enyi…

We introduce a natural generalization of the Erd\H{o}s-R\'enyi random graph model in which random instances of a fixed motif are added independently. The binomial random motif graph $G(H,n,p)$ is the random (multi)graph obtained by adding…

We study correlation functions of single-cycle chiral operators in the symmetric product orbifold of N supersymmetric four-tori. Correlators of twist operators are evaluated on covering surfaces, generally of different genera, where fields…

We study the rate of correlation decay in the two-dimensional random-field Ising model at weak field strength $\varepsilon$. We combine elements of the recent proof of exponential decay of correlations with a quantitative refinement of a…

The uncertainty relations, pioneered by Werner Heisenberg nearly 90 years ago, set a fundamental limitation on the joint measurability of complementary observables. This limitation has long been a subject of debate, which has been reignited…

Park and Pham's recent proof of the Kahn-Kalai conjecture was a major breakthrough in the field of graph and hypergraph thresholds. Their result gives an upper bound on the threshold at which a probabilistic construction has a $1-\epsilon$…

Correlation functions of operators with a conformal dimension of O(N^2) are not well approximated by the planar limit. The non-planar diagrams, which in the bulk spacetime correspond to string loop corrections, are enhanced by huge…

We develop a statistical theory to characterize correlations in weighted networks. We define the appropriate metrics quantifying correlations and show that strictly uncorrelated weighted networks do not exist due to the presence of…

The crucial aspect of this demonstration is the discovery of renewal events, hidden in the computed dynamics of a multifractal metronome, which enables the replacement of the phenomenon of strong anticipation with a time delayed…

We study the $p$-\emph{torsion function} and the corresponding $p$-\emph{torsional rigidity} associated with $p$-Laplacians and, more generally, $p$-Schr\"odinger operators, for $1<p<\infty$, on possibly infinite combinatorial graphs. We…

Compared to the classical binomial random (hyper)graph model, the study of random regular hypergraphs is made more challenging due to correlations between the occurrence of different edges. We develop an edge-switching technique for…

We develop a cluster expansion for the probability of full connectivity of high density random networks in confined geometries. In contrast to percolation phenomena at lower densities, boundary effects, which have previously been largely…

In their seminal paper introducing the theory of random graphs, Erd\H{o}s and R\'{e}nyi considered the evolution of the structure of a random subgraph of $K_n$ as the density increases from $0$ to $1$, identifying two key points in this…

Consider a random uniform sample of $n$ points in a compact region $A$ of Euclidean $d$-space, $d \geq 2$, with a smooth or (when $d=2$) polygonal boundary. Fix $k \in {\bf N}$. Let $T_{n,k}$ be the threshold $r$ at which the geometric…