Random graph asymptotics on high-dimensional tori II: volume, diameter and mixing time
M Heydenreich, R van der Hofstad - Probability theory and related fields, 2011 - Springer
For critical bond-percolation on high-dimensional torus, this paper proves sharp lower
bounds on the size of the largest cluster, removing a logarithmic correction in the lower …
bounds on the size of the largest cluster, removing a logarithmic correction in the lower …
[引用][C] Random graph asymptotics on high-dimensional tori II: volume, diameter and mixing time
M Heydenreich, R van der Hofstad - Probability Theory and Related …, 2009 - cir.nii.ac.jp
Random graph asymptotics on high-dimensional tori II: volume, diameter and mixing time |
CiNii Research CiNii 国立情報学研究所 学術情報ナビゲータ[サイニィ] 詳細へ移動 検索フォームへ …
CiNii Research CiNii 国立情報学研究所 学術情報ナビゲータ[サイニィ] 詳細へ移動 検索フォームへ …
Random graph asymptotics on high-dimensional tori. II. Volume, diameter and mixing time
M Heydenreich, R van der Hofstad - arXiv, 2009 - dml.mathdoc.fr
For critical bond-percolation on high-dimensional torus, this paper proves sharp lower
bounds on the size of the largest cluster, removing a logarithmic correction in the lower …
bounds on the size of the largest cluster, removing a logarithmic correction in the lower …
Random graph asymptotics on high-dimensional tori II: volume, diameter and mixing time
M Heydenreich, R van der Hofstad - 2011 - opus.bibliothek.uni-augsburg.de
For bond percolation on a graphGwe make any edge (or 'bond') occupiedwith probabilityp,
independently of each other, and otherwise leave itvacant. The connected components of …
independently of each other, and otherwise leave itvacant. The connected components of …
[PDF][PDF] Random graph asymptotics on high-dimensional tori II. Volume, diameter and mixing time
M Heydenreich, R van der Hofstad - arXiv preprint arXiv …, 2009 - eurandom.tue.nl
For critical bond-percolation on high-dimensional torus, this paper proves sharp lower
bounds on the size of the largest cluster, removing a logarithmic correction in the lower …
bounds on the size of the largest cluster, removing a logarithmic correction in the lower …
[PDF][PDF] Random graph asymptotics on high-dimensional tori II. Volume, diameter and mixing time
M Heydenreich, R van der Hofstad - win.tue.nl
For critical (bond-) percolation on general high-dimensional torus, this paper answers the
following questions: What is the diameter of the largest cluster? What is the mixing time of …
following questions: What is the diameter of the largest cluster? What is the mixing time of …
[PDF][PDF] Random graph asymptotics on high-dimensional tori II. Volume, diameter and mixing time
M Heydenreich, R van der Hofstad - arXiv preprint arXiv:0903.4279, 2009 - Citeseer
For critical (bond-) percolation on general high-dimensional torus, this paper answers the
following questions: What is the diameter of the largest cluster? What is the mixing time of …
following questions: What is the diameter of the largest cluster? What is the mixing time of …
[PDF][PDF] Random graph asymptotics on high-dimensional tori II: volume, diameter and mixing time
M Heydenreich, R van der Hofstad - 2009 - alexandria.tue.nl
For critical bond-percolation on high-dimensional torus, this paper proves sharp lower
bounds on the size of the largest cluster, removing a logarithmic correction in the lower …
bounds on the size of the largest cluster, removing a logarithmic correction in the lower …
[PDF][PDF] Random graph asymptotics on high-dimensional tori II. Volume, diameter and mixing time
M Heydenreich, R van der Hofstad - arXiv preprint arXiv …, 2009 - researchgate.net
For critical bond-percolation on high-dimensional torus, this paper proves sharp lower
bounds on the size of the largest cluster, removing a logarithmic correction in the lower …
bounds on the size of the largest cluster, removing a logarithmic correction in the lower …
Random graph asymptotics on high-dimensional tori. II. Volume, diameter and mixing time
M Heydenreich, R van der Hofstad - arXiv preprint arXiv:0903.4279, 2009 - arxiv.org
For critical bond-percolation on high-dimensional torus, this paper proves sharp lower
bounds on the size of the largest cluster, removing a logarithmic correction in the lower …
bounds on the size of the largest cluster, removing a logarithmic correction in the lower …