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)
- Law of large numbers for the largest component in a hyperbolic model of complex networks
- 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
- Spread of Infection over P.A. random graphs with edge insertion
- 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
- Low eigenvalues of Laplacian matrices of large random graphs
- Random Laplacian matrices and convex relaxations
- Time-varying network models
- Graph spectra in computer science
- Large deviations for power-law thinned Lévy processes
- 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
- The degree sequences of an asymmetrical growing network
- 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
- The spectra of multiplicative attribute graphs
- Handbook of large-scale random networks
- A random model of publication activity
- A Markov chain approach to randomly grown graphs
- Typical distances in ultrasmall random networks
- Iterated Global Models for Complex Networks
- The Iterated Local Directed Transitivity Model for Social Networks
- The Geometric Spectrum of a Graph and Associated Curvatures
- 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)
- Scale free properties of random \(k\)-trees
- Testing permutation properties through subpermutations
- Core Size and Densification in Preferential Attachment Networks
- The number of Seymour vertices in random tournaments and digraphs
- Diameters in preferential attachment models
- Techniques for analyzing dynamic random graph models of web-like networks: An overview
- Mapping Out Emerging Network Structures in Dynamic Network Models Coupled with Epidemics
- A Spatial Web Graph Model with Local Influence Regions
- Graph annotations in modeling complex network topologies
- Heterogeneously coupled maps: hub dynamics and emergence across connectivity layers
- Large deviations for the annealed Ising model on inhomogeneous random graphs: spins and degrees
- The sparse Laplacian shrinkage estimator for high-dimensional regression
- An edge deletion model for complex networks
- From Graph Theory to Models of Economic Networks. A Tutorial
- Asset pricing in large information networks
- Tree decompositions and social graphs
- Concentration of the Kirchhoff index for Erdős-Rényi graphs
- The Fiedler Vector of a Laplacian Tensor for Hypergraph Partitioning
- Random Walks on Simplicial Complexes and the Normalized Hodge 1-Laplacian
- Infinite random geometric graphs
- GRAPHS, NETWORKS AND ACE
- High-dimensional structure estimation in Ising models: local separation criterion
- Large deviations for the leaves in some random trees
- Per-spectral characterizations of bicyclic networks
- Detecting large risk-averse 2-clubs in graphs with random edge failures
- Spectral distributions of adjacency and Laplacian matrices of random graphs
- Evolution of social networks
- Constructive Discrepancy Minimization by Walking on the Edges
- Community Detection in Networks via Nonlinear Modularity Eigenvectors
- Consensus and synchronization problems on small-world networks
- The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
- Continuum limit of critical inhomogeneous random graphs
- How network structure affects the dynamics of a network of stochastic spiking neurons
- A note on transience of generalized multi-dimensional excited random walks
- Title not available (Why is that?)
- On the limiting spectral distributions of stochastic block models
- Isospectral graphs via inner symmetries
- A family of gradient methods using Householder transformation with application to hypergraph partitioning
- A note on the warmth of random graphs with given expected degrees
- Linking and cutting spanning trees
- First-Order Model-Checking in Random Graphs and Complex Networks
- Some Typical Properties of the Spatial Preferred Attachment Model
- Modeling and Designing Real–World Networks
- A Theory of Network Security: Principles of Natural Selection and Combinatorics
- Taylor's power law for the \(N\)-stars network evolution model
- Clustering and cliques in preferential attachment random graphs with edge insertion
- Asymptotic results of a multiple-entry reinforcement process
- Title not available (Why is that?)
- A remark on the spectra of random graphs with given expected degrees
- Causal Structural Learning via Local Graphs
- Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon
- On several properties of a class of hybrid recursive trees
- The many faces of graph dynamics
- A compressed sensing based least squares approach to semi-supervised local cluster extraction
- The emergence of a giant component in one-dimensional inhomogeneous networks with long-range effects
- Speed and concentration of the covering time for structured coupon collectors
- Stochastic recursions on directed random graphs
- The iterative independent model
- A new model for preferential attachment scheme with time-varying parameters
- Asymptotic Analysis of Bifurcations in Feedforward Networks
- Local/Global Phenomena in Geometrically Generated Graphs
- Entropy of some models of sparse random graphs with vertex-names
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)
