Complex graphs and networks
From MaRDI portal
Publication:5489870
zbMATH Open1114.90071MaRDI QIDQ5489870FDOQ5489870
Authors: Linyuan Lu, Fan Chung 
Publication date: 29 September 2006
Recommendations
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)
Cited In (only showing first 100 items - show all)
- PageRank on inhomogeneous random digraphs
- A concentration inequality for the facility location problem
- On Stein's factors for Poisson approximation in Wasserstein distance with nonlinear transportation costs
- The \(N\)-star network evolution model
- On hitting times for a simple random walk on dense Erdös-Rényi random graphs
- The degree analysis of an inhomogeneous growing network with two types of vertices
- Nonuniform distribution of nodes in the spatial preferential attachment model
- Voter models on subcritical scale‐free random graphs
- Normal approximations for discrete-time occupancy processes
- Neural network spectral robustness under perturbations of the underlying graph
- Preferential attachment random graphs with edge-step functions
- A stochastic model of active cyber defense dynamics
- Community detection in complex networks via adapted Kuramoto dynamics
- The resistance perturbation distance: a metric for the analysis of dynamic networks
- Developments in the theory of randomized shortest paths with a comparison of graph node distances
- Random geometric complexes and graphs on Riemannian manifolds in the thermodynamic limit
- An algorithm for improved delay-scaling in input-queued switches
- Clustering and the hyperbolic geometry of complex networks
- Equilibrium games in networks
- Mixed preferential attachment model: homophily and minorities in social networks
- Symmetric graph properties have independent edges
- The expected adjacency and modularity matrices in the degree corrected stochastic block model
- The degree sequences of an asymmetrical growing network
- The diffusion geometry of fibre bundles: horizontal diffusion maps
- Some properties of random Apollonian networks
- KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
- Sparse randomized shortest paths routing with Tsallis divergence regularization
- Symmetric graph properties have independent edges
- A modularity based spectral method for simultaneous community and anti-community detection
- Fractality of substitution networks
- A bag-of-paths framework for network data analysis
- Degree distribution of shortest path trees and bias of network sampling algorithms
- A cutting-plane algorithm for solving a weighted influence interdiction problem
- The connected component of the partial duplication graph
- Testing goodness of fit of random graph models
- Power-law partial correlation network models
- The robot crawler graph process
- Persistence of network synchronization under nonidentical coupling functions
- Scale-free graphs of increasing degree
- Heavy-traffic analysis through uniform acceleration of queues with diminishing populations
- A hierarchical Bayesian model for predicting ecological interactions using scaled evolutionary relationships
- Large deviations for the degree structure in preferential attachment schemes
- Improved queue-size scaling for input-queued switches via graph factorization
- Detecting local network motifs
- The first-order contiguity of sparse random graphs with prescribed degrees
- Total variation based community detection using a nonlinear optimization approach
- Concentration in the generalized Chinese restaurant process
- Metastability of the contact process on fast evolving scale-free networks
- PageRank's behavior under degree correlations
- Change point detection in network models: preferential attachment and long range dependence
- eGHWT: the extended generalized Haar-Walsh transform
- A class of scale-free networks with fractal structure based on subshift of finite type
- The devil is in the details: spectrum and eigenvalue distribution of the discrete Preisach memory model
- The referenced vertex ordering problem: theory, applications, and solution methods
- Spectral properties of the trap model on sparse networks
- Modularity based community detection in hypergraphs
- Markov fundamental tensor and its applications to network analysis
- Large communities in a scale-free network
- Law of large numbers for the largest component in a hyperbolic model of complex networks
- The geometric spectrum of a graph and associated curvatures
- Bounded size biased couplings, log concave distributions and concentration of measure for occupancy models
- Large networks and graph limits
- Vertex Pursuit Games in Stochastic Network Models
- Tests for differential Gaussian Bayesian networks based on quadratic inference functions
- The iterated local transitivity model for tournaments
- Price Variation in a Bipartite Exchange Network
- Novel scaling limits for critical inhomogeneous random graphs
- From quasirandom graphs to graph limits and graphlets
- Algebraic connectivity may explain the evolution of gene regulatory networks
- Random walks on simplicial complexes and the normalized Hodge 1-Laplacian
- Low eigenvalues of Laplacian matrices of large random graphs
- Random Laplacian matrices and convex relaxations
- Time-varying network models
- Graph spectra in computer science
- The Fiedler vector of a Laplacian tensor for hypergraph partitioning
- Core size and densification in preferential attachment networks
- Large deviations for power-law thinned Lévy processes
- Networks of networks in biology. Concepts, tools and applications
- Spectral properties of unimodular lattice triangulations
- Bootstrap percolation and the geometry of complex networks
- Isospectral graph reductions and improved estimates of matrices' spectra
- Small-world graphs: characterization and alternative constructions
- Cluster tails for critical power-law inhomogeneous random graphs
- Scale-free graph with preferential attachment and evolving internal vertex structure
- Typical distances in a geometric model for complex networks
- Talagrand concentration inequalities for stochastic partial differential equations
- Community detection in networks via nonlinear modularity eigenvectors
- The spectra of multiplicative attribute graphs
- Handbook of large-scale random networks
- Spread of infection over P.A. random graphs with edge insertion
- A random model of publication activity
- A Markov chain approach to randomly grown graphs
- Typical distances in ultrasmall random networks
- Returnability in complex directed networks (digraphs)
- Growth of preferential attachment random graphs via continuous-time branching processes
- Evolution of a modified binomial random graph by agglomeration
- First passage percolation on random graphs with finite mean degrees
- Convergence of a typical martingale (a remark on the Doob theorem)
- Constructive discrepancy minimization by walking on the edges
- Scale free properties of random \(k\)-trees
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)
