<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="https://www.bibsonomy.org/tag/random"><title>BibSonomy bookmarks for /tag/random</title><link>https://www.bibsonomy.org/tag/random</link><description>BibSonomy RSS Feed for /tag/random</description><items><rdf:Seq><rdf:li rdf:resource="https://stegu.github.io/psrdnoise/"/><rdf:li rdf:resource="https://supraoracles.com/academy/verifiable-random-functions-fair-play-in-a-decentralized-world/"/><rdf:li rdf:resource="https://devpost.com/software/decentralized-trust-free-provably-fair-casino"/><rdf:li rdf:resource="https://blog.chain.link/provably-fair-rng-for-web2/"/><rdf:li rdf:resource="https://en.wikipedia.org/wiki/Provable_fairness"/><rdf:li rdf:resource="https://cryptogambling.org/whitepapers/provably-fair-algorithms.pdf"/><rdf:li rdf:resource="https://csrc.nist.gov/projects/interoperable-randomness-beacons/beacon-20"/><rdf:li rdf:resource="https://news.ycombinator.com/item?id=34743382"/><rdf:li rdf:resource="https://stackoverflow.com/questions/21039772/pytables-read-random-subset"/><rdf:li rdf:resource="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2992609/"/><rdf:li rdf:resource="https://www.valerionappi.it/brng-en/"/><rdf:li rdf:resource="https://groups.google.com/g/sci.math/c/6BIYd0cafQo/m/Ucipn_5T_TMJ"/><rdf:li rdf:resource="https://twitter.com/BramVanroy/status/1489583872555761669?t=gypizFjXse1aqj0_yW8VbA&amp;s=19"/><rdf:li rdf:resource="https://twitter.com/kastnerkyle/status/1473361479143460872?t=-q6YbOcOZ2AXJ_EgW0vkJg&amp;s=19"/><rdf:li rdf:resource="http://bl.ocks.org/erkal/9746513"/><rdf:li rdf:resource="https://dreamwiki.sixey.es/welcome.dream/"/><rdf:li rdf:resource="https://webring.xxiivv.com/"/><rdf:li rdf:resource="https://neonaut.neocities.org/directory/"/><rdf:li rdf:resource="https://marijnflorence.neocities.org/linkroll/"/><rdf:li rdf:resource="https://math.mit.edu/~apost/courses/18.204_2018/Lee_Bernick_paper.pdf"/></rdf:Seq></items></channel><item rdf:about="https://stegu.github.io/psrdnoise/"><title>psrdnoise: Demos and tutorials</title><description>This is a collection of animated WebGL demos and tutorials on how to use the noise functions in the repository on github.com/stegu/psrdnoise</description><link>https://stegu.github.io/psrdnoise/</link><dc:creator>abhishektcsrni</dc:creator><dc:date>2025-12-02T12:28:09+01:00</dc:date><dc:subject>graphics random tutorial webgl </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;This is a collection of animated WebGL demos and tutorials on how to use the noise functions in the repository on github.com/stegu/psrdnoise&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graphics"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/random"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/tutorial"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/webgl"/></rdf:Bag></taxo:topics></item><item rdf:about="https://supraoracles.com/academy/verifiable-random-functions-fair-play-in-a-decentralized-world/"><title>Verifiable Random Functions: Fair Play in a Decentralized World</title><description></description><link>https://supraoracles.com/academy/verifiable-random-functions-fair-play-in-a-decentralized-world/</link><dc:creator>bshanks</dc:creator><dc:date>2024-02-04T03:04:15+01:00</dc:date><dc:subject>random </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2024-02-04T03:04:15+01:00&#034; href=&#034;https://supraoracles.com/academy/verifiable-random-functions-fair-play-in-a-decentralized-world/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://supraoracles.com/academy/verifiable-random-functions-fair-play-in-a-decentralized-world/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/random"/></rdf:Bag></taxo:topics></item><item rdf:about="https://devpost.com/software/decentralized-trust-free-provably-fair-casino"><title>Decentralized, Trust-free, Provably Fair Casino | Devpost</title><description></description><link>https://devpost.com/software/decentralized-trust-free-provably-fair-casino</link><dc:creator>bshanks</dc:creator><dc:date>2024-02-04T03:04:11+01:00</dc:date><dc:subject>random </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2024-02-04T03:04:11+01:00&#034; href=&#034;https://devpost.com/software/decentralized-trust-free-provably-fair-casino&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://devpost.com/software/decentralized-trust-free-provably-fair-casino&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/random"/></rdf:Bag></taxo:topics></item><item rdf:about="https://blog.chain.link/provably-fair-rng-for-web2/"><title>Chainlink VRF: A Provably Fair RNG for Web2</title><description></description><link>https://blog.chain.link/provably-fair-rng-for-web2/</link><dc:creator>bshanks</dc:creator><dc:date>2024-02-04T03:03:45+01:00</dc:date><dc:subject>random </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2024-02-04T03:03:45+01:00&#034; href=&#034;https://blog.chain.link/provably-fair-rng-for-web2/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://blog.chain.link/provably-fair-rng-for-web2/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/random"/></rdf:Bag></taxo:topics></item><item rdf:about="https://en.wikipedia.org/wiki/Provable_fairness"><title>Provable fairness - Wikipedia</title><description></description><link>https://en.wikipedia.org/wiki/Provable_fairness</link><dc:creator>bshanks</dc:creator><dc:date>2024-02-04T03:03:05+01:00</dc:date><dc:subject>random </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2024-02-04T03:03:05+01:00&#034; href=&#034;https://en.wikipedia.org/wiki/Provable_fairness&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://en.wikipedia.org/wiki/Provable_fairness&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/random"/></rdf:Bag></taxo:topics></item><item rdf:about="https://cryptogambling.org/whitepapers/provably-fair-algorithms.pdf"><title>provably-fair-algorithms.pdf</title><description></description><link>https://cryptogambling.org/whitepapers/provably-fair-algorithms.pdf</link><dc:creator>bshanks</dc:creator><dc:date>2024-02-04T03:02:58+01:00</dc:date><dc:subject>random </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2024-02-04T03:02:58+01:00&#034; href=&#034;https://cryptogambling.org/whitepapers/provably-fair-algorithms.pdf&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://cryptogambling.org/whitepapers/provably-fair-algorithms.pdf&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/random"/></rdf:Bag></taxo:topics></item><item rdf:about="https://csrc.nist.gov/projects/interoperable-randomness-beacons/beacon-20"><title>Interoperable Randomness Beacons | CSRC</title><description></description><link>https://csrc.nist.gov/projects/interoperable-randomness-beacons/beacon-20</link><dc:creator>bshanks</dc:creator><dc:date>2023-10-06T06:32:50+02:00</dc:date><dc:subject>random </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2023-10-06T06:32:50+02:00&#034; href=&#034;https://csrc.nist.gov/projects/interoperable-randomness-beacons/beacon-20&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://csrc.nist.gov/projects/interoperable-randomness-beacons/beacon-20&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/random"/></rdf:Bag></taxo:topics></item><item rdf:about="https://news.ycombinator.com/item?id=34743382"><title>Around 15 years ago, when casual little games on Facebook were still a thing (ac... | Hacker News</title><description></description><link>https://news.ycombinator.com/item?id=34743382</link><dc:creator>bshanks</dc:creator><dc:date>2023-02-11T10:11:19+01:00</dc:date><dc:subject>random </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2023-02-11T10:11:19+01:00&#034; href=&#034;https://news.ycombinator.com/item?id=34743382&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://news.ycombinator.com/item?id=34743382&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/random"/></rdf:Bag></taxo:topics></item><item rdf:about="https://stackoverflow.com/questions/21039772/pytables-read-random-subset"><title>python - PyTables read random subset - Stack Overflow</title><description></description><link>https://stackoverflow.com/questions/21039772/pytables-read-random-subset</link><dc:creator>becker</dc:creator><dc:date>2022-10-12T13:24:30+02:00</dc:date><dc:subject>random subset h5 hdf5 pytables hdf python sample </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2022-10-12T13:24:30+02:00&#034; href=&#034;https://stackoverflow.com/questions/21039772/pytables-read-random-subset&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://stackoverflow.com/questions/21039772/pytables-read-random-subset&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/random"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/subset"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/h5"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/hdf5"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/pytables"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/hdf"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/python"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/sample"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2992609/"><title>Quality of random number generators significantly affects results of Monte Carlo simulations for organic and biological systems - PMC</title><description></description><link>https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2992609/</link><dc:creator>bshanks</dc:creator><dc:date>2022-08-17T01:06:41+02:00</dc:date><dc:subject>random </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2022-08-17T01:06:41+02:00&#034; href=&#034;https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2992609/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2992609/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/random"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.valerionappi.it/brng-en/"><title>Generating true random numbers from bananas - Valerio Nappi</title><description></description><link>https://www.valerionappi.it/brng-en/</link><dc:creator>bshanks</dc:creator><dc:date>2022-06-18T21:53:52+02:00</dc:date><dc:subject>banana random </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2022-06-18T21:53:52+02:00&#034; href=&#034;https://www.valerionappi.it/brng-en/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://www.valerionappi.it/brng-en/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/banana"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/random"/></rdf:Bag></taxo:topics></item><item rdf:about="https://groups.google.com/g/sci.math/c/6BIYd0cafQo/m/Ucipn_5T_TMJ"><title>How to generate random number sequences (in your head)</title><description></description><link>https://groups.google.com/g/sci.math/c/6BIYd0cafQo/m/Ucipn_5T_TMJ</link><dc:creator>bshanks</dc:creator><dc:date>2022-04-30T21:49:40+02:00</dc:date><dc:subject>crypto human random </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2022-04-30T21:49:40+02:00&#034; href=&#034;https://groups.google.com/g/sci.math/c/6BIYd0cafQo/m/Ucipn_5T_TMJ&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://groups.google.com/g/sci.math/c/6BIYd0cafQo/m/Ucipn_5T_TMJ&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/crypto"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/human"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/random"/></rdf:Bag></taxo:topics></item><item rdf:about="https://twitter.com/BramVanroy/status/1489583872555761669?t=gypizFjXse1aqj0_yW8VbA&amp;s=19"><title>Pytorch random seeds</title><description></description><link>https://twitter.com/BramVanroy/status/1489583872555761669?t=gypizFjXse1aqj0_yW8VbA&amp;s=19</link><dc:creator>becker</dc:creator><dc:date>2022-02-04T15:06:07+01:00</dc:date><dc:subject>nn pytorch random seed seeds </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2022-02-04T15:06:07+01:00&#034; href=&#034;https://twitter.com/BramVanroy/status/1489583872555761669?t=gypizFjXse1aqj0_yW8VbA&amp;amp;s=19&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://twitter.com/BramVanroy/status/1489583872555761669?t=gypizFjXse1aqj0_yW8VbA&amp;amp;s=19&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/nn"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/pytorch"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/random"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/seed"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/seeds"/></rdf:Bag></taxo:topics></item><item rdf:about="https://twitter.com/kastnerkyle/status/1473361479143460872?t=-q6YbOcOZ2AXJ_EgW0vkJg&amp;s=19"><title>Deterministic python</title><description></description><link>https://twitter.com/kastnerkyle/status/1473361479143460872?t=-q6YbOcOZ2AXJ_EgW0vkJg&amp;s=19</link><dc:creator>becker</dc:creator><dc:date>2021-12-23T10:11:53+01:00</dc:date><dc:subject>cuda deterministic learning machine ml numpy python random seed torch </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2021-12-23T10:11:53+01:00&#034; href=&#034;https://twitter.com/kastnerkyle/status/1473361479143460872?t=-q6YbOcOZ2AXJ_EgW0vkJg&amp;amp;s=19&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://twitter.com/kastnerkyle/status/1473361479143460872?t=-q6YbOcOZ2AXJ_EgW0vkJg&amp;amp;s=19&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cuda"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/deterministic"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/machine"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ml"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/numpy"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/python"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/random"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/seed"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/torch"/></rdf:Bag></taxo:topics></item><item rdf:about="http://bl.ocks.org/erkal/9746513"><title>Random Graph Generator - bl.ocks.org</title><description></description><link>http://bl.ocks.org/erkal/9746513</link><dc:creator>schmidt2</dc:creator><dc:date>2020-06-23T14:06:54+02:00</dc:date><dc:subject>blocks d3 diagram free generator graph network online_resource online_ressource random </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2020-06-23T14:06:54+02:00&#034; href=&#034;http://bl.ocks.org/erkal/9746513&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://bl.ocks.org/erkal/9746513&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/blocks"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/d3"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/diagram"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/free"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/generator"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/online_resource"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/online_ressource"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/random"/></rdf:Bag></taxo:topics></item><item rdf:about="https://dreamwiki.sixey.es/welcome.dream/"><title>welcome to dreamwiki</title><description></description><link>https://dreamwiki.sixey.es/welcome.dream/</link><dc:creator>bshanks</dc:creator><dc:date>2020-06-19T17:08:45+02:00</dc:date><dc:subject>random </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2020-06-19T17:08:45+02:00&#034; href=&#034;https://dreamwiki.sixey.es/welcome.dream/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://dreamwiki.sixey.es/welcome.dream/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/random"/></rdf:Bag></taxo:topics></item><item rdf:about="https://webring.xxiivv.com/"><title>Webring</title><description></description><link>https://webring.xxiivv.com/</link><dc:creator>bshanks</dc:creator><dc:date>2020-06-19T17:08:42+02:00</dc:date><dc:subject>random </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2020-06-19T17:08:42+02:00&#034; href=&#034;https://webring.xxiivv.com/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://webring.xxiivv.com/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/random"/></rdf:Bag></taxo:topics></item><item rdf:about="https://neonaut.neocities.org/directory/"><title>Neonauticon Web Directory</title><description></description><link>https://neonaut.neocities.org/directory/</link><dc:creator>bshanks</dc:creator><dc:date>2020-06-19T17:08:40+02:00</dc:date><dc:subject>random </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2020-06-19T17:08:40+02:00&#034; href=&#034;https://neonaut.neocities.org/directory/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://neonaut.neocities.org/directory/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/random"/></rdf:Bag></taxo:topics></item><item rdf:about="https://marijnflorence.neocities.org/linkroll/"><title>Marijn&#039;s Linkroll</title><description></description><link>https://marijnflorence.neocities.org/linkroll/</link><dc:creator>bshanks</dc:creator><dc:date>2020-06-19T17:08:37+02:00</dc:date><dc:subject>random </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2020-06-19T17:08:37+02:00&#034; href=&#034;https://marijnflorence.neocities.org/linkroll/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://marijnflorence.neocities.org/linkroll/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/random"/></rdf:Bag></taxo:topics></item><item rdf:about="https://math.mit.edu/~apost/courses/18.204_2018/Lee_Bernick_paper.pdf"><title>Modeling Human Networks Using Random Graphs</title><description>One natural way to model human networks, such as social networks, transportation networks, or the internet, is with random graphs.
This paper summarizes the foundations of random graph theory, developed by Paul Erd¨os and Alfred R´enyi in 1958, and some common
techniques used to analyze random graphs. Three more generalized
random graph models are also explored: the configuration model, the
small-world model, and the preferential attachment model. The similarity of these models to human networks is evaluated based on four
criteria: average path length, degree distribution, clustering coefficient, and static or dynamic nature of the graph.</description><link>https://math.mit.edu/~apost/courses/18.204_2018/Lee_Bernick_paper.pdf</link><dc:creator>ultrasaurus</dc:creator><dc:date>2019-11-04T12:11:36+01:00</dc:date><dc:subject>cs graph-theory network random </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;One natural way to model human networks, such as social networks, transportation networks, or the internet, is with random graphs.
This paper summarizes the foundations of random graph theory, developed by Paul Erd¨os and Alfred R´enyi in 1958, and some common
techniques used to analyze random graphs. Three more generalized
random graph models are also explored: the configuration model, the
small-world model, and the preferential attachment model. The similarity of these models to human networks is evaluated based on four
criteria: average path length, degree distribution, clustering coefficient, and static or dynamic nature of the graph.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cs"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph-theory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/random"/></rdf:Bag></taxo:topics></item></rdf:RDF>