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)- 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
- Evolution of social networks
- Algebraic connectivity may explain the evolution of gene regulatory networks
- Diameters in preferential attachment models
- The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
- First passage percolation on random graphs with finite mean degrees
- Techniques for analyzing dynamic random graph models of web-like networks: An overview
- The spectra of multiplicative attribute graphs
- Isospectral graph reductions and improved estimates of matrices' spectra
- Large deviations for the annealed Ising model on inhomogeneous random graphs: spins and degrees
- Consensus and synchronization problems on small-world networks
- Continuum limit of critical inhomogeneous random graphs
- Large networks and graph limits
- Small-world graphs: characterization and alternative constructions
- Talagrand concentration inequalities for stochastic partial differential equations
- From Graph Theory to Models of Economic Networks. A Tutorial
- Per-spectral characterizations of bicyclic networks
- A Markov chain approach to randomly grown graphs
- Testing permutation properties through subpermutations
- Random walks on simplicial complexes and the normalized Hodge 1-Laplacian
- Large deviations for power-law thinned Lévy processes
- Convergence of a typical martingale (a remark on the Doob theorem)
- Low eigenvalues of Laplacian matrices of large random graphs
- Returnability in complex directed networks (digraphs)
- High-dimensional structure estimation in Ising models: local separation criterion
- Cluster tails for critical power-law inhomogeneous random graphs
- Infinite random geometric graphs
- Handbook of large-scale random networks
- Detecting large risk-averse 2-clubs in graphs with random edge failures
- Random Laplacian matrices and convex relaxations
- Large deviations for the leaves in some random trees
- Graph annotations in modeling complex network topologies
- Graph spectra in computer science
- The iterated local transitivity model for tournaments
- Mapping Out Emerging Network Structures in Dynamic Network Models Coupled with Epidemics
- Vertex Pursuit Games in Stochastic Network Models
- Asset pricing in large information networks
- Spread of infection over P.A. random graphs with edge insertion
- Growth of preferential attachment random graphs via continuous-time branching processes
- Bootstrap percolation and the geometry of complex networks
- Constructive discrepancy minimization by walking on the edges
- Time-varying network models
- A Spatial Web Graph Model with Local Influence Regions
- Graphs and networks
- Spectral properties of unimodular lattice triangulations
- The sparse Laplacian shrinkage estimator for high-dimensional regression
- Networks of networks in biology. Concepts, tools and applications
- Spectral distributions of adjacency and Laplacian matrices of random graphs
- 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
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)
