scientific article
From MaRDI portal
Publication:3680834
zbMath0566.05002MaRDI QIDQ3680834
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
random regular graphsevolution of random graphsrandom treesgraphical enumerationgeneration of random graphsprobability models for graphs
Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01)
Related Items (65)
A decomposability index in logical analysis of data ⋮ Rulers and slaves in a random social group ⋮ The hardest constraint problems: A double phase transition ⋮ Average-case scalable on-line algorithms for fault replacement ⋮ A new probabilistic analysis of Karger's randomized algorithm for minimum cut problems ⋮ Metric inference for social networks ⋮ Random hypergraphs and topological gelation criterion for crosslinked polymer systems ⋮ Poisson convergence and Poisson processes with applications to random graphs ⋮ Probabilistic models in cluster analysis ⋮ Undecidable statements and random graphs ⋮ Unnamed Item ⋮ Asymptotic distributions in random graphs with applications to social networks ⋮ On the number of trees having \(k\) edges in common with a graph of bounded degrees ⋮ Random interval graphs ⋮ An incomplete markets model of business cycles ⋮ Variations on the Ising problem ⋮ A fast algorithm for constructing trees from distance matrices ⋮ Asymptotic normality of graph statistics ⋮ Probabilistische analyse von heuristiken der kombinatorischen optimierung – ein überbllck ⋮ Subgraph counts in random graphs using incomplete U-statistics methods ⋮ Solution methods and computational investigations for the linear bottleneck assignment problem ⋮ Triad count statistics ⋮ The maximum number of edges in a graph with fixed edge-degree ⋮ The hidden algorithm of Ore's theorem on Hamiltonian cycles ⋮ Spectral distributions of adjacency and Laplacian matrices of random graphs ⋮ Perfect hashing ⋮ An empirical study of phase transitions in binary constraint satisfaction problems ⋮ Refining the phase transition in combinatorial search ⋮ Locating the phase transition in binary constraint satisfaction problems ⋮ The random linear bottleneck assignment problem ⋮ The first cycles in an evolving graph ⋮ An evolution of interval graphs ⋮ Application of statistical mechanics to combinatorial optimization problems: the chromatic number problem and \(q\)-partitioning of a graph. ⋮ A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem. ⋮ Models for network dynamics: A Markovian framework* ⋮ Random geometric complexes and graphs on Riemannian manifolds in the thermodynamic limit ⋮ Matchings and cycle covers in random digraphs ⋮ Quasi-random graphs ⋮ The pebbling threshold of the square of cliques ⋮ Kolmogorov complexity and random graphs ⋮ PERFORMANCE ANALYSIS AND EVALUATION OF RANDOM WALK ALGORITHMS ON WIRELESS NETWORKS ⋮ Local tail bounds for functions of independent random variables ⋮ Matchings in random superpositions of bipartite trees ⋮ Matching theory -- a sampler: From Dénes König to the present ⋮ Analysis of minimal path routing schemes in the presence of faults ⋮ Fractionally total colouring \(G_{n,p}\) ⋮ A generalization of maximal independent sets ⋮ On global site-percolation on the correlated honeycomb lattice ⋮ Low eigenvalues of Laplacian matrices of large random graphs ⋮ Frozen development in graph coloring ⋮ Counterexamples of the 0-1 Law for Fragments of Existential Second-Order Logic: an Overview ⋮ Effectiveness analysis of a mixed rumor-quelling strategy ⋮ A fast randomized algorithm for partitioning a graph into paths of fixed length ⋮ A threshold for unsatisfiability ⋮ The chromatic number of random graphs at the double-jump threshold ⋮ Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes ⋮ Polymers and random graphs ⋮ On the intersection graph of random caps on a sphere ⋮ Tree and forest weights and their application to nonuniform random graphs ⋮ Competitive group testing ⋮ On Ringeisen's isolation game. II ⋮ The length of the shortest edge of a graph on a sphere ⋮ Lattice bandwidth of random graphs ⋮ On asymptotic properties of Bell polynomials and concentration of vertex degree of large random graphs ⋮ The connectivity of a graph on uniform points on [0,\,1\(^{d}\).]
This page was built for publication:
