Results 231 to 240 of about 198,105 (266)
Some of the next articles are maybe not open access.
On the asymmetry of random regular graphs and random graphs
Random Structures & Algorithms, 2002AbstractThis paper studies the symmetry of random regular graphs and random graphs. Our main result shows that for all 3 ≤ d ≤ n − 4 the random d‐regular graph on n vertices almost surely has no nontrivial automorphisms. This answers an open question of N. Wormald [13]. © 2002 Wiley Periodicals, Inc. Random Struct.
Jeong Han Kim, Benny Sudakov, Van H. Vu
openaire +2 more sources
1998
This book is devoted to the study of classical combinatorial structures such as random graphs, permutations, and systems of random linear equations in finite fields. The author shows how the application of the generalized scheme of allocation in the study of random graphs and permutations reduces the combinatorial problems to classical problems of ...
openaire +1 more source
This book is devoted to the study of classical combinatorial structures such as random graphs, permutations, and systems of random linear equations in finite fields. The author shows how the application of the generalized scheme of allocation in the study of random graphs and permutations reduces the combinatorial problems to classical problems of ...
openaire +1 more source
On handshakes in random graphs
Information Processing Letters, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Random Structures & Algorithms, 1994
AbstractThreshold probabilities for the existence in a random graph on n vertices of a graph isomorphic to a given graph of order Cn and average degree at least three are investigated. In particular it is proved that the random graph G(n, p) on n vertices with edge probability contains a square grid on En/2 vertices. © 1994 John Wiley & Sons, Inc.
Wenceslas Fernandez de la Vega +1 more
openaire +1 more source
AbstractThreshold probabilities for the existence in a random graph on n vertices of a graph isomorphic to a given graph of order Cn and average degree at least three are investigated. In particular it is proved that the random graph G(n, p) on n vertices with edge probability contains a square grid on En/2 vertices. © 1994 John Wiley & Sons, Inc.
Wenceslas Fernandez de la Vega +1 more
openaire +1 more source
2009
The aim of this article is to discuss some of the notions and applications of random walks on finite graphs, especially as they apply to random graphs. In this section we give some basic definitions, in Section 2 we review applications of random walks in computer science, and in Section 3 we focus on walks in random graphs.
Cooper, Colin, Frieze, Alan
openaire +1 more source
The aim of this article is to discuss some of the notions and applications of random walks on finite graphs, especially as they apply to random graphs. In this section we give some basic definitions, in Section 2 we review applications of random walks in computer science, and in Section 3 we focus on walks in random graphs.
Cooper, Colin, Frieze, Alan
openaire +1 more source
Discrete Mathematics, Algorithms and Applications, 2017
There tend to be no related researches regarding the relationships between graph theory and languages ever since the concept of graph-semigroup was first proposed in 1991. In 2011, after finding out the inner co-relations among digraphs, undirected graphs and languages, we proposed certain concepts including undirected graph language and digraph ...
Haizhong Shi, Yue Shi
openaire +1 more source
There tend to be no related researches regarding the relationships between graph theory and languages ever since the concept of graph-semigroup was first proposed in 1991. In 2011, after finding out the inner co-relations among digraphs, undirected graphs and languages, we proposed certain concepts including undirected graph language and digraph ...
Haizhong Shi, Yue Shi
openaire +1 more source
Random trees and random graphs
Random Structures and Algorithms, 1998Summary: We study the asymptotic behavior of the number of trees with \(n\) vertices and diameter \(k= k(n)\), where \((n- k)/n\to a\) as \(n\to\infty\) for some constant \(a< 1\). We use this result to determine the limit distribution of the diameter of the random graph \(G(n,p)\) in the subcritical phase.
openaire +2 more sources
Random Graphs and Graph Optimization Problems
SIAM Journal on Computing, 1980One major difficulty in analyzing algorithms for graph optimization problems is that the probabilistic behavior of the optimum solutions to most of the important problems is generally unknown. We present a general method for relating some well-known results regarding the probability of existence of certain subgraphs in random graphs to the ...
openaire +2 more sources
The Monoid of the Random Graph
SemiGroup Forum, 2000The countable random graph \(R\) is the unique graph with the property that given any two non-empty disjoint finite sets of vertices there is a vertex in neither set that is adjacent to all members of the first set but to no member of the second. This paper has as its subject \(\text{End}(R)\), the monoid of all endomorphisms of \(R\), where a morphism
Bonato, Anthony, Delić, Dejan
openaire +2 more sources
Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders
2001While everybody seems to immediately understand and accept the commonly used model of a random graph - simply toss a coin for every edge to decide whether it is there - the situation gets harder when we require that the random graph must satisfy some additional constraints such as having no triangles or being transitive.
Hans Jürgen Prömel, Anusch Taraz
openaire +1 more source