scientific article

From MaRDI portal
Publication:3291948

zbMath0106.12006MaRDI QIDQ3291948

Alfréd Rényi, Paul Erdős

Publication date: 1961


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Stability analysis of nonlinear oscillator networks based on the mechanism of cascading failures, Forman-Ricci curvature and persistent homology of unweighted complex networks, Optimal attack strategy of complex networks based on tabu search, Investigating the relationship between \(k\)-core and \(s\)-core network decompositions, Characterizing the topological and controllability features of U.S. power transmission networks, The mean and variance of the distribution of shortest path lengths of random regular graphs, An opinion formation based binary optimization approach for feature selection, Brownian excursions, critical random graphs and the multiplicative coalescent, Relationships between Perron-Frobenius eigenvalue and measurements of loops in networks, Some Introductory Notes on Random Graphs, Non-equilibrium kinetic Biswas-Chatterjee-Sen model on complex networks, Codes identifying sets of vertices in random networks, Evolution of scale-free random graphs: Potts model formulation, Phase synchronization of coupled bursting neurons and the generalized Kuramoto model, Systematic evaluation of a new combinatorial curvature for complex networks, Cascading Critical Nodes Detection with Load Redistribution in Complex Systems, Spectral distributions of adjacency and Laplacian matrices of random graphs, Spectral classes of regular, random, and empirical graphs, A novel weighted defence and its relaxation in abstract argumentation, Algebraic and combinatorial expansion in random simplicial complexes, Catastrophic cascading failures in power networks, Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication, CONTROLLABILITY ANALYSIS OF COMPLEX NETWORKS USING STATISTICAL RANDOM SAMPLING, Catastrophic event phenomena in communication networks: a survey, Local limit theorems for subgraph counts, Phase transition of degeneracy in minor-closed families, Multidimensional Friedkin-Johnsen model with increasing stubbornness in social networks, Discrete Ricci curvatures for directed networks, Characterization of Graphs Using Degree Cores, A bird’s-eye view of naming game dynamics: From trait competition to Bayesian inference, Cores of random \(r\)-partite hypergraphs, Posterior contraction rates for stochastic block models, Strict convexity of the free energy of the canonical ensemble under decay of correlations, Random Graphs and Their Subgraphs, The distribution of first hitting times of randomwalks on Erdős–Rényi networks, Triangle percolation in mean field random graphs-with PDE, Connected components and evolution of random graphs: An algebraic approach, The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs, New stochastic local search approaches for computing preferred extensions of abstract argumentation, Random geometric complexes and graphs on Riemannian manifolds in the thermodynamic limit, Forman curvature for complex networks, The distribution of first hitting times of random walks on directed Erdős–Rényi networks, Preferential attachment without vertex growth: emergence of the giant component, Colorings of spaces, and random graphs, Recent advances in percolation theory and its applications, Matching theory -- a sampler: From Dénes König to the present, The agglomeration phenomenon influence on the scaling law of the scientific collaboration system, The size of the giant component in random hypergraphs: a short proof, On global site-percolation on the correlated honeycomb lattice, Maximal clusters in non-critical percolation and related models, Induced gelation in a two-site spatial coagulation model, On sparse graphs with dense long paths, Normal approximation for sums of weighted \(U\)-statistics -- application to Kolmogorov bounds in random subgraph counting, Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs, On influence, stable behavior, and the most influential individuals in networks: a game-theoretic approach, Search for an immobile hider on a stochastic network, Large-scale clique cover of real-world networks, Time-varying network models, Transforming a graph into a 1-balanced graph, Statistical Characterization of a Small World Network Applied to Forest Fires, The probability of unusually large components in the near-critical Erdős–Rényi graph, Spectral bounds in random graphs applied to spreading phenomena and percolation, Optimal \(K\)-node disruption on a node-capacitated network, Exploring the optimal network topology for spreading dynamics, A Relaxation of Internal Conflict and Defence in Weighted Argumentation Frameworks, A motif-based approach to network epidemics, Synchronization criteria and pinning control of general complex networks with time delay, Propagation Connectivity of Random Hypergraphs, The impact of neighboring infection on the computer virus spread in packets on scale-free networks, Decay of correlations and uniqueness of the Infinite-Volume Gibbs measure of the Canonical ensemble of 1d-lattice systems, Sandwiching dense random regular graphs between binomial random graphs, The distribution of first hitting times of non-backtracking random walks on Erdős–Rényi networks, Analytical results for the distribution of first hitting times of random walks on random regular graphs