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)
- A probabilistic spatial distribution model for wire faults in parallel network-on-chip links
- Micro- and macromodels of social networks. I: Theory fundamentals
- Maximum likelihood estimation in the \(\beta\)-model
- Analyzing the maritime transportation system in Greece: a complex network approach
- Spatial science and network science: review and outcomes of a complex relationship
- A note on parallel sampling in Markov graphs
- Classification and estimation in the stochastic blockmodel based on the empirical degrees
- Graph matching beyond perfectly-overlapping Erdős--Rényi random graphs
- Conflict and error prevention and detection in complex networks
- Learning network structures from contagion
- Complexity of equilibrium in competitive diffusion games on social networks
- A conceptual approach to online social networks analysis
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- Evolution of the social network of scientific collaborations
- A derandomized approximation algorithm for the critical node detection problem
- Robust \(\mathcal{H}_{\infty}\) decentralized dynamic control for synchronization of a complex dynamical network with randomly occurring uncertainties
- An integer programming framework for critical elements detection in graphs
- Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
- Generating simple random graphs with prescribed degree distribution
- Tight bounds for the cover time of multiple random walks
- Connectivity of soft random geometric graphs over annuli
- Connectivity of soft random geometric graphs
- Epidemic models on social networks—With inference
- On pinning synchronization of complex dynamical networks
- Complex networks: structure and dynamics
- Global stabilization of complex networks with digraph topologies via a local pinning algorithm
- Analyzing complex networks evolution through Information Theory quantifiers
- Universality of local spectral statistics of random matrices
- A branch-and-bound approach for maximum quasi-cliques
- Network of interacting neurons with random synaptic weights
- Time-varying network models
- Uniqueness of the infinite component in a random graph with applications to percolation and spin glasses
- Parameter identifiability in a class of random graph mixture models
- Maximum likelihood analysis of the Ford-Fulkerson method on special graphs
- Dynamic graphs
- Simple and efficient local codes for distributed stable network construction
- Approximating evolutionary dynamics on networks using a neighbourhood configuration model
- Finding maximum subgraphs with relatively large vertex connectivity
- Emergence of the giant component in preferential-attachment growing networks
- Spectral properties of unimodular lattice triangulations
- Networks that optimize a trade-off between efficiency and dynamical resilience
- Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth
- Hierarchical random cellular neural networks for system-level brain-like signal processing
- Hierarchical models for independence structures of networks
- Minimum k‐cores and the k‐core polytope
- Elements of a theory of computer simulation. I
- Robustness analysis of static routing on networks
- Multidimensional epidemic thresholds in diffusion processes over interdependent networks
- Synchronization of complex dynamical networks with discontinuous coupling signals
- Agents of change and the approximation of network outcomes: a simulation study
- The Laplacian energy and Laplacian Estrada index of random multipartite graphs
- Minimum vertex cover in generalized random graphs with power law degree distribution
- Compact pairwise models for epidemics with multiple infectious stages on degree heterogeneous and clustered networks
- Scale-free graph with preferential attachment and evolving internal vertex structure
- A comprehensive multi-local-world model for complex networks
- Effective degree network disease models
- Optimal link removal for epidemic mitigation: A two-way partitioning approach
- An optimal approach for the critical node problem using semidefinite programming
- A coarse-grained framework for spiking neuronal networks: between homogeneity and synchrony
- Matching theory -- a sampler: From Dénes König to the present
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
- Optimal and near-optimal broadcast in random graphs
- Graph spectra as a systematic tool in computational biology
- Asymptotic normality of graph statistics
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- k-connectivity in random undirected graphs
- The graph spectra and spectral moments of random graphs
- Random sampling and greedy sparsification for matroid optimization problems
- An integer programming approach for finding the most and the least central cliques
- Measuring instance difficulty for combinatorial optimization problems
- Invasion threshold in structured populations with recurrent mobility patterns
- Generating directed networks with predetermined assortativity measures
- A Hotelling-Type Network
- Swarming on random graphs
- Exact solution approaches for a class of bilevel fractional programs
- On the network topology of variance decompositions: measuring the connectedness of financial firms
- Sharp vanishing thresholds for cohomology of random flag complexes
- ILIGRA: an efficient inverse line graph algorithm
- CoReS: a tool for computing core graphs via SAT/SMT solvers
- Testing Linearity for Network Autoregressive Models
- Optimal change point detection and localization in sparse dynamic networks
- Incentive-based search for equilibria in Boolean games
- Spectral clustering and the high-dimensional stochastic blockmodel
- Review of statistical network analysis: models, algorithms, and software
- Expander graphs and their applications
- Title not available (Why is that?)
- Correlation between graphs with an application to brain network analysis
- Latent Space Modeling of Multidimensional Networks with Application to the Exchange of Votes in Eurovision Song Contest
- Topology of random clique complexes
- Identification of peer effects through social networks
- Uncovering latent structure in valued graphs: a variational approach
- Human mobility and time spent at destination: impact on spatial epidemic spreading
- Pinning synchronization of complex networks with time-varying outer coupling and nonlinear multiple time-varying delay coupling
- Network alignment by discrete Ollivier-Ricci flow
- Integer programming approach to static monopolies in graphs
- Two Hardness Results on Feedback Vertex Sets
- Spectral distributions of adjacency and Laplacian matrices of random graphs
- Identifying a Set of Key Members in Social Networks Using SDP-Based Stochastic Search and Integer Programming Algorithms
- On the strength of connectedness of a random graph
- Unimodular lattice triangulations as small-world and scale-free random graphs
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)
