Results from experiments on random graphs with C = 180
Geometric Inhomogeneous Random Graphs
... our results in this paper crucially depend on an underlying geometry, and thus do not hold in the more general model from [14] where no underlying geometry is ...a random graph from a fixed ...
22
Two Basic Results Concerning Random Walks on Graphs »
... This article describes my investigation into several basic problems regarding random walks on graphs. On several occasions, I asked myself questions which my intuition failed to answer. I guessed at an ...
17
From Random Graphs to Complex Networks:
... Albeit not aiming to prove anything about networks, this experiment later coined the phrase “six degrees of separation,” which is not only the title of a play [25] but also the basic idea behind the small world effect as ...
87
Treewidth of Erdős–Rényi random graphs, random intersection graphs, and scale-free random graphs
... Erdős–Rényi random graph has treewidth at most 2 if the edge- to-vertex ratio is less than 1 / 2, completely settles the exact threshold of the edge-to-vertex ratio for the property of having a linear treewidth in ...
13
RANDOM EXPERIMENTS AND EVENTS
... 7. A ball is drawn at random from a box containing 6 red balls, 4 white balls and 5 blue balls. There will be how many sample points, in its sample space? 8. In a single rolling with two dice, write the ...
10
Modeling Random Experiments
... a random variable. • A letter is drawn at random from the ...the results of two such experiments and add ...a random vector, indexed by the ...
18
Random rectangular graphs
... here graphs with 1000 nodes and 7500 ...apart from each other and as a result the average path length of the whole graph ...far from the observed value in the plot for a = 1 ...
21
Random rectangular graphs
... 6 CONCLUSIONS AND FUTURE OUTLOOK We have introduced here a generalization of the RGG in which we embed the points into a unit rectangle instead of on a unit square. We consider a rectangle with sides of lengths a and b = ...
23
PERCOLATION AND RANDOM GRAPHS
... edges from a ...the results obtained up to date are far from complete, and many aspects of percolation, particularly of its critical behavior, are ill un- ...graph from which we obtain ...
74
Random walks on graphs
... with random walks on trees, which are in general easier to work with than random walks on graphs because of the special structure of a ...minimised from the center of the star, a result proved ...
81
Convergence of Random Graphs
... The major result we present, from papers of Le Galle and Miermont, is that scale limit of certain classes of planar maps is the Brownian Map. The work is divided in three sections. In the first section we ...
62
Sampling random colorings of sparse random graphs
... details. From there it is straightforward to extend to random graphs with expected degree d when k > 2d (though technically it requires considerable work to ...
14
Results from thinning experiments in 2002 and 2003
... The first time the agents were applied in the morning of April 18 th 2002, the sky was clouded, tem- perature of air was only 7 to 10 °C, the relative h umidity of air was high with 85 to 90 %. Leave moisture was ...
5
Recent results from the LHCf and RHICf experiments
... 5 Summary LHCf and RHICf are designed to study the forward par- ticle productions in high-energy hadron collisions. The equivalent cosmic-ray energy covered by these experi- ments range from 10 14 eV to 10 17 eV, ...
8
10.1 Random experiments and events
... To introduce the idea of mutually exclusive events. To review set notation and apply set notation to probability. Uncertainty is involved in much of the reasoning we undertake every day of our lives. We make decisions ...
30
Synchronizability of random rectangular graphs
... the random geometric graph (RGG) model, which is formu- lated over a cubic region in ...developed random rectangular graph (RRG) model, in which the spatial domain of the net- works is a rectangle that ...
7
On the KŁR conjecture in random graphs
... extremal results about graphs to subgraphs of the random graph G n,p , including Ramsey’s theorem [67] and the Erd˝os-Simonovits stability theorem ...sparse random versions do not follow ...
33
On the diameter of random planar graphs
... The results for planar graphs contrast with the so-called “subcritical” graph families, such as trees, outerplanar graphs, and series-parallel graphs, where the diameter is in the interval (n ...
24
On the diameter of random planar graphs
... a random quadrangulation weighted by x is, ...Starting from Q endowed with its canonical bicoloration, add in each face a new edge connecting the two (diagonally opposed) black ...Q from M , add a ...
12
Epidemics on random intersection graphs
... on results for the final outcome of homogeneously mixing SIR epidemic .... Results for homogeneously mixing SIR epidemic models are outlined in Section ...
43