English
Related papers

Related papers: Three theorems in discrete random geometry

200 papers

We apply a variation on the methods of Duminil-Copin, Raoufi, and Tassion to establish a new differential inequality applying to both Bernoulli percolation and the Fortuin-Kasteleyn random cluster model. This differential inequality has a…

Probability · Mathematics 2020-11-25 Tom Hutchcroft

We consider triangular holes on the hexagonal lattice and we study their interaction when the rest of the lattice is covered by dimers. More precisely, we analyze the joint correlation of these triangular holes in a ``sea'' of dimers. We…

Mathematical Physics · Physics 2007-10-25 Mihai Ciucu

We generalize and strengthen the theorem of Gromov that every compact Riemannian manifold of diameter at most D has a set of generators g_1,...,g_k of length at most 2D and relators of the form g_ig_m = g_j . In particular, we obtain an…

Differential Geometry · Mathematics 2013-09-16 Conrad Plaut , Jay Wilkins

One object of interest in random matrix theory is a family of point ensembles (random point configurations) related to various systems of classical orthogonal polynomials. The paper deals with a one--parametric deformation of these…

Classical Analysis and ODEs · Mathematics 2009-10-31 Alexei Borodin

In a previous work [Scientific Reports 4, 6193(2014)] we proved the existence of scale symmetry in square and triangular (thus honeycomb) lattices by investigating the functiony=\arcsin(\sin(2\pinx)), where the parameter is either the…

Mathematical Physics · Physics 2014-10-21 Cao Zexian

We develop a fluctuation theory of connectivities for subcritical random cluster models. The theory is based on a comprehensive nonperturbative probabilistic description of long connected clusters in terms of essentially one-dimensional…

Probability · Mathematics 2008-08-28 Massimo Campanino , Dmitry Ioffe , Yvan Velenik

Motivated by practical concerns in cryptography, we study pseudorandomness properties of permutations on $\{0,1\}^n$ computed by random circuits made from reversible $3$-bit gates (permutations on $\{0,1\}^3$). Our main result is that a…

Cryptography and Security · Computer Science 2025-02-12 William Gay , William He , Nicholas Kocurek , Ryan O'Donnell

We study the transport properties of directed percolation clusters at the upper critical dimension $d_{c} = 4+1$, where critical fluctuations induce logarithmic corrections to the leading (mean-field) scaling behavior. Employing field…

Statistical Mechanics · Physics 2009-11-10 Olaf Stenull , Hans-Karl Janssen

We present a method of general applicability for finding exact or accurate approximations to bond percolation thresholds for a wide class of lattices. To every lattice we sytematically associate a polynomial, the root of which in $[0,1]$ is…

Statistical Mechanics · Physics 2015-05-14 Christian R. Scullard , Robert M. Ziff

Consider continuous-time linear switched systems on R^n associated with compact convex sets of matrices. When the system is irreducible and the largest Lyapunov exponent is equal to zero, there always exists a Barabanov norm (i.e. a norm…

Optimization and Control · Mathematics 2014-09-17 Yacine Chitour , Moussa Gaye , Paolo Mason

Recently, Ang--Cai--Sun--Wu (2024) determined the three-point connectivity constant for two-dimensional critical percolation, confirming a prediction of Delfino and Viti (2010). In this paper, we address the analogous problem for planar…

Probability · Mathematics 2025-10-08 Gefei Cai , Haoyu Liu , Baojun Wu , Zijie Zhuang

We study the convergence of a discretized Fourier orthogonal expansion in orthogonal polynomials on $B^2 \times [-1,1]$, where $B^2$ is the closed unit disk in $\RR^2$. The discretized expansion uses a finite set of Radon projections and…

Numerical Analysis · Mathematics 2009-06-15 Jeremy Wade

Chiral perturbation theory gives direct and unambiguous predictions for the form of various two-point hadronic correlators at low momentum in terms of a finite set of couplings in a chiral Lagrangian. In this paper we study the feasibility…

High Energy Physics - Lattice · Physics 2016-09-01 A. Duncan , S. Pernice , J. Yoo

This study focuses on defining normal and strictly convex structures within Menger cone PM-space. It also presents a shared fixed point theorem for the existence of two self-mappings constructed on a strictly convex probabilistic cone…

Functional Analysis · Mathematics 2024-09-25 M. H. M. Rashid

In these Notes, a comprehensive description of the universal fractal geometry of conformally-invariant scaling curves or interfaces, in the plane or half-plane, is given. The present approach focuses on deriving critical exponents…

Mathematical Physics · Physics 2007-05-23 Bertrand Duplantier

In this paper we prove that the generalized version of the Minimal Resolution Conjecture stated by Mustata holds for certain general sets of points on a smooth cubic surface $X \subset \mathbb{P}^3$. The main tool used is Gorenstein liaison…

Commutative Algebra · Mathematics 2007-05-23 Marta Casanellas

We introduce the notion of a random relaxed asymptotic contraction in the setting of random normed modules. The contraction condition employs two quasi-metrics that are built directly from the random operator: a lower quasi-metric which…

Functional Analysis · Mathematics 2026-05-07 Jie Shi

We investigate a class of relativistic fermion theories in 2<d<4 space-time dimensions with continuous chiral U(Nf)xU(Nf) symmetry. This includes a number of well-studied models, e.g., of Gross-Neveu and Thirring type, in a unified…

High Energy Physics - Theory · Physics 2015-11-02 Friedrich Gehring , Holger Gies , Lukas Janssen

Topological Data Analysis (TDA) is a field that leverages tools and ideas from algebraic topology to provide robust methods for analysing geometric and topological aspects of data. One of the principal tools of TDA, persistent homology,…

High Energy Physics - Lattice · Physics 2023-02-16 Nicholas Sale , Biagio Lucini , Jeffrey Giansiracusa

Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…

Probability · Mathematics 2007-05-23 Noga Alon , Itai Benjamini , Alan Stacey
‹ Prev 1 8 9 10 Next ›