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)

• The number of possibilities for random dating
• Synchronization of energy transmission networks at low voltage levels
• Networks beyond pairwise interactions: structure and dynamics
• True scale-free networks hidden by finite size effects
• Efficient algorithms for cluster editing
• Compound Poisson models for weighted networks with applications in finance
• High dimensional regression for regenerative time-series: an application to road traffic modeling
• Large-scale estimation of random graph models with local dependence
• Analytical and statistical studies of Rodriguez-Velazquez indices
• Failure and communication in a synchronized multi-drone system
• A diffusive strategic dynamics for social systems
• Reconstruction of graphs based on random walks
• Unstable diffusion in social networks
• Can rewiring strategy control the epidemic spreading?
• Search for an immobile hider on a stochastic network
• Gaussianization of the spectra of graphs and networks. Theory and applications
• Fundamentals of spreading processes in single and multilayer complex networks
• Reconstruction methods for networks: the case of economic and financial systems
• Flow shop scheduling problem with conflict graphs
• Computational and analytical studies of the Randić index in Erdős-Rényi models
• Successive minimum spanning trees
• Models of kleptoparasitism on networks: the effect of population structure on food stealing behaviour
• Epidemic spreading on weighted adaptive networks
• Variance of the subgraph count for sparse Erdős-Rényi graphs
• Block matrix formulations for evolving networks
• On the behavior of intrinsically high-dimensional spaces: distances, direct and reverse nearest neighbors, and hubness
• Anomalous electrical and frictionless flow conductance in complex networks
• Equilibrium distributions in entropy driven balanced processes
• An average study of hypergraphs and their minimal transversals
• A latent space model for multilayer network data
• A Random Graph With a Subcritical Number of Edges
• Finding clique clusters with the highest betweenness centrality
• Adjustable network reconstruction with applications to CDS exposures
• Discrimination through versioning with advertising in social networks
• Homological connectivity in random Čech complexes
• 2-Xor revisited: satisfiability and probabilities of functions
• Analysis of Linux kernel as a complex network
• The relevance of xylem network structure for plant hydraulic efficiency and safety
• Measuring vertex centrality using the Holevo quantity
• Consistent structure estimation of exponential-family random graph models with block structure
• The joint impact of bankruptcy costs, fire sales and cross-holdings on systemic risk in financial networks
• Modeling interacting dynamic networks. I: Preferred degree networks and their characteristics
• Homological connectedness of random hypergraphs
• Computational experience with minimum spanning tree algorithms
• A difference equation approach to statistical mechanics of complex networks
• Estimating social effects in a multilayered linear-in-means model with network data
• On the maximum betweenness improvement problem
• Analysis of crowdsourced sampling strategies for HodgeRank with sparse random graphs
• Explosive synchronization in populations of cooperative and competitive oscillators
• Average case analysis of fully dynamic reachability for directed graphs
• Heterogeneity in evolutionary games: an analysis of the risk perception
• Covering algorithms, continuum percolation and the geometry of wireless networks
• Systemic risk in multiplex networks with asymmetric coupling and threshold feedback
• Hypothesis testing for populations of networks
• A PROBABILISTIC FRIENDSHIP NETWORK MODEL
• Networks, frictions, and price dispersion
• Spectral classes of regular, random, and empirical graphs
• Evolution of a modified binomial random graph by agglomeration
• Enumeration of graphs with a heavy-tailed degree sequence
• Invariant measures via inverse limits of finite structures
• Refined pivot selection for maximal clique enumeration in graphs
• Probabilistic and exact frequent subtree mining in graphs beyond forests
• Complexity-theoretic models of phase transitions in search problems
• Homology of multi-parameter random simplicial complexes
• Modelling structured societies: a multi-relational approach to context permeability
• Percolation of arbitrary uncorrelated nested subgraphs
• Topology of whole-brain functional MRI networks: improving the truncated scale-free model
• Criticality in random threshold networks: annealed approximation and beyond
• Clique-based method for social network clustering
• Uncertain multi-objective Chinese postman problem
• Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
• Density decompositions of networks
• Improving the filtering of branch-and-bound MDD solver
• Survival time of a random graph
• New doubly-anomalous Parrondo's games suggest emergent sustainability and inequality
• Introduction to complex networks: structure and dynamics
• Exploring the “Middle Earth” of network spectra via a Gaussian matrix function
• An efficient semidefinite programming relaxation for the graph partition problem
• Phase transition in cohomology groups of non-uniform random simplicial complexes
• Synchronised firing patterns in a random network of adaptive exponential integrate-and-fire neuron model
• ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs
• An imperfect competition on scale-free networks
• First cycles in random directed graph processes
• Synchronization of coupled networks with mixed delays by intermittent control
• Исследование статистик графов ближайших соседей
• Financial networks and interconnectedness in an advanced emerging market economy
• On the connectivity of random m-orientable graphs and digraphs
• Random subgraphs of the n-cycle
• Controllability of the better chosen partial networks
• Relationship between degree-rank function and degree distribution of protein-protein interaction networks
• Application of pair approximation method to modeling and analysis of a marriage network
• Evolutionary game dynamics of combining the payoff-driven and conformity-driven update rules
• Evolution of random graph processes with degree constraints
• Local law and Tracy-Widom limit for sparse random matrices
• Maximum likelihood estimation for discrete exponential families and random graphs
• A method of examining the structure and topological properties of public-transport networks
• Colorings of spaces, and random graphs
• Title not available (Why is that?)
• Average-Case Analysis of Online Topological Ordering
• Limit distribution for the existence of Hamiltonian cycles in a random graph. (Reprint)

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)