Results 11 to 20 of about 198,105 (266)
Random Graph Isomorphism [PDF]
SIAM Journal on Computing, 1980 Summary: A straightforward linear time canonical labeling algorithm is shown to apply to almost all graphs (i.e. all but \(O(2^{\binom n2})\) of the \(2^{\binom n2})\) graphs on \(n\) vertices). Hence, for almost all graphs \(X\), and graph \(Y\) can be easily tested for isomorphism to \(X\) by an extremly naive linear time algorithm.
László Babai +2 more
openaire +2 more sources
Group-walk random graphs [PDF]
, 2017 We introduce a construction that gives rise to a variety of ‘geometric’ finite random graphs, and describe connections to the Poisson boundary, Naim’s kernel, and Sznitman’s random ...
Agelos Georgakopoulos +1 more
core +1 more source
Random rectangular graphs [PDF]
Physical Review E, 2015 A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square [0,1]^2. The topological properties of the random rectangular graphs (RRGs) generated by this model are then studied as a function of the rectangle sides ...
Estrada, Ernesto, Sheerin, Matthew
openaire +5 more sources
A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees [PDF]
, 2009 Random graphs with a given degree sequence are a useful model capturing several features absent in the classical Erd˝os-R´enyi model, such as dependent edges and non-binomial degrees.
Diaconis, Persi, Blitzstein, Joseph
core +1 more source
Universality of Random Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2012 We prove that asymptotically (as $n\to\infty$) almost all graphs with $n$ vertices and $C_dn^{2-\frac{1}{2d}} \log^{\frac{1}{d}} n$ edges are universal with respect to the family of all graphs with maximum degree bounded by $d$. Moreover, we provide an efficient deterministic embedding algorithm for finding copies of bounded degree graphs in graphs ...
Domingos Dellamonica Jr. +3 more
openaire +2 more sources
Random matrices and random graphs
ESAIM: Proceedings and Surveys, 2023 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.
Capitaine, Mireille +4 more
openaire +3 more sources
Random Graphs with Clustering [PDF]
Physical Review Letters, 2009 We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be neighbors of one another.
openaire +3 more sources
Random Trees in Random Graphs [PDF]
Proceedings of the American Mathematical Society, 1988 We show that a random labeled n n -vertex graph almost surely contains isomorphic copies of almost all labeled
Bender, E. A., Wormald, N. C.
openaire +2 more sources
Random walks on the random graph [PDF]
The Annals of Probability, 2018 We study random walks on the giant component of the Erdős–Rényi random graph G(n,p) where p=λ/n for λ>1 fixed. The mixing time from a worst starting point was shown by Fountoulakis and Reed, and independently by Benjamini, Kozma and Wormald, to have order log2n.
Berestycki, Nathanaël +3 more
openaire +6 more sources
Random Structures & Algorithms, 2018 We investigate the asymptotic structure of a random perfect graph Pn sampled uniformly from the set of perfect graphs on vertex set . Our approach is based on the result of Prömel and Steger that almost all perfect graphs are generalised split graphs, together with a method to generate such graphs almost uniformly.
McDiarmid, C, Yolov, N
openaire +2 more sources