Publication:3267900
From MaRDI portal
zbMath0092.15705MaRDI QIDQ3267900
Publication date: 1959
05C80: Random graphs (graph-theoretic aspects)
Related Items
Average-Case Analysis of Online Topological Ordering, A Geometric Preferential Attachment Model of Networks II, Random 2-XORSAT at the Satisfiability Threshold, Generating stationary random graphs on ℤ with prescribed independent, identically distributed degrees, Detecting Inconsistencies in Large Biological Networks with Answer Set Programming, On the existence of a factor of degree one of a connected random graph, The probability of connectedness of a large unlabelled graph, On global site-percolation on the correlated honeycomb lattice, The Probability of Connectedness of an Unlabelled Graph Can Be Less for More Edges, On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes, The diameter of sparse random graphs, Efficient routeing in Poisson small-world networks, A hierarchy of randomness for graphs, Efficient Broadcasting in Random Power Law Networks, The fundamental group of random 2-complexes, Average case analysis of fully dynamic reachability for directed graphs, On the strength of connectedness of a random graph, On the Degree Sequence of an Evolving Random Graph Process and Its Critical Phenomenon, Evolution of random graph processes with degree constraints, Expander graphs and their applications, Network Measures in Civil Air Transport: A Case Study of Lufthansa, Design and Engineering of External Memory Traversal Algorithms for General Graphs, Modeling and Designing Real–World Networks, Random Networks of Catalytic Biochemical Reactions, A Random Graph With a Subcritical Number of Edges, Validity studies in clustering methodologies, A one-parameter family of stationary solutions in the susceptible-infected-susceptible epidemic model, The performance model of dynamic virtual organization (VO) formations within grid computing context, Birth and growth of multicyclic components in random hypergraphs, General compartmental epidemic models, Balanced and 1-balanced graph constructions, Parallel graph component labelling with GPUs and CUDA, Spectral distributions of adjacency and Laplacian matrices of random graphs, Angular synchronization by eigenvectors and semidefinite programming, Connectivity and dynamics for random subgraphs of the directed cube, The structure and function of networks, Critical points for random Boolean networks, A preferential attachment model with Poisson growth for scale-free networks, A difference equation approach to statistical mechanics of complex networks, Random subgraphs of the n-cycle, Reconstruction of graphs based on random walks, Generating simple random graphs with prescribed degree distribution, Anomalous electrical and frictionless flow conductance in complex networks, The degree distribution of the generalized duplication model, On the number of positive solutions of a nonlinear algebraic system, First cycles in random directed graph processes, An evolution of interval graphs, Survival time of a random graph, Optimal and near-optimal broadcast in random graphs, Relationship between degree-rank function and degree distribution of protein-protein interaction networks, Deterministic epidemiological models at the individual level, On the chromatic number of random graphs, Colorings of spaces, and random graphs, The number of possibilities for random dating, Average-case analysis of incremental topological ordering, Variance of the subgraph count for sparse Erdős-Rényi graphs, A diffusive strategic dynamics for social systems, Minimizing the expected complete influence time of a social network, Global stabilization of complex networks with digraph topologies via a local pinning algorithm, The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem, Uncovering latent structure in valued graphs: a variational approach, Dynamic graphs, Network evolution by different rewiring schemes, A complex network approach to text summarization, On pinning synchronization of complex dynamical networks, Network models and financial stability, Topology of random clique complexes, A scale-free graph model based on bipartite graphs, Graph spectra as a systematic tool in computational biology, A model of the emergence and evolution of integrated worldviews, The largest tree in a random graph, Graph evolution by stochastic additions of points and lines, Computational experience with minimum spanning tree algorithms, Limit distribution for the existence of Hamiltonian cycles in a random graph, On the connectivity of random m-orientable graphs and digraphs, k-connectivity in random undirected graphs, Random hypergraphs and topological gelation criterion for crosslinked polymer systems, Maximal paths in random dynamic graphs, Asymptotic normality of graph statistics, Fast probabilistic algorithms for Hamiltonian circuits and matchings, Degree sequences of random graphs, Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations, Connectivity threshold for random chordal graphs, Matching theory -- a sampler: From Dénes König to the present, Uniqueness of the infinite component in a random graph with applications to percolation and spin glasses, An exact probability distribution on the connectivity of random graphs, On sparse graphs with dense long paths, Data analysis and the connectivity of random graphs, Survey sampling in graphs, Central and local limit theorems for the coefficients of polynomials of binomial type, Random sampling and greedy sparsification for matroid optimization problems, Elements of a theory of computer simulation. I, Tree and forest weights and their application to nonuniform random graphs, A processor efficient MIS algorithm on random graphs, Extremal problems and generalized degrees, The asymptotic number of labeled graphs with \(n\) vertices, \(q\) edges, and no isolated vertices, A local-world evolving network model, Complexity and synchronization of the World Trade Web, Length of optimal path in random networks with strong disorder, Covering algorithms, continuum percolation and the geometry of wireless networks, Complexity-theoretic models of phase transitions in search problems, Two-dimensional gauge theories of the symmetric group \(S_n\) and branched \(n\)-coverings of Riemann surfaces in the large-\(n\) limit, Criticality in random threshold networks: annealed approximation and beyond, Evolution of the social network of scientific collaborations, A fast randomized algorithm for partitioning a graph into paths of fixed length, Directed cycles and related structures in random graphs. I: Static properties, Quantifying the connectivity of scale-free and biological networks, Forbidden subgraphs in connected graphs, Sandwiching random graphs: universality between random graph models, Reactive local search techniques for the maximum \(k\)-conjunctive constraint satisfaction problem \((MAX-k-CCSP)\), Exploring networks with traceroute-like probes: Theory and simulations, Local heuristics and the emergence of spanning subgraphs in complex networks, Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints, Another proof of Wright's inequalities, Bipartite structure of all complex networks, Online balanced graph avoidance games, Approximating \(k\)-cuts using network strength as a Lagrangean relaxation, Graph similarity scoring and matching, Synchronization in random networks with given expected degree sequences, Radio communication in random graphs, Improving the efficiency of attractor cycle identification in Boolean networks, Monotone properties of random geometric graphs have sharp thresholds, Limit distribution for the existence of Hamiltonian cycles in a random graph. (Reprint), On Hamilton-cycles of random graphs, Probabilistic methods in group theory
