scientific article
From MaRDI portal
Publication:3682518
zbMath0567.05042MaRDI QIDQ3682518
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Random graphs (graph-theoretic aspects) (05C80) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (05Cxx)
Related Items (only showing first 100 items - show all)
Sharp thresholds of graph properties, and the $k$-sat problem ⋮ Percolation on spatial anisotropic networks* ⋮ Quasi-Random Set Systems ⋮ A heuristic for decomposing traffic matrices in TDMA satellite communication ⋮ A study on properties of random interval graphs and Erdős Rényi graph 𝒢(n, 2/3) ⋮ Smooth and sharp thresholds for random{k}-XOR-CNF satisfiability ⋮ Binary Covering Arrays and Existentially Closed Graphs ⋮ The random linear bottleneck assignment problem ⋮ Perfect matchings in random subgraphs of regular bipartite graphs ⋮ Rankable distributions do not provide harder instances than uniform distributions ⋮ Graphical representation and hierarchical decomposition mechanism for vertex-cover solution space ⋮ Complex networks for community detection of basketball players ⋮ On Interval Routing Schemes and treewidth ⋮ Localization of eigenvectors in random graphs ⋮ Unnamed Item ⋮ Average-case complexity of a branch-and-bound algorithm for \textsc{Min Dominating Set} ⋮ Two typical analytic models for reverse bond percolation on real networks ⋮ Unnamed Item ⋮ Finite length spectra of random surfaces and their dependence on genus ⋮ Mixing Rates for a Random Walk on the Cube ⋮ Near-optimal dominating sets in dense random graphs in polynomial expected time ⋮ Average case analysis of fully dynamic connectivity for directed graphs ⋮ A random graph growth model ⋮ Statistics of finite degree covers of torus knot complements ⋮ Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\) ⋮ Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems ⋮ Lower bounds for sense of direction in regular graphs ⋮ Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing ⋮ Coloring graphs with fixed genus and girth ⋮ Some problems in analysis of discretizations of continuous dynamical systems ⋮ An analytic approach to sparse hypergraphs: hypergraph removal ⋮ On the number of points in general position in the plane ⋮ Size Ramsey numbers for some regular graphs ⋮ Size Ramsey numbers for some regular graphs ⋮ A generalization of maximal independent sets ⋮ One-dimensional asymptotic classes of finite structures ⋮ On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes ⋮ On approximating the longest path in a graph ⋮ The diameter of sparse random graphs ⋮ The giant component threshold for random regular graphs with edge faults H. Prodinger ⋮ On the growth of components with non-fixed excesses ⋮ Random regular graphs with edge faults: Expansion through cores ⋮ Geometrical structure of the neuronal network of Caenorhabditis elegans ⋮ Improved bounds on the sample complexity of learning ⋮ Complexity classification of some edge modification problems ⋮ Spectral properties of the \(k\)-body embedded Gaussian ensembles of random matrices. ⋮ Fractals in small-world networks with time-delay ⋮ Growing random networks with fitness ⋮ A model for the evolution of economic systems in social networks ⋮ Recommendation systems: A probabilistic analysis ⋮ Resilience for the Littlewood-Offord problem ⋮ Arbitrary Threshold Widths for Monotone, Symmetric Properties ⋮ The size-Ramsey number of trees ⋮ A priori optimization for the probabilistic maximum independent set problem ⋮ Statistical mechanics methods and phase transitions in optimization problems ⋮ Common pattern formation, modularity and phase transitions in a gene network model of morphogenesis ⋮ Resilience for the Littlewood-Offord problem ⋮ Almost all graphs with average degree 4 are 3-colorable ⋮ Near-perfect token distribution ⋮ Infinitary logic for computer science ⋮ On the singularity of random matrices with independent entries ⋮ Характеристики случайных систем дискретных уравнений при неравновероятной выборке неизвестных ⋮ Совместность случайных систем уравнений с неравновероятной выборкой двузначных неизвестных ⋮ Poisson approximation of the length spectrum of random surfaces ⋮ Most graphs are knotted ⋮ The effects of community interactions and quarantine on a complex network ⋮ Minors of a random binary matroid ⋮ Every monotone graph property has a sharp threshold ⋮ Zero-One Laws for Sparse Random Graphs ⋮ Broadcasting in random graphs ⋮ Гигантская компонента в случайных дистанционных графах специального вида ⋮ On the probability of planarity of a random graph near the critical point ⋮ A Random Graph With a Subcritical Number of Edges ⋮ The first eigenvalue of a Riemann surface ⋮ Central limit theorem for fluctuations of linear eigenvalue statistics of large random graphs ⋮ Tree decompositions and social graphs ⋮ Unnamed Item ⋮ A Tipping Point for the Planarity of Small and Medium Sized Graphs ⋮ Discrete Graphs – A Paradigm Model for Quantum Chaos ⋮ Periods of iterated rational functions ⋮ Size of the largest cluster under zero-range invariant measures ⋮ Bins and balls: Large deviations of the empirical occupancy process ⋮ Complete on average Boolean satisfiability ⋮ Algorithms for the fixed linear crossing number problem ⋮ Disjointly representing set systems ⋮ Optimal attack strategy of complex networks based on tabu search ⋮ A small-world and scale-free network generated by Sierpinski pentagon ⋮ Positive and negative effects of social impact on evolutionary vaccination game in networks ⋮ Forbidden subgraphs in connected graphs ⋮ Bounds on the max and min bisection of random cubic and random 4-regular graphs ⋮ Sandwiching random graphs: universality between random graph models ⋮ A sharp threshold in proof complexity yields lower bounds for satisfiability search ⋮ Reconstruction methods for networks: the case of economic and financial systems ⋮ Reconstruction of distance hereditary 2-connected graphs ⋮ The genus of a random graph ⋮ Epidemics on plants: modeling long-range dispersal on spatially embedded networks ⋮ A family of antipodal distance-regular graphs related to the classical Preparata codes ⋮ Searching for acyclic orientations of graphs ⋮ Close-to-optimal and near-optimal broadcasting in random graphs ⋮ A simple a. s. correct algorithm for deciding if a graph has a perfect matching
This page was built for publication:
