Related papers: Three theorems in discrete random geometry
A new realization of the conformal algebra is studied which mimics the behaviour of a statistical system on a discrete albeit infinite lattice. The two-point function is found from the requirement that it transforms covariantly under this…
Zariski dense collections of quadratic points on curves $X$ are well-understood by results of Harris--Silverman and Vojta, but when $\dim X \geq 2$ there is not an analogous geometric characterization, even conjecturally. In this note we…
A long-standing conjecture in complex geometry says that a compact Hermitian manifold with constant holomorphic sectional curvature must be K\"ahler when the constant is non-zero and must be Chern flat when the constant is zero. The…
We develop further basic tools in the theory of continuous bounded cohomology of locally compact groups. We apply this tools to establish a Milnor-Wood type inequality in a very general context and to prove a global rigidity result which…
First-passage percolation is the study of the metric space $(\mathbb{Z}^d,T)$, where $T$ is a random metric defined as the weighted graph metric using random edge-weights $(t_e)_{e\in \mathcal{E}^d}$ assigned to the nearest-neighbor edges…
Two vertices are said to be finitely connected if they belong to the same cluster and this cluster is finite. We derive sharp asymptotics for finite connection probabilities for supercritical Bernoulli bond percolation on Z^2.
We give a new proof the arithmetic Hilbert-Samuel theorem by using classical reductions in the theory of coherent sheaves, a direct proof in the case of the projective space and the conservation of some numerical invariants, called…
Euclidean invariant Klein-Gordon, Dirac and massive Chern-Simons field theories are constructed in terms of a random walk with a spin factor on a three dimensional lattice. We exactly calculate the free energy and the correlation functions…
In this dissertation, we show that the Central Limit Theorem and the Invariance Principle for Discrete Fourier Transforms discovered by Peligrad and Wu can be extended to the quenched setting. We show that the random normalization…
In 2010, Duminil-Copin and Smirnov proved a long-standing conjecture of Nienhuis, made in 1982, that the growth constant of self-avoiding walks on the hexagonal (a.k.a. honeycomb) lattice is $\mu=\sqrt{2+\sqrt{2}}.$ A key identity used in…
The problem of continuum percolation in dispersions of rods is reformulated in terms of weighted random geometric graphs. Nodes (or sites or vertices) in the graph represent spatial locations occupied by the centers of the rods. The…
We study bond percolation on the square lattice with one-dimensional inhomogeneities. Inhomogeneities are introduced in the following way: A vertical column on the square lattice is the set of vertical edges that project to the same vertex…
We prove the stability of the critical hypersurfaces associated with the three-dimensional general relativistic Poynting-Robertson effect. The equatorial ring configures to be as a stable attractor and the whole critical hypersurface as a…
We prove that the discrete harmonic function corresponding to smooth Dirichlet boundary conditions on orthodiagonal maps, that is, plane graphs having quadrilateral faces with orthogonal diagonals, converges to its continuous counterpart as…
A discrete Gelfand-Tsetlin pattern is a configuration of particles in Z^2. The particles are arranged in a finite number of consecutive rows, numbered from the bottom. There is one particle on the first row, two particles on the second row,…
We study the effect of positive correlations on the critical threshold of site and bond percolation in a square lattice with d = 2. We propose two algorithms for generating dependent lattices with minimal correlation length and non-negative…
We develop a new technique that allows us to show in a unified way that many well-known combinatorial theorems, including Tur\'an's theorem, Szemer\'edi's theorem and Ramsey's theorem, hold almost surely inside sparse random sets. For…
Construction of a universal finite-type invariant can be reduced, under suitable assumptions, to the solution of certain equations (the hexagon and pentagon equations) in a particular graded associative algebra of chord diagrams. An…
Given $d \in {\bf N}, \lambda >0$, the random connection model in a region $A \subseteq {\bf R}^d$ is a graph with vertex set given by a homogeneous Poisson point process of intensity $\lambda $ in $A$, with an edge placed between each pair…
The cut and project method is a central construction in the theory of Aperiodic Order for generating quasicrystals with pure point diffraction. Linear repetitivity ({\bf LR}) is a form of ideal regularity of aperiodic patterns. Recently,…