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