scientific article; zbMATH DE number 3168330
From MaRDI portal
Publication:3286850
Recommendations
Cited in
(only showing first 100 items - show all)- Minimal attractors in digraph system models of neuronal networks
- On pinning synchronization of complex dynamical networks
- On the k-orientability of random graphs
- A note on coloring sparse random graphs
- Navigable small-world networks with few random bits
- The Alexander-Orbach conjecture holds in high dimensions
- The evolution of the min-min random graph process
- A model of the emergence and evolution of integrated worldviews
- Topological-based bottleneck analysis and improvement strategies for traffic networks
- On a random graph evolving by degrees
- Almost all regular graphs are Hamiltonian
- Limit distribution for the existence of Hamiltonian cycles in a random graph
- On the connectivity of random m-orientable graphs and digraphs
- k-connectivity in random undirected graphs
- Hamiltonian cycles in random regular graphs
- Component structure in the evolution of random hypergraphs
- Random near-regular graphs and the node packing problem
- On the value of a random minimum spanning tree problem
- On a method for random graphs
- Induced trees in sparse random graphs
- On the order of the largest induced tree in a random graph
- An exact threshold theorem for random graphs and the node-packing problem
- Random hypergraphs and topological gelation criterion for crosslinked polymer systems
- Threshold phenomena in random structures
- Poisson convergence and Poisson processes with applications to random graphs
- On the number of induced subgraphs of a random graph
- Maximal paths in random dynamic graphs
- Random interval graphs
- Asymptotic normality of graph statistics
- Subgraph counts in random graphs using incomplete U-statistics methods
- \(k\)-connectivity in random graphs
- The asymptotic distribution of short cycles in random regular graphs
- Degree sequences of random graphs
- Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations
- The asymptotic probability that a random graph is a unit interval graph, indifference graph, or proper interval graph
- One-factor in random graphs based on vertex choice
- Holes in random graphs
- Connectivity threshold for random chordal graphs
- Size and connectivity of the \(k\)-core of a random graph
- Threshold functions for local properties of graphs: Triangles
- Random subgraphs of the \(n\)-cycle and the \(n\)-wheel
- Expected parallel time and sequential space complexity of graph and digraph problems
- Infinitary logics and 0-1 laws
- Matching theory -- a sampler: From Dénes König to the present
- The size of the largest hole in a random graph
- An exact probability distribution on the connectivity of random graphs
- Some applications of graph theory to clustering
- Hamiltonian circuits in random graphs
- Data analysis and the connectivity of random graphs
- The maximum number of K_j-subgraphs in a graph with k independent edges
- On the chromatic index of almost all graphs
- Survey sampling in graphs
- On finite superuniversal graphs
- Evolution of the n-cube
- A central limit theorem for decomposable random variables with applications to random graphs
- A series criterion for the almost-sure growth rate of the generalized diameter of an increasing sequence of random points
- Elements of a theory of computer simulation. I
- Constructing optimal ultrametrics
- Extremal problems and generalized degrees
- Phase transition phenomena in random discrete structures
- Brownian excursions, critical random graphs and the multiplicative coalescent
- Random induced subgraphs of generalized \(n\)-cubes
- The hidden algorithm of Ore's theorem on Hamiltonian cycles
- Factorizing the complete graph into factors with large star number
- Scale-free networks in evolution
- Penalized estimation of directed acyclic graphs from discrete data
- Principles of statistical mechanics of uncorrelated random networks
- A local-world evolving network model
- Complexity and synchronization of the World Trade Web
- Length of optimal path in random networks with strong disorder
- A dynamical characterization of the small world phase
- Latent space modelling of multidimensional networks with application to the exchange of votes in Eurovision song contest
- Statistical evaluation of algebraic constraints for social networks
- Pinning control of scale-free dynamical networks
- The phase transition in a random hypergraph
- A network model characterized by a latent attribute structure with competition
- Exceptional times of the critical dynamical Erdős-Rényi graph
- Sampling social networks using shortest paths
- Growing network: models following nonlinear preferential attachment rule
- Comparison of communities detection algorithms for multiplex
- Age, innovations and time operator of networks
- Epidemic spreading driven by biased random walks
- Network topology inference from infection statistics
- Design of inner coupling matrix for robustly self-synchronizing networks
- Traffic-driven SIR epidemic spreading in networks
- Evolving dynamics of trading behavior based on coordination game in complex networks
- A method of characterizing network topology based on the breadth-first search tree
- Explosive percolation in thresholded networks
- A method of examining the structure and topological properties of public-transport networks
- Vulnerability of complex networks under three-level-tree attacks
- A general stochastic model for studying time evolution of transition networks
- Spreading dynamics in heterogeneous graphs: beyond the assortativity coefficient
- Optimizing controllability of edge dynamics in complex networks by perturbing network structure
- Equilibrium distributions in entropy driven balanced processes
- Spectral coarse grained controllability of complex networks
- Unique entity estimation with application to the Syrian conflict
- Sharpness of the phase transition for continuum percolation in \(\mathbb{R}^2\)
- Fractional PI pinning synchronization of fractional complex dynamical networks
- Structure-oriented prediction in complex networks
- Reconstruction methods for networks: the case of economic and financial systems
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 Q3286850)
