Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Distance in graphs (05C12) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Randomized algorithms (68W20) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Deterministic network models in operations research (90B10) Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35) Applications of graph theory to circuits and networks (94C15)
Recommendations
Cited in
(only showing first 100 items - show all)- The degree sequences of an asymmetrical growing network
- Returnability in complex directed networks (digraphs)
- Symmetric graph properties have independent edges
- The expected adjacency and modularity matrices in the degree corrected stochastic block model
- The robot crawler graph process
- The resistance perturbation distance: a metric for the analysis of dynamic networks
- Markov fundamental tensor and its applications to network analysis
- The degree analysis of an inhomogeneous growing network with two types of vertices
- Algebraic connectivity may explain the evolution of gene regulatory networks
- Testing goodness of fit of random graph models
- Evolution of a modified binomial random graph by agglomeration
- Bounded size biased couplings, log concave distributions and concentration of measure for occupancy models
- Random Laplacian matrices and convex relaxations
- Change point detection in network models: preferential attachment and long range dependence
- Law of large numbers for the largest component in a hyperbolic model of complex networks
- Cluster tails for critical power-law inhomogeneous random graphs
- Large deviations for the annealed Ising model on inhomogeneous random graphs: spins and degrees
- Developments in the theory of randomized shortest paths with a comparison of graph node distances
- Equilibrium games in networks
- Power-law partial correlation network models
- Large deviations for the degree structure in preferential attachment schemes
- Detecting local network motifs
- First passage percolation on random graphs with finite mean degrees
- PageRank on inhomogeneous random digraphs
- A modularity based spectral method for simultaneous community and anti-community detection
- Community detection in complex networks via adapted Kuramoto dynamics
- Sparse randomized shortest paths routing with Tsallis divergence regularization
- Concentration in the generalized Chinese restaurant process
- On Stein's factors for Poisson approximation in Wasserstein distance with nonlinear transportation costs
- An algorithm for improved delay-scaling in input-queued switches
- eGHWT: the extended generalized Haar-Walsh transform
- Mixed preferential attachment model: homophily and minorities in social networks
- The referenced vertex ordering problem: theory, applications, and solution methods
- A hierarchical Bayesian model for predicting ecological interactions using scaled evolutionary relationships
- A bag-of-paths framework for network data analysis
- Normal approximations for discrete-time occupancy processes
- The devil is in the details: spectrum and eigenvalue distribution of the discrete Preisach memory model
- Preferential attachment random graphs with edge-step functions
- Random geometric complexes and graphs on Riemannian manifolds in the thermodynamic limit
- PageRank's behavior under degree correlations
- Metastability of the contact process on fast evolving scale-free networks
- A probabilistic linear solver based on a multilevel Monte Carlo method
- Talagrand concentration inequalities for stochastic partial differential equations
- A constructive proof of a concentration bound for real-valued random variables
- A note on the warmth of random graphs with given expected degrees
- Linking and cutting spanning trees
- Taylor's power law for the \(N\)-stars network evolution model
- Convergence of a typical martingale (a remark on the Doob theorem)
- Degree distribution of shortest path trees and bias of network sampling algorithms
- Large communities in a scale-free network
- A cutting-plane algorithm for solving a weighted influence interdiction problem
- On hitting times for a simple random walk on dense Erdös-Rényi random graphs
- Evolution of social networks
- Time-varying network models
- Large deviations for power-law thinned Lévy processes
- The diffusion geometry of fibre bundles: horizontal diffusion maps
- A concentration inequality for the facility location problem
- A random growth model with any real or theoretical degree distribution
- Persistence of network synchronization under nonidentical coupling functions
- A remark on the spectra of random graphs with given expected degrees
- Typical distances in ultrasmall random networks
- The first-order contiguity of sparse random graphs with prescribed degrees
- Spectral properties of unimodular lattice triangulations
- The many faces of graph dynamics
- Typical distances in a geometric model for complex networks
- GRAPHS, NETWORKS AND ACE
- The number of Seymour vertices in random tournaments and digraphs
- Symmetric graph properties have independent edges
- Core size and densification in preferential attachment networks
- Constructive discrepancy minimization by walking on the edges
- Techniques for analyzing dynamic random graph models of web-like networks: An overview
- Local/Global Phenomena in Geometrically Generated Graphs
- Scale-free graph with preferential attachment and evolving internal vertex structure
- Small-world graphs: characterization and alternative constructions
- From Graph Theory to Models of Economic Networks. A Tutorial
- Modeling and Designing Real–World Networks
- Large deviations for the leaves in some random trees
- From quasirandom graphs to graph limits and graphlets
- Isospectral graph reductions and improved estimates of matrices' spectra
- Mapping Out Emerging Network Structures in Dynamic Network Models Coupled with Epidemics
- The connected component of the partial duplication graph
- Graph annotations in modeling complex network topologies
- The Fiedler vector of a Laplacian tensor for hypergraph partitioning
- The geometric spectrum of a graph and associated curvatures
- KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
- Community detection in networks via nonlinear modularity eigenvectors
- Spectral properties of the trap model on sparse networks
- Concentration of the Kirchhoff index for Erdős-Rényi graphs
- scientific article; zbMATH DE number 910356 (Why is no real title available?)
- Large networks and graph limits
- Fractality of substitution networks
- Some typical properties of the spatial preferred attachment model
- Some properties of random Apollonian networks
- A stochastic model of active cyber defense dynamics
- Speed and concentration of the covering time for structured coupon collectors
- Improved queue-size scaling for input-queued switches via graph factorization
- Graphs and networks
- A Scalable Unsupervised Framework for Comparing Graph Embeddings
- The iterated local directed transitivity model for social networks
- Iterated global models for complex networks
This page was built for publication: Complex graphs and networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5489870)
