scientific article; zbMATH DE number 3150484

zbMATH Open0092.15705MaRDI QIDQ3267900FDOQ3267900

Authors: Alfréd Rényi, P. Erdős 

Publication date: 1959

Title of this publication is not available (Why is that?)

Recommendations

• Publication:4865687
• scientific article; zbMATH DE number 18981
• On a method for random graphs
• On randomly \(k\)-dimensional graphs
• scientific article; zbMATH DE number 1161245
• scientific article; zbMATH DE number 1944718
• Some introductory notes on random graphs
• The random graph
• Introduction to Random Graphs

zbMATH Keywords

topology

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Cited In (only showing first 100 items - show all)

• Adaptive synchronization in complex dynamical networks with coupling delays for general graphs
• Epidemics on networks with preventive rewiring
• Randomised broadcasting: memory vs. randomness
• A generalization of the Buckley-Osthus model for web graphs
• Hidden Population Size Estimation From Respondent-Driven Sampling: A Network Approach
• Observer-based lag synchronization between two different complex networks
• Path Laplacian matrices: introduction and application to the analysis of consensus in networks
• Dynamical patterns of epidemic outbreaks in complex heterogeneous networks
• Perspectives on exponential random graphs
• The power grid as a complex network: a survey
• Efficient methods for the distance-based critical node detection problem in complex networks
• Dense subgraphs in the \(H\)-free process
• On the mixing time of geographical threshold graphs
• Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints
• Connectivity of Poissonian inhomogeneous random multigraphs
• Lack of Hyperbolicity in Asymptotic Erdös–Renyi Sparse Random Graphs
• Outer-totalistic cellular automata on graphs
• On the chromatic number of random graphs
• Shortest hop multipath algorithm for wireless sensor networks
• Random Graphs and Their Subgraphs
• The diameter of sparse random graphs
• Mixing time of near-critical random graphs
• Notes on ferromagnetic diluted \(p\)-spin model
• Finiteness of outer automorphism groups of random right-angled Artin groups
• Generating stationary random graphs on ℤ with prescribed independent, identically distributed degrees
• On the degree sequence of an evolving random graph process and its critical phenomenon
• Efficient broadcasting in random power law networks
• Approximating \(k\)-cuts using network strength as a Lagrangean relaxation
• Phase transitions and percolation at criticality in enhanced random connection models
• Epidemic control analysis: designing targeted intervention strategies against epidemics propagated on contact networks
• Hyperbolic graph generator
• Forbidden subgraphs in connected graphs
• The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
• Probabilistic frequent subtrees for efficient graph classification and retrieval
• Mathematical programming approaches for classes of random network problems
• Random subshifts of finite type
• Computational challenges in systems biology
• Graph similarity scoring and matching
• Recent advances on failure and recovery in networks of networks
• The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms
• Uniform sampling of directed and undirected graphs conditional on vertex connectivity
• Fast analytical methods for finding significant labeled graph motifs
• Efficient algorithms for game-theoretic betweenness centrality
• Peer effects and endogenous social interactions
• Deterministic epidemiological models at the individual level
• The structure and function of networks
• Probabilistic methods in group theory
• Distributed detection/localization of change-points in high-dimensional network traffic data
• The importance of contact network topology for the success of vaccination strategies
• On minimum reload cost cycle cover
• On the existence of a factor of degree one of a connected random graph
• Information diffusion in social sensing
• A classification of orbits admitting a unique invariant measure
• Pinning control for synchronization of nonlinear complex dynamical network with suboptimal SDRE controllers
• The transmission process: a combinatorial stochastic process for the evolution of transmission trees over networks
• A randomized algorithm with local search for containment of pandemic disease spread
• The impact of other-regarding tendencies on the spatial vaccination game
• The firefighter problem: empirical results on random graphs
• Prevention of infectious diseases by public vaccination and individual protection
• Finding the shortest paths by node combination
• An evolution of interval graphs
• Pinning synchronization of the complex networks with non-delayed and delayed coupling
• Connected components and evolution of random graphs: An algebraic approach
• Network evolution by different rewiring schemes
• Network models and financial stability
• The degree distribution of the generalized duplication model
• The giant component after percolation of product graphs
• Evaluation of the Copycat Model for Predicting Complex Network Growth
• Immunization strategy based on the critical node in percolation transition
• Bounding the \(HL\)-index of a graph: a majorization approach
• Responsive immunization and intervention for infectious diseases in social networks
• Risk estimation of infectious diseases determines the effectiveness of the control strategy
• On the number of positive solutions of a nonlinear algebraic system
• Angular synchronization by eigenvectors and semidefinite programming
• Parallel graph component labelling with GPUs and CUDA
• Communication network designing: transmission capacity, cost and scalability
• On the time to identify the nodes in a random graph
• Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA
• The first international competition on computational models of argumentation: results and analysis
• A network with tunable clustering, degree correlation and degree distribution, and an epidemic thereon
• A Geometric Preferential Attachment Model of Networks II
• Analysis of operating principles with S-system models
• Limit distribution for the existence of Hamiltonian cycles in a random graph
• Spectral statistics of Erdős-Rényi graphs. I: Local semicircle law
• The fundamental group of random 2-complexes.
• Adaptive exponential synchronization of coupled complex networks on general graphs
• Degree sequences of random graphs
• Vibrational resonance in neuron populations with hybrid synapses
• Random induced subgraphs of Cayley graphs induced by transpositions
• The von Neumann entropy of random multipartite graphs
• A Berry-Esseen bound with applications to vertex degree counts in the Erdős-Rényi random graph
• Model-based clustering of large networks
• Measuring the robustness of a network using minimal vertex covers
• Evolution of social networks
• A bilevel programming model for proactive countermeasure selection in complex ICT systems
• General graph pebbling
• On computing the diameter of real-world undirected graphs
• A decomposition approach for stochastic shortest-path network interdiction with goal threshold
• Sandwiching random graphs: universality between random graph models
• Modeling the influence of information on the coevolution of contact networks and the dynamics of infectious diseases

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3267900)