Indexing metadata

Percolation in an ultrametric space


 
Dublin Core PKP Metadata Items Metadata for this Document
 
1. Title Title of document Percolation in an ultrametric space
 
2. Creator Author's name, affiliation, country Donald A. Dawson; Carleton University; Canada
 
2. Creator Author's name, affiliation, country Luis G. Gorostiza; CINVESTAV, Mexico City; Mexico
 
3. Subject Discipline(s)
 
3. Subject Keyword(s) Percolation; hierarchical graph; ultrametric; renormalization
 
3. Subject Subject classification 05C80;60K35;82B43
 
4. Description Abstract

We study percolation in the hierarchical lattice of order N where the probability of connection between two points separated by distance k is of the form ck/Nk(1+δ), δ>-1. Since the distance is an ultrametric, there are significant differences with percolation in the Euclidean lattice. We consider three regimes: δ<1, where percolation occurs, δ>1, where it does not occur and δ=1 which is the critical case corresponding to the phase transition. In the critical case we use an approach in the spirit of the renormalization group method of statistical physics, and connectivity results of Erdős-Rényi random graphs play a key role. We find sufficient conditions on ck such that percolation occurs, or that it does not occur. An intermediate situation called pre-percolation, which is necessary for percolation, is also considered. In the cases of percolation we prove uniqueness of the constructed percolation clusters. In a previous paper we studied percolation in the N→∞ limit (mean field percolation), which provided a simplification that allowed finding a necessary and sufficient condition for percolation. For fixed N there are open questions, in particular regarding the behaviour at the critical values of parameters in the definition of ck. Those questions suggest the need to study ultrametric random graphs.

 
5. Publisher Organizing agency, location
 
6. Contributor Sponsor(s) NSERC, CONACyT grant 98998
 
7. Date (YYYY-MM-DD) 2013-01-23
 
8. Type Status & genre Peer-reviewed Article
 
8. Type Type
 
9. Format File format PDF
 
10. Identifier Uniform Resource Identifier http://ejp.ejpecp.org/article/view/1789
 
10. Identifier Digital Object Identifier 10.1214/EJP.v18-1789
 
11. Source Journal/conference title; vol., no. (year) Electronic Journal of Probability; Vol 18
 
12. Language English=en en
 
14. Coverage Geo-spatial location, chronological period, research sample (gender, age, etc.)
 
15. Rights Copyright and permissions The Electronic Journal of Probability applies the Creative Commons Attribution License (CCAL) to all articles we publish in this journal. Under the CCAL, authors retain ownership of the copyright for their article, but authors allow anyone to download, reuse, reprint, modify, distribute, and/or copy articles published in EJP, so long as the original authors and source are credited. This broad license was developed to facilitate open access to, and free use of, original works of all types. Applying this standard license to your work will ensure your right to make your work freely and openly available.

Summary of the Creative Commons Attribution License

You are free
  • to copy, distribute, display, and perform the work
  • to make derivative works
  • to make commercial use of the work
under the following condition of Attribution: others must attribute the work if displayed on the web or stored in any electronic archive by making a link back to the website of EJP via its Digital Object Identifier (DOI), or if published in other media by acknowledging prior publication in this Journal with a precise citation including the DOI. For any further reuse or distribution, the same terms apply. Any of these conditions can be waived by permission of the Corresponding Author.