Complex graphs and networks
From MaRDI portal
Publication:5489870
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Distance in graphs (05C12) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Applications of graph theory to circuits and networks (94C15)
Recommendations
Cited in
(only showing first 100 items - show all)- Voter models on subcritical scale‐free random graphs
- Heavy-traffic analysis through uniform acceleration of queues with diminishing populations
- Detecting local network motifs
- The degree sequences of an asymmetrical growing network
- Change point detection in network models: preferential attachment and long range dependence
- The \(N\)-star network evolution model
- The resistance perturbation distance: a metric for the analysis of dynamic networks
- eGHWT: the extended generalized Haar-Walsh transform
- An algorithm for improved delay-scaling in input-queued switches
- On hitting times for a simple random walk on dense Erdös-Rényi random graphs
- A cutting-plane algorithm for solving a weighted influence interdiction problem
- Total variation based community detection using a nonlinear optimization approach
- Clustering and the hyperbolic geometry of complex networks
- Fractality of substitution networks
- Modularity based community detection in hypergraphs
- Sparse randomized shortest paths routing with Tsallis divergence regularization
- A hierarchical Bayesian model for predicting ecological interactions using scaled evolutionary relationships
- The degree analysis of an inhomogeneous growing network with two types of vertices
- A class of scale-free networks with fractal structure based on subshift of finite type
- Symmetric graph properties have independent edges
- The devil is in the details: spectrum and eigenvalue distribution of the discrete Preisach memory model
- PageRank on inhomogeneous random digraphs
- The referenced vertex ordering problem: theory, applications, and solution methods
- Concentration in the generalized Chinese restaurant process
- Large deviations for the degree structure in preferential attachment schemes
- A bag-of-paths framework for network data analysis
- Neural network spectral robustness under perturbations of the underlying graph
- Preferential attachment random graphs with edge-step functions
- The first-order contiguity of sparse random graphs with prescribed degrees
- Mixed preferential attachment model: homophily and minorities in social networks
- The diffusion geometry of fibre bundles: horizontal diffusion maps
- Markov fundamental tensor and its applications to network analysis
- Normal approximations for discrete-time occupancy processes
- A concentration inequality for the facility location problem
- A modularity based spectral method for simultaneous community and anti-community detection
- Persistence of network synchronization under nonidentical coupling functions
- Some properties of random Apollonian networks
- A stochastic model of active cyber defense dynamics
- Improved queue-size scaling for input-queued switches via graph factorization
- Developments in the theory of randomized shortest paths with a comparison of graph node distances
- Testing goodness of fit of random graph models
- The connected component of the partial duplication graph
- KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
- PageRank's behavior under degree correlations
- Scale-free graphs of increasing degree
- Power-law partial correlation network models
- On Stein's factors for Poisson approximation in Wasserstein distance with nonlinear transportation costs
- Degree distribution of shortest path trees and bias of network sampling algorithms
- Metastability of the contact process on fast evolving scale-free networks
- Community detection in complex networks via adapted Kuramoto dynamics
- Symmetric graph properties have independent edges
- Large communities in a scale-free network
- The expected adjacency and modularity matrices in the degree corrected stochastic block model
- The robot crawler graph process
- Equilibrium games in networks
- Nonuniform distribution of nodes in the spatial preferential attachment model
- Spectral properties of the trap model on sparse networks
- Random geometric complexes and graphs on Riemannian manifolds in the thermodynamic limit
- Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes
- On the Concentration of the Maximum Degree in the Duplication-Divergence Models
- Taylor's power law for the \(N\)-stars network evolution model
- The iterated local transitivity model for hypergraphs
- scientific article; zbMATH DE number 6604107 (Why is no real title available?)
- A random growth model with any real or theoretical degree distribution
- On the limiting spectral distributions of stochastic block models
- Asymptotic analysis of bifurcations in feedforward networks
- Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon
- A note on the warmth of random graphs with given expected degrees
- Linking and cutting spanning trees
- A constructive proof of a concentration bound for real-valued random variables
- First-Order Model-Checking in Random Graphs and Complex Networks
- Some typical properties of the spatial preferred attachment model
- Entropy of some models of sparse random graphs with vertex-names
- Growing simplicial complex with face dimension selection and preferential attachment
- Applications of dual regularized Laplacian matrix for community detection
- Subsampling spectral clustering for stochastic block models in large-scale networks
- The iterated local directed transitivity model for social networks
- Iterated global models for complex networks
- The Fiedler vector of a Laplacian tensor for hypergraph partitioning
- Scale-free graph with preferential attachment and evolving internal vertex structure
- Law of large numbers for the largest component in a hyperbolic model of complex networks
- Novel scaling limits for critical inhomogeneous random graphs
- Scale free properties of random \(k\)-trees
- An edge deletion model for complex networks
- Price Variation in a Bipartite Exchange Network
- Typical distances in a geometric model for complex networks
- A random model of publication activity
- Evolution of a modified binomial random graph by agglomeration
- The number of Seymour vertices in random tournaments and digraphs
- From quasirandom graphs to graph limits and graphlets
- Typical distances in ultrasmall random networks
- Concentration of the Kirchhoff index for Erdős-Rényi graphs
- Tests for differential Gaussian Bayesian networks based on quadratic inference functions
- Tree decompositions and social graphs
- The geometric spectrum of a graph and associated curvatures
- GRAPHS, NETWORKS AND ACE
- Core size and densification in preferential attachment networks
- Bounded size biased couplings, log concave distributions and concentration of measure for occupancy models
- Community detection in networks via nonlinear modularity eigenvectors
- Heterogeneously coupled maps: hub dynamics and emergence across connectivity layers
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)
