Journal Issue10.1002/RSA.V26:3
Percolation in Voronoi tilings
83
TL;DR: It is proved that for large d, 2-d(9d log d)-1 ≤ pc(d) ≤ C2-d$\sqrt{d}$ log d, and the existence of a phase transition as the proportion p of open cells is varied is proved.
read more
Abstract: We consider a percolation process on a random tiling of Rd into Voronoi cells based on points of a realization of a Poisson process. We prove the existence of a phase transition as the proportion p of open cells is varied and provide estimates for the critical probability pc. Specifically, we prove that for large d, 2-d(9d log d)-1 ≤ pc(d) ≤ C2-d$\sqrt{d}$ log d. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2005
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Introduction to random graphs
Alan Frieze,Michał Karoński +1 more
- 01 Jan 2016
TL;DR: All those interested in discrete mathematics, computer science or applied probability and their applications will find this an ideal introduction to the subject.
A combinatorial characterization of the testable graph properties: it's all about regularity
Noga Alon,Eldar Fischer,Ilan Newman,Asaf Shapira +3 more
- 21 May 2006
TL;DR: One of the main open problems in the area of property-testing, which was raised in the 1996 paper of Goldreich, Goldwasser and Ron, is resolved by a purely combinatorial characterization of the graph properties that are testable with a constant number of queries.
•Book
Algorithmic and Analysis Techniques in Property Testing
Dana Ron
- 27 Jan 2010
TL;DR: This monograph surveys results in property testing, where the emphasis is on common analysis and algorithmic techniques.
A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
TL;DR: This paper shows that in some sense, testing for Szemeredi-partitions is as hard as testing any testable graph property, and gives an intuitive explanation as to what makes a graph property testable.
A characterization of the (natural) graph properties testable with one-sided error
Noga Alon,Asaf Shapira +1 more
- 23 Oct 2005
TL;DR: It is shown that a graph property P has an oblivious one-sided error tester, if and only if P is (semi) hereditary, and infer that some of the most well studied graph properties, both in graph theory and computer science, are testable with one- sided error.
References
Approximating the permanent of graphs with large factors
Paul Dagum,Michael Luby +1 more
TL;DR: The simple algorithm is described, which is an approximation algorithm for the permanent that is a natural simplification of the algorithm suggested by Broder (1986) and analyzed by Jerrum and Sinclair (1988a, b).
104
Bounding Ramsey numbers through large deviation inequalities
TL;DR: A new approach for proving lower bounds for various Ramsey numbers, based on using large deviation inequalities, is developed, that enables the bounds for the off‐diagonal Ramsey numbers R(Kr, Kk), r ≤ k, that match the best known bounds, obtained through the local lemma.
98
The construction of certain graphs
Paul Erdös,C. A. Rogers +1 more
TL;DR: In this article, it was shown that for each pair of positive integers k, l there is an integer f(k, l), which we take to be minimal, such that every graph with f(kn, l) vertices either contains a complete graph of k vertices or a set of l independent points.
92
Matchings in random regular bipartite digraphs
TL;DR: The probability G contains a matching is shown to approach one for large n if d>=2, but to approach zero if d=1, which contrasts with a result of Erdos and Renyi which implies the probability of a matching goes to zero if the number of arcs grows more slowly than n log n.
92
On the independence number of sparse graphs
TL;DR: This work shows for large d that α ≥ c(r)n, the independence number of G, a regular graph of degree d on n points which contains no Kr (r ≥ 4).
87