Publication:3286850
From MaRDI portal
zbMath0103.16301MaRDI QIDQ3286850
Publication date: 1960
05C80: Random graphs (graph-theoretic aspects)
Related Items
Properties of complexity measures for PRAMs and WRAMs, Long paths in sparse random graphs, Validity studies in clustering methodologies, Critical points for random Boolean networks, Large random graphs in pseudo-metric spaces, The chromatic number of random graphs at the double-jump threshold, Trees in random graphs, Random subgraphs of the n-cycle, Balanced extensions of graphs and hypergraphs, Infinite spectra in the first order theory of graphs, Preferential deletion in dynamic models of web-like networks, Counting connected graphs asymptotically, Phase transitions in dynamical random graphs, On large deviation properties of Erdős-Rényi random graphs, Properties of atypical graphs from negative complexities, Gelation in coagulating systems, Phase synchronization in complex networks with decayed long-range interactions, On effectiveness of wiretap programs in mapping social networks, Generating simple random graphs with prescribed degree distribution, When are networks truly modular?, Threshold for monotone symmetric properties through a logarithmic Sobolev inequality, Complex networks: from graph theory to biology, Topological relationships between brain and social networks, Codes identifying sets of vertices in random networks, On the number of positive solutions of a nonlinear algebraic system, Small subgraphs of random regular graphs, The prisoner's dilemma on co-evolving networks under perfect rationality, Random graph asymptotics on high-dimensional tori, Survival time of a random graph, Optimal and near-optimal broadcast in random graphs, Two sufficient conditions for Poisson approximations in the ferromagnetic Ising model, Critical random graphs: Diameter and mixing time, Edge percolation on a random regular graph of low degree, Colorings of spaces, and random graphs, Distance-based parametric bootstrap tests for clustering of species ranges, Minimal attractors in digraph system models of neuronal networks, On pinning synchronization of complex dynamical networks, On the \(k\)-orientability of random graphs, A note on coloring sparse random graphs, Navigable small-world networks with few random bits, The Alexander-Orbach conjecture holds in high dimensions, The evolution of the min-min random graph process, A model of the emergence and evolution of integrated worldviews, Topological-based bottleneck analysis and improvement strategies for traffic networks, On a random graph evolving by degrees, Almost all regular graphs are Hamiltonian, 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, Hamiltonian cycles in random regular graphs, Component structure in the evolution of random hypergraphs, Random near-regular graphs and the node packing problem, On the value of a random minimum spanning tree problem, On a method for random graphs, Induced trees in sparse random graphs, On the order of the largest induced tree in a random graph, An exact threshold theorem for random graphs and the node-packing problem, Random hypergraphs and topological gelation criterion for crosslinked polymer systems, Threshold phenomena in random structures, Poisson convergence and Poisson processes with applications to random graphs, On the number of induced subgraphs of a random graph, Maximal paths in random dynamic graphs, Random interval graphs, Asymptotic normality of graph statistics, Subgraph counts in random graphs using incomplete U-statistics methods, The asymptotic distribution of short cycles in random regular graphs, Degree sequences of random graphs, Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations, The asymptotic probability that a random graph is a unit interval graph, indifference graph, or proper interval graph, One-factor in random graphs based on vertex choice, Holes in random graphs, Connectivity threshold for random chordal graphs, Size and connectivity of the \(k\)-core of a random graph, Threshold functions for local properties of graphs: Triangles, Expected parallel time and sequential space complexity of graph and digraph problems, Infinitary logics and 0-1 laws, Matching theory -- a sampler: From Dénes König to the present, The size of the largest hole in a random graph, An exact probability distribution on the connectivity of random graphs, Some applications of graph theory to clustering, Hamiltonian circuits in random graphs, Data analysis and the connectivity of random graphs, The maximum number of \(K_j\)-subgraphs in a graph with \(k\) independent edges, On the chromatic index of almost all graphs, Survey sampling in graphs, On finite superuniversal graphs, Evolution of the \(n\)-cube, A central limit theorem for decomposable random variables with applications to random graphs, Elements of a theory of computer simulation. I, Constructing optimal ultrametrics, Extremal problems and generalized degrees, Phase transition phenomena in random discrete structures, Brownian excursions, critical random graphs and the multiplicative coalescent, Random induced subgraphs of generalized \(n\)-cubes, The hidden algorithm of Ore's theorem on Hamiltonian cycles, Factorizing the complete graph into factors with large star number, Scale-free networks in evolution, Principles of statistical mechanics of uncorrelated random networks, A local-world evolving network model, Complexity and synchronization of the World Trade Web, Sharp thresholds of graph properties, and the $k$-sat problem, Every monotone graph property has a sharp threshold, On the greedy algorithm with random costs, Stochastic analysis and applications, Smooth and sharp thresholds for random{k}-XOR-CNF satisfiability, Smooth and sharp thresholds for random{k}-XOR-CNF satisfiability, Unnamed Item, Average-Case Analysis of Online Topological Ordering, On the connectivity and diameter of small-world networks, Constrained Stress Majorization Using Diagonally Scaled Gradient Projection, Random 2-XORSAT at the Satisfiability Threshold, On a conditionally Poissonian graph process, Paul Erdős, 1913-1996, Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs, Almost all graphs with average degree 4 are 3-colorable, Length of optimal path in random networks with strong disorder, A dynamical characterization of the small world phase, Statistical evaluation of algebraic constraints for social networks, Pinning control of scale-free dynamical networks, The phase transition in a random hypergraph, Asymptotic normality determined by high moments, and submap counts of random maps, Counting connected graphs inside-out, Structure of large random hypergraphs, On the Lambert \(w\) function, Large induced trees in sparse random graphs, Higher order clustering coefficients in Barabási-Albert networks, \(w\)-density and \(w\)-balanced property of weighted graphs, Networks in life: Scaling properties and eigenvalue spectra, Nowhere-zero flows in random graphs, On the largest component of the random graph at a nearcritical stage, On the robustness of interconnections in random graphs: a symbolic approach., Packet transport and load distribution in scale-free network models, Directed cycles and related structures in random graphs. I: Static properties, Size of the largest cluster under zero-range invariant measures, A decomposability index in logical analysis of data, Forbidden subgraphs in connected graphs, The genus of a random graph, Counting \(H\)-free graphs, Walks on random digraphs, Satisfiability threshold for random XOR-CNF formulas, Query evaluation on a database given by a random graph, Occupancy problems and random algebras, Recovery of missing information in graph sequences by means of reference pattern matching and decision tree learning, Modeling for evolving biological networks with scale-free connectivity, hierarchical modularity, and disassortativity, Phase transition in a random NK landscape model, On extremal problems of graphs and generalized graphs, Examining the potential effects of species aggregation on the network structure of food webs, Thresholds for virus spread on networks, Using raster-based GIS and graph theory to analyze complex networks, A unified network performance measure with importance identification and the ranking of network components, Mathematical modeling of the malignancy of cancer using graph evolution, Local tail bounds for functions of independent random variables, The percolation signature of the spin glass transition, Lifshitz tails for spectra of Erdős-Rényi random graphs, Radio communication in random graphs, Monotone properties of random geometric graphs have sharp thresholds, Reconstruction of Kauffman networks applying trees, Limit distribution for the existence of Hamiltonian cycles in a random graph. (Reprint), On some extremal problems on \(r\)-graphs, On Hamilton-cycles of random graphs, On a Ramsey type theorem, Probabilistic methods in group theory, On the factorization of the complete graph, Control and optimal response problems for quasilinear impulsive integrodifferential equations, A hierarchy of randomness for graphs, The resolution complexity of random graph \(k\)-colorability, SAT distributions with planted assignments and phase transitions between decision and optimization problems, On the typical case complexity of graph optimization, Counting extensions, The critical point of \(k\)-clique percolation in the Erdős-Rényi graph, On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph, On the strength of connectedness of a random graph, Approximability Distance in the Space of H-Colourability Problems, SAT Distributions with Phase Transitions between Decision and Optimization Problems, Evolution of random graph processes with degree constraints, A dynamic topological sort algorithm for directed acyclic graphs, Small-world graphs: characterization and alternative constructions, Exponential Random Graphs as Models of Overlay Networks, Community Finding of Scale-Free Network: Algorithm and Evaluation Criterion, Zero-One Laws for Sparse Random Graphs, Random Trees in Random Graphs, A Random Graph With a Subcritical Number of Edges, On graphs with randomly deleted edges, On the evolution of random graphs over expanding square lattices
