\documentclass[b5paper,10pt,fleqn]{book}

\usepackage{InfalgMaj28}
\addtocounter{chapter}{2}
\addtocounter{section}{0}
\makeindex


\begin{document}
\Large
\begin{center}
\textbf{PERCOLATION}
\end{center}
\normalsize 
This list is based on \textit{Computing Reviews}, \textit{Mathematical Reviews}, 
\textit{Zentralblatt 
für Mathematik}, \textit{Current Mathematical Publications}, home pages 
of \textit{Barnesandnoble} and \textit{Amazon}, recent numbers 
of journals, Arxiv.org and personal communications. Abbreviations: \textbf{E} english, 
\textbf{F} French, \textbf{G} German, \textbf{H} Hungarian, \textbf{L} 
library, \textbf{R} Russian, @ \texttt{electronic address}.

\begin{center}
\textbf{BOOKS ON PERCOLATION}
\end{center}

\textbf{1978:} R. T. Smythe, John C. Wierman: \textit{First-Passage Percolation on the Square Lattice.} 
Springer-Verlag, Berlin, 1978. 201 oldal, 42 hivatkozás. ISBN 3-540-08928-4. \textbf{L} 

\textbf{1983:} B. D. Hughes, B. W. Ninham: \textit{The Mathematics and Physics of Disordered Media.} 
Springer-Verlag, Berlin, 1978. 431 oldal, ?? hivatkozás. ISBN 3-387-12707-0. \textbf{L}

