Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[ספר][B] Random graphs and complex networks
R Van Der Hofstad - 2024 - books.google.com
" This rigorous introduction to network science presents random graphs as models for real-
world networks. Such networks have distinctive empirical properties and a wealth of new …
world networks. Such networks have distinctive empirical properties and a wealth of new …
Models of random regular graphs
This is a survey of results on properties of random regular graphs, to-gether with an
exposition of some of the main methods of obtaining these results. Related results on …
exposition of some of the main methods of obtaining these results. Related results on …
Random graphs with a given degree sequence
S Chatterjee, P Diaconis, A Sly - 2011 - projecteuclid.org
Large graphs are sometimes studied through their degree sequences (power law or regular
graphs). We study graphs that are uniformly chosen with a given degree sequence. Under …
graphs). We study graphs that are uniformly chosen with a given degree sequence. Under …
[PDF][PDF] Asymptotic enumeration methods
Asymptotic enumeration methods provide quantitative information about the rate of growth of
functions that count combinatorial objects. Typical questions that these methods answer …
functions that count combinatorial objects. Typical questions that these methods answer …
A sequential importance sampling algorithm for generating random graphs with prescribed degrees
J Blitzstein, P Diaconis - Internet mathematics, 2011 - Taylor & Francis
Random graphs with given degrees are a natural next step in complexity beyond the Erdős–
Rényi model, yet the degree constraint greatly complicates simulation and estimation. We …
Rényi model, yet the degree constraint greatly complicates simulation and estimation. We …
[PDF][PDF] Random graphs and complex networks
These lecture notes are intended to be used for master courses, where the students have a
limited prior knowledge of special topics in probability. Therefore, we have included many of …
limited prior knowledge of special topics in probability. Therefore, we have included many of …
Asymptotic enumeration by degree sequence of graphs with degreeso(n1/2)
We determine the asymptotic number of labelled graphs with a given degree sequence for
the case where the maximum degree is o (| E (G)| 1/3). The previously best enumeration, by …
the case where the maximum degree is o (| E (G)| 1/3). The previously best enumeration, by …
Simple markov‐chain algorithms for generating bipartite graphs and tournaments
We consider two problems: randomly generating labeled bipartite graphs with a given
degree sequence and randomly generating labeled tournaments with a given score …
degree sequence and randomly generating labeled tournaments with a given score …
Entropy of stochastic blockmodel ensembles
Stochastic blockmodels are generative network models where the vertices are separated
into discrete groups, and the probability of an edge existing between two vertices is …
into discrete groups, and the probability of an edge existing between two vertices is …
The probability that a random multigraph is simple
S Janson - Combinatorics, Probability and Computing, 2009 - cambridge.org
Consider a random multigraph G* with given vertex degrees d1,..., dn, constructed by the
configuration model. We show that, asymptotically for a sequence of such multigraphs with …
configuration model. We show that, asymptotically for a sequence of such multigraphs with …