Random graphs '85 / by International Seminar on Random Graphs and Probabilistic Methods in Combinatorics (2nd : 1985 : Poznan, Poland), Karonski, Michal, Palka, Zbigniew, Uniwersystet im. Adama Mickewicza w Poznaniu. Instytut Matematyki

Subjects: “…Random graphs…”

Random graph dynamics / by 284302 Durret, Rick

Subjects: “…Random graphs…”

On Bisecting Random Graphs by Bui, Thang Nguyen

Get full text

Random graphs on surfaces. by McDiarmid, C

“…Also, if we pick a graph uniformly at random from the graphs embeddable on S which have vertex set {1, ..., n}, then with probability tending to 1 as n → ∞, this random graph either is connected or consists of one giant component together with a few nodes in small planar components. © 2007 Elsevier Inc. …”

Colourings of random graphs by Heckel, A

“…<p>We study graph parameters arising from different types of colourings of random graphs, defined broadly as an assignment of colours to either the vertices or the edges of a graph.…”

On the spread of random graphs by Addario-Berry, L, Janson, S, McDiarmid, C

“…We investigate the spread for certain models of sparse random graph; in particular for random regular graphs G(n,d), for Erd\H{o}s-R\'enyi random graphs G_{n,p} in the supercritical range p&gt;1/n, and for a 'small world' model. …”

On the spread of random graphs by McDiarmid, C, Addario-Berry, L, Janson, S

“…We investigate the spread for certain models of sparse random graph, in particular for random regular graphs G(n,d), for Erdős–Rényi random graphs G_n,p in the supercritical range p&gt;1/n, and for a ‘small world’ model. …”

Local Interaction on Random Graphs by Hans Haller, Siegfried Berninghaus

Subjects: Get full text

Randomized graph cluster randomization by Ugander Johan, Yin Hao

“…In this work, we propose a randomized version of the GCR design, descriptively named randomized graph cluster randomization (RGCR), which uses a random clustering rather than a single fixed clustering. …”
Get full text

Random matrices and random graphs* by Capitaine Mireille, Coste Simon, Gabriel Franck, Maillard Pascal, Mailler Cécile

“…We collect recent results on random matrices and random graphs. The topics covered are: fluctuations of the empirical measure of random matrices, finite-size effects of algorithms involving random matrices, characteristic polynomial of sparse matrices and Voronoi tesselations of split trees.…”
Get full text

Sparse random graphs with clustering by Bollobas, B, Janson, S, Riordan, O

“…The basic idea is to construct the random graph by adding not only edges but also other small graphs. …”

Random graph processes with dependencies by Warnke, L

“…<p>Random graph processes are basic mathematical models for large-scale networks evolving over time. …”

Packing random graphs and hypergraphs by Bollobas, B, Janson, S, Scott, A

“…In the graph case, we prove a stronger result, on packing a random graph with a fixed graph.…”

On the KŁR conjecture in random graphs by Conlon, D, Gowers, W, Samotij, W, Schacht, M

“… <p>The KŁR conjecture of Kohayakawa, Łuczak, and Rödl is a statement that allows one to prove that asymptotically almost surely all subgraphs of the random graph <i>G</i>_{<i>n</i>,<i>p</i>}, for sufficiently large <i>p</i> := <i>p</i>(<i>n</i>), satisfy an embedding lemma which complements the sparse regularity lemma of Kohayakawa and Rödl. …”

Infinite locally random graphs by Charbit, P, Scott, A

“…Bonato and Janssen claimed that the limit graph is independent of G, and it is known as the infinite locally random graph. We show that this picture is incorrect: there are in fact infinitely many isomorphism classes of limit graph, and we give a classification. …”

Bisecting sparse random graphs. by Luczak, M, McDiarmid, C

“…We are interested in sparse random graphs Gn,c/n with edge probability c/n. We show that, if c &gt; ln 4, then the bisection width is Ω(n) with high probability; while if c &lt; ln 4, then it is equal to 0 with high probability. …”

The structure of large random graphs by Donderwinkel, S

Subjects:

The diameter of sparse random graphs by Riordan, O, Wormald, N

“…In this paper we study the diameter of the random graph $G(n,p)$, i.e., the the largest finite distance between two vertices, for a wide range of functions $p=p(n)$. …”

Susceptibility in inhomogeneous random graphs by Janson, S, Riordan, O

“…Here we relate the susceptibility of suitable random graphs to a quantity associated to the corresponding branching process, and study both quantities in various natural examples.…”

Dense subgraphs in random graphs by Balister, P, Bollobás, B, Sahasrabudhe, J, Veremyev, A

“…While this situation parallels that of cliques in random graphs, a new technique is required to handle the more complicated ways in which these "quasi-cliques" may overlap.…”