اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn Some fundamental aspects of Polyominoes on Random Voronoi Tilings
141
0
0.0
(
0
)
نشر من قبل
Leandro Pimentel Pinto Rodrigues
تاريخ النشر
2010
مجال البحث
فيزياء
والبحث باللغة
English
تأليف
Leandro P. R. Pimentel
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Consider a Voronoi tiling of the Euclidean space based on a realization of a inhomogeneous Poisson random set. A Voronoi polyomino is a finite and connected union of Voronoi tiles. In this paper we provide tail bounds for the number of boxes that are intersected by a Voronoi polyomino, and vice-versa. These results will be crucial to analyze self-avoiding paths, greedy polyominoes and first-passage percolation models on Voronoi tilings and on the dual graph, named the Delaunay triangulation.
قيم البحث
اقرأ أيضاً
Consider an infinite tree with random degrees, i.i.d. over the sites, with a prescribed probability distribution with generating function G(s). We consider the following variation of Renyis parking problem, alternatively called blocking RSA: at every
vertex of the tree a particle (or car) arrives with rate one. The particle sticks to the vertex whenever the vertex and all of its nearest neighbors are not occupied yet. We provide an explicit expression for the so-called parking constant in terms of the generating function.
We consider the free boundary condition Gibbs measure of the Potts model on a random tree. We provide an explicit temperature interval below the ferromagnetic transition temperature for which this measure is extremal, improving older bounds of Mossel
and Peres. In information theoretic language extremality of the Gibbs measure corresponds to non-reconstructability for symmetric q-ary channels. The bounds are optimal for the Ising model and appear to be close to what we conjecture to be the true values up to a factor of 0.0150 in the case q = 3 and 0.0365 for q = 4. Our proof uses an iteration of random boundary entropies from the outside of the tree to the inside, along with a symmetrization argument.
Some stochastic systems are particularly interesting as they exhibit critical behavior without fine-tuning of a parameter, a phenomenon called self-organized criticality. In the context of driven-dissipative steady states, one of the main models is t
hat of Activated Random Walks. Long-range effects intrinsic to the conservative dynamics and lack of a simple algebraic structure cause standard tools and techniques to break down. This makes the mathematical study of this model remarkably challenging. Yet, some exciting progress has been made in the last ten years, with the development of a framework of tools and methods which is finally becoming more structured. In these lecture notes we present the existing results and reproduce the techniques developed so far.
The eigenvalue distribution of the sum of two large Hermitian matrices, when one of them is conjugated by a Haar distributed unitary matrix, is asymptotically given by the free convolution of their spectral distributions. We prove that this convergen
ce also holds locally in the bulk of the spectrum, down to the optimal scales larger than the eigenvalue spacing. The corresponding eigenvectors are fully delocalized. Similar results hold for the sum of two real symmetric matrices, when one is conjugated by a Haar orthogonal matrix.
Our work deals with symmetric rational functions and probabilistic models based on the fully inhomogeneous six vertex (ice type) model satisfying the free fermion condition. Two families of symmetric rational functions $F_lambda,G_lambda$ are defined
as certain partition functions of the six vertex model, with variables corresponding to row rapidities, and the labeling signatures $lambda=(lambda_1ge ldotsge lambda_N)in mathbb{Z}^N$ encoding boundary conditions. These symmetric functions generalize Schur symmetric polynomials, as well as some of their variations, such as factorial and supersymmetric Schur polynomials. Cauchy type summation identities for $F_lambda,G_lambda$ and their skew counterparts follow from the Yang-Baxter equation. Using algebraic Bethe Ansatz, we obtain a double alternant type formula for $F_lambda$ and a Sergeev-Pragacz type formula for $G_lambda$. In the spirit of the theory of Schur processes, we define probability measures on sequences of signatures with probability weights proportional to products of our symmetric functions. We show that these measures can be viewed as determinantal point processes, and we express their correlation kernels in a double contour integral form. We present two proofs: The first is a direct computation of Eynard-Mehta type, and the second uses non-standard, inhomogeneo
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
