×

Found 142 Documents (Results 1–100)

The giant component and 2-core in sparse random outerplanar graphs. (English) Zbl 07651057

Drmota, Michael (ed.) et al., 31st international conference on probabilistic, combinatorial and asymptotic methods for the analysis of algorithms, AofA 2020, Klagenfurt, Austria (virtual conference), June 15–19, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 159, Article 18, 16 p. (2020).
MSC:  68W40
PDF BibTeX XML Cite
Full Text: DOI arXiv

Subcritical random hypergraphs, high-order components, and hypertrees. (English) Zbl 1433.05236

Mishna, Marni (ed.) et al., Proceedings of the 16th workshop on analytic algorithmics and combinatorics, ANALCO ’19, San Diego, CA, USA, January 6, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 111-118 (2019).
MSC:  05C65 05C80 05C05
PDF BibTeX XML Cite
Full Text: DOI arXiv

Evolution of the giant component in graphs on orientable surfaces. (English) Zbl 1378.05186

Drmota, Michael (ed.) et al., Extended abstracts of the ninth European conference on combinatorics, graph theory and applications, EuroComb 2017, Vienna, Austria, August 28 – September 1, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 61, 687-693 (2017).
MSC:  05C80
PDF BibTeX XML Cite
Full Text: DOI

Complex networks: principles, methods and applications. (English) Zbl 1387.68003

Cambridge: Cambridge University Press (ISBN 978-1-107-10318-4/hbk; 978-1-316-21600-2/ebook). xxi, 559 p. (2017).
PDF BibTeX XML Cite
Full Text: DOI

Evolution of high-order connected components in random hypergraphs. (English) Zbl 1346.05265

Nešetril, Jaroslav (ed.) et al., Extended abstracts of the eight European conference on combinatorics, graph theory and applications, EuroComb 2015, Bergen, Norway, August 31 – September 4, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 49, 569-575, electronic only (2015).
MSC:  05C80 05C65 05C40
PDF BibTeX XML Cite
Full Text: DOI arXiv

Some introductory notes on random graphs. (English) Zbl 1346.05268

Fagnani, Fabio (ed.) et al., Mathematical foundations of complex networked information systems. Lectures of the CIME course. Politecnico di Torino, Verrès, Italy 2009. Cham: Springer; Florence: Fondazione CIME (ISBN 978-3-319-16966-8/pbk; 978-3-319-16967-5/ebook). Lecture Notes in Mathematics 2141. CIME Foundation Subseries, 1-26 (2015).
MSC:  05C80 05C40
PDF BibTeX XML Cite
Full Text: DOI

Robustness of spatial preferential attachment networks. (English) Zbl 1342.05163

Gleich, F. (ed.) et al., Algorithms and models for the web graph. 12th international workshop, WAW 2015, Eindhoven, The Netherlands, December 10–11, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-26783-8/pbk; 978-3-319-26784-5/ebook). Lecture Notes in Computer Science 9479, 3-14 (2015).
PDF BibTeX XML Cite
Full Text: DOI

The phase transition in the Erdős-Rényi random graph process. (English) Zbl 1293.05351

Lovász, László (ed.) et al., Erdős centennial. On the occasion of Paul Erdős 100th anniversary of his birth. Berlin: Springer; Budapest: János Bolyai Mathematical Society (ISBN 978-3-642-39285-6/hbk; 978-3-642-39286-3/ebook). Bolyai Society Mathematical Studies 25, 59-110 (2013).
MSC:  05C80
PDF BibTeX XML Cite
Full Text: DOI

Component evolution in general random intersection graphs. (English) Zbl 1253.68041

Kumar, Ravi (ed.) et al., Algorithms and models for the web graph. 7th international workshop, WAW 2010, Stanford, CA, USA, December 16, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-18008-8/pbk). Lecture Notes in Computer Science 6516, 36-49 (2010).
PDF BibTeX XML Cite
Full Text: DOI arXiv

A general critical condition for the emergence of a giant component in random graphs with given degrees. (English) Zbl 1273.05201

Nešetřil, Jaroslav (ed.) et al., Extended abstracts of the 5th European conference on combinatorics, graph theory and applications, EuroComb’09, Bordeaux, France, September 7–11, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 34, 639-645 (2009).
MSC:  05C80 05C07
PDF BibTeX XML Cite
Full Text: DOI arXiv

Coloring the edges of a random graph without a monochromatic giant component. (English) Zbl 1273.05206

Nešetřil, Jaroslav (ed.) et al., Extended abstracts of the 5th European conference on combinatorics, graph theory and applications, EuroComb’09, Bordeaux, France, September 7–11, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 34, 615-619 (2009).
MSC:  05C80 05C15
PDF BibTeX XML Cite
Full Text: DOI

Analytic combinatorics on random graphs. (English) Zbl 1256.05222

Dehmer, Matthias (ed.) et al., Analysis of complex networks. From biology to linguistics. Hoboken, NJ: John Wiley & Sons (ISBN 978-3-527-32345-6/hbk; 978-3-527-62798-1/ebook). 425-450 (2009).
PDF BibTeX XML Cite

The giant component in a random subgraph of a given graph. (English) Zbl 1207.05177

Avrachenkov, Konstantin (ed.) et al., Algorithms and models for the web-graph. 6th international workshop, WAW 2009, Barcelona, Spain, February 12–13, 2009. Proceedings. Berlin: Springer (ISBN 978-3-540-95994-6/pbk). Lecture Notes in Computer Science 5427, 38-49 (2009).
MSC:  05C80 68R10
PDF BibTeX XML Cite
Full Text: DOI

The probabilistic method. With an appendix on the life and work of Paul Erdős. 3rd ed. (English) Zbl 1148.05001

Wiley-Interscience Series in Discrete Mathematics and Optimization. Hoboken, NJ: John Wiley & Sons (ISBN 978-0-470-17020-5/hbk). xv, 352 p. (2008).
MSC:  05-02 05D40
PDF BibTeX XML Cite

Giant component and connectivity in geographical threshold graphs. (English) Zbl 1136.05318

Bonato, Anthony (ed.) et al., Algorithms and models for the web-graph. 5th international workshop, WAW 2007, San Diego, CA, USA, December 11–12, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-77003-9/pbk). Lecture Notes in Computer Science 4863, 209-216 (2007).
MSC:  05C80 05C40 68M10
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Biographic Reference

all top 3

Software