netafræði

Málstofa í stærðfræði Fyrirlesarar: Bjarni Jens Kristinsson, Háskóla Íslands, og Henning Úlfarsson, Háskólanum í Reykjavík Titill: Occurrence graphs of patterns in permutations Staðsetning: Naustið, Endurmenntun (hér) Tími: Fimmtudagur 4. júní, klukkan 15:00-16:00. Ágrip: This paper is based on a generalisation of the idea behind the proof of the Simultaneous Shading Lemma by Claesson et al. […]

Read More »

Málstofa í stærðfræði Speaker: Rögnvaldur Möller Title: Infinite cubic vertex-transitive graphs Staðsetning: Naustið, Endurmenntun (hér) Tími: Fimmtudagur 21. maí, klukkan 15:00-16:00. Ágrip: Tutte’s two papers from 1947 and 1959 on cubic graphs were the starting point of the in-depth study of the interplay between the structure of a group and the structure of a graph

Read More »

Málstofa í stærðfræði Speaker: Thomas Vallier, University of Iceland Title: Majority bootstrap percolation on . “ Staðsetning: Naustið, Endurmenntun (hér) Tími: Fimmtudagur 7. maí, klukkan 15:00-16:00. Ágrip: Majority bootstrap percolation is a process of spread of „activation“ on a given graph with a given number of initially active nodes chosen uniformly at random. At each

Read More »

Jakob Björnberg (17/11/14)Jakob Björnberg (17/11/14)

Málstofa í stærðfræði Fyrirlesari: Jakob Björnberg, Chalmers Tekniska Högskola, Göteborg Titill: Percolation in random quadrangulations of the half-plane Staðsetning: V-157, VRII Tími: Mánudagur 17. nóvember, frá 15:00 til 16:00. Ágrip: The topic of random planar quadrangulations (and, more generally, random planar maps) is of interest to probabilists, combinatorialists and physicists alike. Recent years have seen

Jakob Björnberg (17/11/14)Jakob Björnberg (17/11/14) Read More »

Sigurður Örn Stefánsson (27/10/14)Sigurður Örn Stefánsson (27/10/14)

Málstofa í stærðfræði Fyrirlesari: Sigurður Örn Stefánsson, University of Iceland Titill: Convergence of random planar maps to the Brownian tree Staðsetning: V-157, VRII Tími: Mánudagur 27. október, frá 15:15 til 16:15. Ágrip: Random planar maps are defined by assigning non-negative weights to each face of a planar map and the weight of a face depends

Sigurður Örn Stefánsson (27/10/14)Sigurður Örn Stefánsson (27/10/14) Read More »

Sara Sabrina Zemljic (20/10/14)Sara Sabrina Zemljic (20/10/14)

Málstofa í stærðfræði Fyrirlesari: Sara Sabrina Zemljic, University of Iceland Titill: Sierpiński graphs, framhald af fyrirlestri 6. okt Staðsetning: V-157, VRII Tími: Mánudagur 20. október, frá 15:00 til 16:00. Ágrip: Sierpiński graphs form an extensively studied family of graphs of fractal nature applicable in topology, mathematics of the Tower of Hanoi, computer science, and elsewhere.

Sara Sabrina Zemljic (20/10/14)Sara Sabrina Zemljic (20/10/14) Read More »

Sara Sabrina Zemljic (06/10/14)Sara Sabrina Zemljic (06/10/14)

Málstofa í stærðfræði Fyrirlesari: Sara Sabrina Zemljic, University of Iceland Titill: Sierpiński graphs Staðsetning: V-157, VRII Tími: Mánudagur 6. október, frá 15:00 til 16:00. Ágrip: Sierpiński graphs form an extensively studied family of graphs of fractal nature applicable in topology, mathematics of the Tower of Hanoi, computer science, and elsewhere. In the talk we will

Sara Sabrina Zemljic (06/10/14)Sara Sabrina Zemljic (06/10/14) Read More »

Thomas Vallier (15/09/14)Thomas Vallier (15/09/14)

Málstofa í stærðfræði Fyrirlesari: Thomas Vallier, University of Iceland Titill: Bootstrap percolation on the random graph Staðsetning: V-157, VRII Tími: Mánudagur 15. september, frá 15:00 til 16:00. Ágrip: Bootstrap percolation on the random graph is a process of spread of “activation” on a given realization of the graph with a given number of initially active

Thomas Vallier (15/09/14)Thomas Vallier (15/09/14) Read More »