scientific article; zbMATH DE number 1866312

zbMATH Open1109.68537MaRDI QIDQ4792127FDOQ4792127

Authors: S. N. Dorogovtsev, J. F. F. Mendes 

Publication date: 11 February 2003

Title of this publication is not available (Why is that?)

Recommendations

• Network evolution and the emergence of structure
• Network of evolutionary processors, past, present and future
• Networks: Optimisation and evolution.
• Networks
• Evolution of the internet AS-level ecosystem
• Networks
• Network evolution by different rewiring schemes
• On Darwinian networks
• The networked evolutionary algorithm: a network science perspective

zbMATH Keywords

communication networks

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01)

Cited In (only showing first 100 items - show all)

• Radial drawings of graphs: geometric constraints and trade-offs
• Complex systems: features, similarity and connectivity
• Loops of any size and Hamilton cycles in random scale-free networks
• OPTIMIZATION OF SCALE-FREE NETWORK FOR RANDOM FAILURES
• Edge flows in the complete random-lengths network
• On exponential convergence of dynamic queueing network and its applications
• OPTIMIZATION OF ROBUSTNESS OF SCALE-FREE NETWORK TO RANDOM AND TARGETED ATTACKS
• Distinct clusterings and characteristic path lengths in dynamic small-world networks with identical limit degree distribution
• Vulnerability of weighted networks
• False positive and false negative effects on network attacks
• Dynamics of hate based internet user networks
• Epidemic threshold and phase transition in scale-free networks with asymmetric infection
• Cluster structure of EU-15 countries derived from the correlation matrix analysis of macroeconomic index fluctuations
• Reaction-diffusion processes and epidemic metapopulation models in complex networks
• An algorithm J-SC of detecting communities in complex networks
• Finite-time fluctuations in the degree statistics of growing networks
• Random walks and diffusion on networks
• A bi-stable neuronal model of Gibbs distribution
• Stochastic Lotka-Volterra equations: a model of lagged diffusion of technology in an interconnected world
• Knowledge spillover processes as complex networks
• Unstable network fragmentation in co-evolution of Potts spins and system topology
• Average weighted receiving time on the non-homogeneous double-weighted fractal networks
• Spreading dynamics in heterogeneous graphs: beyond the assortativity coefficient
• Length of optimal path in random networks with strong disorder
• Anomalous electrical and frictionless flow conductance in complex networks
• Navigation in spatial networks: a survey
• Ising spin glass models versus Ising models: an effective mapping at high temperature. I: General result
• A \(k\)-shell decomposition method for weighted networks
• Parallelism in simulation and modeling of scale-free complex networks
• Balancing conservative and disruptive growth in the voter model
• Markov-binary visibility graph: a new method for analyzing complex systems
• Evolutionary stability and the evolution of cooperation on heterogeneous graphs
• Non-consensus opinion models on complex networks
• Average weighted trapping time of the node- and edge-weighted fractal networks
• Epidemic spread in directed interconnected networks
• Iterative procedure for network inference
• A difference equation approach to statistical mechanics of complex networks
• Low-rank method for fast solution of generalized Smoluchowski equations
• Twitter event networks and the superstar model
• A Markov chain approach to randomly grown graphs
• Asymptotic theory for the multidimensional random on-line nearest-neighbour graph
• Degree distribution of shortest path trees and bias of network sampling algorithms
• Cosmological networks
• OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS
• Sublinear but never superlinear preferential attachment by local network growth
• Percolation of arbitrary uncorrelated nested subgraphs
• Techniques for analyzing dynamic random graph models of web-like networks: An overview
• Diffusion processes of fragmentary information on scale-free networks
• On brain and immune networks and an application
• The critical point of \(k\)-clique percolation in the Erdős-Rényi graph
• Introduction to complex networks: structure and dynamics
• An imperfect competition on scale-free networks
• Influence of topology in the evolution of coordination in complex networks under information diffusion constraints
• Self-organization in trees and motifs of two-dimensional chaotic maps with time delay
• Phase transitions in social networks
• Convergence properties of the degree distribution of some growing network models
• Dynamical patterns of epidemic outbreaks in complex heterogeneous networks
• Network topology of the interbank market
• Game theoretic modelling of infectious disease dynamics and intervention methods: a review
• On the limiting behavior of parameter-dependent network centrality measures
• Condensation in the inhomogeneous zero-range process: an interplay between interaction and diffusion disorder
• Novel scaling limits for critical inhomogeneous random graphs
• The modeling of global epidemics: stochastic dynamics and predictability
• Escaping the tragedy of the commons via directed investments
• Generating simple random graphs with prescribed degree distribution
• Metric structure of random networks
• Design methodology of networked software evolution growth based on software patterns
• Complex networks: from graph theory to biology
• Complex networks: structure and dynamics
• The effects of spatial constraints on the evolution of weighted complex networks
• The use of dynamical networks to detect the hierarchical organization of financial market sectors
• Vulnerability of complex network structures and systems
• Generating stationary random graphs on ℤ with prescribed independent, identically distributed degrees
• Maximum entropy principle for Kaniadakis statistics and networks
• Time-varying network models
• Prosperity is associated with instability in dynamical networks
• Network synchronization: Spectral versus statistical properties
• Optimal convergence in naming game with geography-based negotiation on small-world networks
• Effects of agents' mobility on opinion spreading in Sznajd model
• Universal construction mechanism for networks from one-dimensional symbol sequences
• Repeated games and direct reciprocity under active linking
• Effects of homophily and heterophily on preferred-degree networks: mean-field analysis and overwhelming transition
• Epidemic control analysis: designing targeted intervention strategies against epidemics propagated on contact networks
• Multidimensional epidemic thresholds in diffusion processes over interdependent networks
• Probabilistic inequalities for evaluating structural network measures
• Scale-free graph with preferential attachment and evolving internal vertex structure
• Information dynamics algorithm for detecting communities in networks
• Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
• The combined effect of connectivity and dependency links on percolation of networks
• Selection pressure transforms the nature of social dilemmas in adaptive networks
• Ecological analysis of world trade
• Trapping time of weighted-dependent walks depending on the weight factor
• The analysis of epidemic network model with infectious force in latent and infected period
• A Dynamic Model of Segregation in Small-World Networks
• Interacting particle systems as stochastic social dynamics
• Emergence of fractal scale-free networks from stochastic evolution on the Cayley tree
• Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that
• Epidemic modeling in metapopulation systems with heterogeneous coupling pattern: theory and simulations
• Global disease spread: statistics and estimation of arrival times
• Approximating Betweenness Centrality in Fully Dynamic Networks

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 Q4792127)