scientific article; zbMATH DE number 3150484
From MaRDI portal
Publication:3267900
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
Cited In (only showing first 100 items - show all)
- Law of large numbers for the largest component in a hyperbolic model of complex networks
- Spectral theory of sparse non-Hermitian random matrices
- A scale-free graph model based on bipartite graphs
- Connectivity and dynamics for random subgraphs of the directed cube
- Recovering nonuniform planted partitions via iterated projection
- Asset price dynamics with heterogeneous beliefs and local network interactions
- Reactive local search techniques for the maximum \(k\)-conjunctive constraint satisfaction problem \((MAX-k-CCSP)\)
- Exact controllability of multiplex networks
- Critical points for random Boolean networks
- Instability and network effects in innovative markets
- On the average-case complexity of parameterized clique
- Bipartite structure of all complex networks
- Decentralized guaranteed cost dynamic control for synchronization of a complex dynamical network with randomly switching topology
- Pareto optimization for subset selection with dynamic cost constraints
- Analyzing complex networks through correlations in centrality measurements
- Low eigenvalues of Laplacian matrices of large random graphs
- Degree distribution in discrete case
- The distribution of the relative arc density of a family of interval catch digraph based on uniform data
- The average path length of scale free networks
- Random Laplacian matrices and convex relaxations
- Improving the efficiency of attractor cycle identification in Boolean networks
- Monotone properties of random geometric graphs have sharp thresholds
- Cores of random \(r\)-partite hypergraphs
- Spectral norm bounds for block Markov chain random matrices
- Universal construction mechanism for networks from one-dimensional symbol sequences
- New upper bound for the chromatic number of a random subgraph of a distance graph
- On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes
- Validity studies in clustering methodologies
- The performance model of dynamic virtual organization (VO) formations within grid computing context
- On robust clusters of minimum cardinality in networks
- A local-world evolving network model
- Colorings of partial Steiner systems and their applications
- Constructions of independent sets in random intersection graphs
- Euler index in uncertain graph
- Distance-sum heterogeneity in graphs and complex networks
- Random Subgraphs in Sparse Graphs
- Birth and growth of multicyclic components in random hypergraphs
- General compartmental epidemic models
- Balanced and 1-balanced graph constructions
- Measuring distances between complex networks
- Rumor propagation with heterogeneous transmission in social networks
- Conditional estimation of exponential random graph models from snowball sampling designs
- Central and local limit theorems for the coefficients of polynomials of binomial type
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search
- Comparison of relative density of two random geometric digraph families in testing spatial clustering
- Online balanced graph avoidance games
- Vital layer nodes of multiplex networks for immunization and attack
- Explosive synchronization transitions in complex neural networks
- An exact probability distribution on the connectivity of random graphs
- Data analysis and the connectivity of random graphs
- Random degree–degree correlated networks
- ON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH
- Enhancing synchrony in asymmetrically weighted multiplex networks
- Assessing the quality of multilevel graph clustering
- Genetic network models and statistical properties of gene expression data in knock-out experiments
- Model free estimation of graphical model using gene expression data
- A polyhedral study of the maximum edge subgraph problem
- A discussion of the favorable factors for the economic system's utility growth rate
- Co-evolution of strategies and update rules in the prisoner's dilemma game on complex networks
- A combinatorial Li-Yau inequality and rational points on curves
- Large deviations of the greedy independent set algorithm on sparse random graphs
- A fixed point theorem for a general epidemic model
- Random half-integral polytopes
- Efficient routeing in Poisson small-world networks
- A one-parameter family of stationary solutions in the susceptible-infected-susceptible epidemic model
- Generation of networks with prescribed degree-dependent clustering
- Average-case analysis of incremental topological ordering
- On the radius of centrality in evolving communication networks
- Inter-layer synchronization in multiplex networks of identical layers
- Average update times for fully-dynamic all-pairs shortest paths
- Thresholds and expectation-thresholds of monotone properties with small minterms
- Zero temperature Glauber dynamics on complex networks
- Complexity and synchronization of the World Trade Web
- Evolutionary vaccination dynamics with internal support mechanisms
- Synchronization in random networks with given expected degree sequences
- Incentive-based search for efficient equilibria of the public goods game
- The application of complex network time series analysis in turbulent heated jets
- Connectivity threshold for random chordal graphs
- A Unifying Generative Model for Graph Learning Algorithms: Label Propagation, Graph Convolutions, and Combinations
- Random Čech complexes on Riemannian manifolds
- Scaling limits and generic bounds for exploration processes
- Another proof of Wright's inequalities
- A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan
- Identifying influential spreaders by weight degree centrality in complex networks
- Small subgraphs in the trace of a random walk
- Emergent behaviors in social networks of adaptive agents
- Percolation of interdependent network of networks
- Exploring networks with traceroute-like probes: Theory and simulations
- A quantum walk-assisted approximate algorithm for bounded NP optimisation problems
- Herd behavior and financial crashes: an interacting particle system approach
- Recent advances in percolation theory and its applications
- The Kuramoto model in complex networks
- Data based identification and prediction of nonlinear and complex dynamical systems
- Statistical physics of vaccination
- A preferential attachment model with Poisson growth for scale-free networks
- Poisson statistics and localization at the spectral edge of sparse Erdős-Rényi graphs
- Epidemics spreading in interconnected complex networks
- On distribution function of the diameter in uncertain graph
- Incremental single-source shortest paths in digraphs with arbitrary positive arc weights
- Statistical Characterization of a Small World Network Applied to Forest Fires
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)
