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)

• Two-dimensional gauge theories of the symmetric group \(S_n\) and branched \(n\)-coverings of Riemann surfaces in the large-\(n\) limit
• Percolation on an infinitely generated group
• Optimization via low-rank approximation for community detection in networks
• Analytical results for the distribution of first hitting times of random walks on random regular graphs
• Random hypergraphs and topological gelation criterion for crosslinked polymer systems
• Network Measures in Civil Air Transport: A Case Study of Lufthansa
• On the line graph of a graph with diameter 2
• Random Networks of Catalytic Biochemical Reactions
• Maximal paths in random dynamic graphs
• Perfect matchings in random subgraphs of regular bipartite graphs
• Gambler's ruin problem on Erdős-Rényi graphs
• The rumor diffusion process with emerging independent spreaders in complex networks
• The relative fit measure for evaluating a blockmodel
• Estimating Time-Varying Graphical Models
• On dynamic network security: a random decentering algorithm on graphs
• Health behavior spreading with similar diminishing returns effect
• Nucleation of a three-state spin model on complex networks
• The independent spreaders involved SIR rumor model in complex networks
• A small-world and scale-free network generated by Sierpinski pentagon
• Architectures engender crises: the emergence of power laws in social networks
• From the grid to the smart grid, topologically
• Investigating the relationship between \(k\)-core and \(s\)-core network decompositions
• Strong ties promote the epidemic prevalence in susceptible-infected-susceptible spreading dynamics
• Functional brain networks in Alzheimer's disease: EEG analysis based on limited penetrable visibility graph and phase space method
• A distance constrained synaptic plasticity model of \textit{C. elegans} neuronal network
• Empirical study of the role of the topology in spreading on communication networks
• Role of delay-based reward in the spatial cooperation
• Positive and negative effects of social impact on evolutionary vaccination game in networks
• SIS epidemic spreading with correlated heterogeneous infection rates
• Length of optimal path in random networks with strong disorder
• Network linear discriminant analysis
• The spreading of opposite opinions on online social networks with authoritative nodes
• Higher order assortativity in complex networks
• Ferromagnetic transition in a simple variant of the Ising model on multiplex networks
• A fast randomized algorithm for partitioning a graph into paths of fixed length
• Minimizing the expected complete influence time of a social network
• Epidemic spreading on uniform networks with two interacting diseases
• Community structure inhibits cooperation in the spatial prisoner's dilemma
• Damage attack on complex networks
• Locating inefficient links in a large-scale transportation network
• Trapping on modular scale-free and small-world networks with multiple hubs
• On algebraic connectivity of directed scale-free networks
• Random numerical semigroups and a simplicial complex of irreducible semigroups
• Random monomial ideals
• Discovering patterns in time-varying graphs: a triclustering approach
• The probability of unusually large components in the near-critical Erdős-Rényi graph
• Convergence to global consensus in opinion dynamics under a nonlinear voter model
• Equilibrium games in networks
• The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem
• A hybrid breakout local search and reinforcement learning approach to the vertex separator problem
• A metric to compare vulnerability of the graphs of different sizes
• The distribution of first hitting times of randomwalks on Erdős-Rényi networks
• The distribution of first hitting times of non-backtracking random walks on Erdos-Rényi networks
• Maximizing algebraic connectivity for certain families of graphs
• A Sum of Squares Characterization of Perfect Graphs
• Uniform random posets
• Information spreading in complex networks with participation of independent spreaders
• Non-consensus opinion models on complex networks
• Epidemic spread in directed interconnected networks
• Degree correlations in signed social networks
• Boolean dynamics of Kauffman models with a scale-free network
• False beliefs in unreliable knowledge networks
• A condition for cooperation in a game on complex networks
• Bipartite and directed scale-free complex networks arising from zeta functions
• Scale-free behavior of networks with the copresence of preferential and uniform attachment rules
• Epidemiologic network inference
• Epidemics in adaptive social networks with temporary link deactivation
• Random quantum graphs
• Tree and forest weights and their application to nonuniform random graphs
• The impact of network inhomogeneities on contagion and system stability
• Cycle lengths in randomly perturbed graphs
• A complex network approach to text summarization
• An opposition-based memetic algorithm for the maximum quasi-clique problem
• On the estimation of correlation in a binary sequence model
• On stable systems with random structure
• On sparse graphs with dense long paths
• Berry-Esseen bounds for functionals of independent random variables
• Uncertain vertex coloring problem
• Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations
• Role of the plurality rule in multiple choices
• A processor efficient MIS algorithm on random graphs
• Extremal problems and generalized degrees
• The distribution of first hitting times of random walks on directed Erdős–Rényi networks
• A network structural approach to the link prediction problem
• Centrosymmetric stochastic matrices
• A model of the emergence and evolution of integrated worldviews
• Graph evolution by stochastic additions of points and lines
• The largest tree in a random graph
• Survey sampling in graphs
• Title not available (Why is that?)
• Radio communication in random graphs
• On Hamilton-cycles of random graphs
• On global site-percolation on the correlated honeycomb lattice
• The asymptotic number of labeled graphs with \(n\) vertices, \(q\) edges, and no isolated vertices
• Non-concentration of the chromatic number of a random graph
• Title not available (Why is that?)
• Synchronization of Network-Coupled Oscillators with Uncertain Dynamics
• Dynamic single-source shortest paths in Erdős-Rényi random graphs
• Nonuniversality of weighted random graphs with infinite variance degree
• A family of small-world network models built by complete graph and iteration-function

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)