\textbf{1985:} Dietrich \hrefun{http://www.thp.uni-koeln.de/personal/stauffer.html}{Stauffer}: 
\textit{Introduction to Percolation Theory.} Taylor \& Francis, London, 1985. 124 oldal, 
ISBN 0-85066-315-6. \textbf{L}

\textbf{1994:} Dietrich \hrefun{http://www.thp.uni-koeln.de/personal/stauffer.html}{Stauffer}, 
A. Aharony: \textit{Introduction to Percolation Theory.} CRC Press; 2nd edition, London, 1994. 190 oldal, 
ISBN 0748402535. 

\textbf{1996:} Ronald Meester, Rahul Roy, B. Bollobas: 
\textit{Continuum Percolation (Cambridge Tracts in Mathematics. 129).} 
Cambridge University Press, 1996. ISBN 052147504X, 250 oldal. 

\textbf{1999:} Geoffrey Grimmett: \textbf{Percolation (Grundlehren der mathematischen Wissenschaften. Vol. 321)}.
Springer, 2 edition. 1999,  444 oldal, ISBN 3540649026.

 
\begin{center}
\textbf{PAPERS ON PERCOLATION} \\
\end{center}

\textbf{1985} \hrefun{http://people.inf.elte.hu/tony}{Iványi}, Antal; \hrefun{mailto:katai@comaplg.inf.elte.hu}{Kátai}, Imre: 
Modeling of priorityless processing in an interleaved memory 
with a perfectly informed processor. 
\textit{Autom. Remote Control} \textbf{46/4} (1985), 520--526. Fordítás oroszból:  
\textit{Avtom. Telemekh.} \textbf{46/4} (1985), 129--136. ZB 581.68035 \textbf{L} 
@ \hrefun{mailto:tony@compalg.inf.elte.hu}{tony@compalg.inf.elte.hu} \\

\textbf{2000} \hrefun{http://www.cs.bu.edu/fac/gacs/}{Gács}, Péter: The clairvoyant demon has a hard task. 
\hrefun{http://journals.cambridge.org/bin/bladerunner?REQUNIQ=1117982614&REQSESS=9816224&116000REQEVENT=&REQSTR1=CPC&REQAUTH=0}
{\textit{Combin.}} \textit{Probab. Comput.} \textbf{9/5} (2000), 421--424.
MR1810149 (68R10, 05C80 60C05 60K35 68M14 82B43). \textbf{E} \\

\textbf{2002} \hrefun{http://www.cs.bu.edu/fac/gacs/}{Gács}, Péter: 
\hrefun{http://www.cs.bu.edu/fac/gacs/recent-publ.html}{Clairvoyant} Scheduling of Random Walks 
(submitted to \textit{Electronic Journal of Probability}). 
Rövid változat:  Clairvoyant scheduling of random walks. 
In \textit{Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing,} 
99--108 (electronic), ACM, New York, 2002. MR2121131 (05C85, 60G50). \textbf{E} \\

\textbf{2004}   Alon, Noga; Benjamini, Itai; Stacey, Alan: 
Percolation on finite graphs and isoperimetric inequalities. 
\textit{Ann. Probab.} \textbf{32/3A} (2004), 1727--1745. MR2073175


Balister, Paul; Bollobás, Béla; Walters, Mark: 
Continuum percolation with steps in an annulus. 
\textit{Ann. Appl. Probab.} \textbf{14/4} (2004), 1869--1879. 
\hrefun{http://arxiv.org/find}{http://arxiv.org/find}
\textbf{E}


Friedli, Sacha; de Lima, Bernardo Nunes Borges; Sidoravicius, Vladas 
On long range percolation with heavy tails. \textit{Electron. Comm. Probab.} \textbf{9} 
(2004), 175--177 (electronic). MR2108864 \textbf{E}


\hrefun{http://www.cs.bu.edu/fac/gacs/}{Gács}, Péter: 
Compatible sequences and a slow Winkler percolation. 
\hrefun{http://journals.cambridge.org/bin/bladerunner?REQUNIQ=1117982614&REQSESS=9816224&116000REQEVENT=&REQSTR1=CPC&REQAUTH=0}
{\textit{Combin.}} \textit{Probab. Comput.} \textbf{13/6} (2004), 815--856. 
MR2102411 (60C05, 60K35) \textbf{E} 

Howard, C. Douglas: Models of first-passage percolation. 
\textit{Probability on discrete structures,} 125--173, Encyclopaedia Math. Sci., 
110, Springer, Berlin, 2004. MR2023652

Lin, Xue; Wierman, John C. Cycles as constraint graphs in multi-type percolation. 
Proceedings of the Thirty-Fifth Southeastern International Conference on Combinatorics, 
Graph Theory and Computing. \textit{Congr. Numer.} \textbf{171} (2004), 67--75. MR2122098 \textbf{L}
 
Wierman, John C.; Cheng, Rulian; May, William D. Estimating bond percolation thresholds using 
the substitution method. Proceedings of the Thirty-Fifth Southeastern International 
Conference on Combinatorics, Graph Theory and Computing. \textit{Congr. Numer.} 
\textbf{170} (2004), 113--122. MR2122081 (Review) 

 van der Hofstad, Remco; Járai, Antal A. 
 The incipient infinite cluster for high-dimensional unoriented percolation. 
 \textit{J. Statist. Phys.} \textbf{114/3-4} (2004), 625--663. \linebreak MR2035627


\textbf{2005}  Balister, P.; Bollobás, Béla; Quas, A. Percolation in Voronoi tilings. 
\textit{Random Structures Algorithms} \textbf{26/3} (2005), 310--318. MR2127372

Balogh, József; Peres, Yuval; Pete, Gábor: Bootstrap percolation on infinite trees and non-amenable groups.
(17 pages, 2 figures. This is the final version, for the journal 
\textit{Combinatorics, Probability and Computing.} Proposition 1.5 is new, proving the "intuitively clear 
statement" left open in the previous versions. \hrefun{http://arxiv.org/find}{http://arxiv.org/find} \textbf{E}

Bela Bollobas, Oliver Riordan: Sharp thresholds and percolation in the plane.
(26 pages, 7 figures, MSC-class: 60K35; 82B43). \hrefun{http://arxiv.org/find}{http://arxiv.org/find} \textbf{E}

Bollobas, Béla; Riordan, OLiver: The critical probability for random Voronoi percolation in the plane is 1/2. 
(54 pages, 19 figures, MSC-class: 60K35; 82B43). \hrefun{http://arxiv.org/find}{http://arxiv.org/find}. \textbf{E}

Derényi Imre, Palla Gergely, Vicsek Tamás: Clique percolation in random networks. \textit{Phys. Rev. Lett} 
\textbf{94} (2005) 160--202. \\ 
\hrefun{http://arxiv.org/find}{http://arxiv.org/find}  \textbf{E}

Heicklen, Deborah; Hoffman, Christopher Return probabilities of a simple random walk on percolation clusters. 
Electronic Journal of Probability \textbf{10/8} (2005), 250--302 (electronic). MR2120245 \textbf{E}

 Hammond, Alan Critical exponents in percolation via lattice animals. 
 Electronic Comm. Probab. 10 (2005), 45--59 (electronic). MR2119153 \textbf{E}

Gergely Palla, Imre Derényi, Illés Farkas, Tamás Vicsek: 
Uncovering the overlapping community structure of complex networks in nature and society 
\textit{Nature} \textbf{435}, 814-818 (09 Jun 2005) Letters to Editor. \\
\hrefun{http://www.nature.com/}{http://www.nature.com/}

 
Ritchie, Thomas Logan; Belitsky, Vladimir: Improved Lower Bounds for the Critical 
Probability of Oriented-Bond Percolation in Two Dimensions.
(Comments: 16 pages, 5 figures, MSC-class: 60K35). \hrefun{http://arxiv.org/find}{http://arxiv.org/find} 
\textbf{E}

\begin{center}
\textbf{MATHEMATICAL BACKGROUND} \\
\end{center}
\textbf{1968} Feller, William: \textit{An Introduction to Probability Theory and its Applications.}
John Wiley and Sons, New York, 1968. Magyarul: \textit{Bevezetés a valószínûségszámításba és alkalmazásaiba.}
\hrefun{http://www.muszakikiado.hu/kezdolap.php}{Mûszaki} Könyvkiadó, Budapest, 1978. \textbf{L} \\

\textbf{1997} \hrefun{www-cs-faculty.stanford.edu/~knuth/}{Knuth}, Donald Ervin:
\textit{The Art of Computer Programming. Vol. 1. Fundamental Algorithms.}
\hrefun{http://www.aw.com/}{Addison}-Wesley, 1997 (3., javított kiadás). 
Magyarul: \textit{A számítógép-programozás mûvészete. 1. kötet. Alapvetõ algoritmusok}, 
\hrefun{http://www.muszakikiado.hu/kezdolap.php}{Mûszaki} Könyvkiadó, 1993, 2. kiadás.)

\textbf{1999} Stanley, Richard P.: \textit{Enumerative Combinatorics, Volume 2.} Cambridge Studies 
in Advanced Mathematics, \textbf{62.} Cambridge University Press, Cambridge, 1999.
Stanley

\textbf{2001} \hrefun{http://math.ubbcluj.ro/~bege/}{Bege}, Antal 
and \hrefun{http://www.cs.ubbcluj.ro/~kasa/}{Kása}, Zoltán: Coding objects related to Catalan numbers. 
\textit{Studia Univ. Babes-Bolyai, Informatica} Volume \textbf{XLVI/1} (2001), 31--39.

\hrefun{http://www.cs.dartmouth.edu/~thc/}{Cormen}, Thomas H., 
\hrefun{http://theory.lcs.mit.edu/~cel/}{Leiserson}, Charles E., 
\hrefun{http://theory.lcs.mit.edu/~rivest/}{Rivest}, Ronald E., \hrefun{http://www.ieor.columbia.edu/~cliff/}{Stein},
Clifford: \textit{Introduction to Algorithms}, 
The \hrefun{http://mitpress.mit.edu/main/home/default.asp?sid=C6EE87F7-92B7-4CC1-8035-E3AB8EAC0886}{MIT} 
Press/\hrefun{www.mcgraw-hill.com/}{McGraw}-Hill, 2004 (Második kiadás ötödik, javított utánnyomása. 
Magyarul: \textit{Új algoritmusok.} \hrefun{www.scolar.hu}{Scolar} Kiadó, 2003). \\

\textbf{2004} \hrefun{www.cs.ubbcluj.ro/~kasa/}{Kása}, Zoltán: Rekurzív egyenletek. 
In: \textit{Informatikai algoritmusok. 1} (szerk. Iványi Antal). 
ELTE \hrefun{http://www.elte.hu/szervezet/eotvos_kiado.html}{Eötvös} Kiadó, Budapest, 2004. 14--37.

\begin{center}
\textbf{INTERNET SITES} \\
\end{center}
Arxiv.org: \hrefun{http://arxiv.org/find}{http://arxiv.org/find} \\
Bookshop \textit{Amazon}: \texttt{http://www.amazon.com} \\
Bookshop \textit{Barnesandnoble}: 
    \texttt{http://shop.barnesandnoble.com/booksearch} \\
Electronic Journals of \textit{EMIS}: \texttt{http://www.emis/journals} \\
Mathematical Reviews: \texttt{http://www.acm.org/mathscinet} \\
Zentralblatt f\"ur Mathematik: \texttt{http://www.emis/ZMATH} \\

Budapest, June 13, 2005. \hspace{2cm} Antal Iv\'anyi (tony@compalg.inf.elte.hu) 
\end{document}

\begin{thebibliography}{10}
\normalsize


\end{thebibliography}
