Publication:5489870
From MaRDI portal
zbMath1114.90071MaRDI QIDQ5489870
Publication date: 29 September 2006
90C35: Programming involving graphs or networks
05C80: Random graphs (graph-theoretic aspects)
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
90C06: Large-scale problems in mathematical programming
68R10: Graph theory (including graph drawing) in computer science
90B10: Deterministic network models in operations research
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
68U35: Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.)
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
05C12: Distance in graphs
05C85: Graph algorithms (graph-theoretic aspects)
94C15: Applications of graph theory to circuits and networks
68W20: Randomized algorithms
Related Items
Mapping Out Emerging Network Structures in Dynamic Network Models Coupled with Epidemics, 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, The connected component of the partial duplication graph, Community Detection in Networks via Nonlinear Modularity Eigenvectors, Spectral properties of the trap model on sparse networks, Some Typical Properties of the Spatial Preferred Attachment Model, FRACTALITY OF SUBSTITUTION NETWORKS, 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, A Scalable Unsupervised Framework for Comparing Graph Embeddings, The Iterated Local Directed Transitivity Model for Social Networks, Iterated Global Models for Complex Networks, Heavy-Traffic Analysis Through Uniform Acceleration of Queues with Diminishing Populations, Random Walks on Simplicial Complexes and the Normalized Hodge 1-Laplacian, Total Variation Based Community Detection Using a Nonlinear Optimization Approach, Spread of Infection over P.A. random graphs with edge insertion, Scale‐free graphs of increasing degree, Epidemic spreading on evolving networks, Disparity of clustering coefficients in the Holme‒Kim network model, TheN-star network evolution model, Consensus and synchronization problems on small-world networks, A class of scale-free networks with fractal structure based on subshift of finite type, Neural Network Spectral Robustness under Perturbations of the Underlying Graph, A Spatial Web Graph Model with Local Influence Regions, ENTROPY OF SOME MODELS OF SPARSE RANDOM GRAPHS WITH VERTEX-NAMES, Vertex Pursuit Games in Stochastic Network Models, Price Variation in a Bipartite Exchange Network, Clustering and the Hyperbolic Geometry of Complex Networks, Asymptotic Analysis of Bifurcations in Feedforward Networks, Nonuniform Distribution of Nodes in the Spatial Preferential Attachment Model, A Theory of Network Security: Principles of Natural Selection and Combinatorics, Tree decompositions and social graphs, First-Order Model-Checking in Random Graphs and Complex Networks, Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon, The emergence of a giant component in one-dimensional inhomogeneous networks with long-range effects, Modularity based community detection in hypergraphs, The iterated local transitivity model for tournaments, The iterative independent model, Subsampling spectral clustering for stochastic block models in large-scale networks, Voter models on subcritical scale‐free random graphs, Causal Structural Learning via Local Graphs, An evolving network model from clique extension, On the limiting spectral distributions of stochastic block models, A family of gradient methods using Householder transformation with application to hypergraph partitioning, Asymptotic results of a multiple-entry reinforcement process, A compressed sensing based least squares approach to semi-supervised local cluster extraction, The iterated local transitivity model for hypergraphs, On several properties of a class of hybrid recursive trees, Stochastic recursions on directed random graphs, Differentiate data by higher-order structures, 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, Modeling and Designing Real–World Networks, Large deviations for the leaves in some random trees, Large deviations for power-law thinned Lévy processes, Spectral properties of unimodular lattice triangulations, The number of Seymour vertices in random tournaments and digraphs, Scale-free graph with preferential attachment and evolving internal vertex structure, From quasirandom graphs to graph limits and graphlets, Isospectral graph reductions and improved estimates of matrices' spectra, Concentration of the Kirchhoff index for Erdős-Rényi graphs, Detecting large risk-averse 2-clubs in graphs with random edge failures, Testing permutation properties through subpermutations, Spectral distributions of adjacency and Laplacian matrices of random graphs, Scale free properties of random \(k\)-trees, Graph spectra in computer science, The sparse Laplacian shrinkage estimator for high-dimensional regression, Asset pricing in large information networks, Infinite random geometric graphs, Per-spectral characterizations of bicyclic networks, The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs, Continuum limit of critical inhomogeneous random graphs, Novel scaling limits for critical inhomogeneous random graphs, High-dimensional structure estimation in Ising models: local separation criterion, Low eigenvalues of Laplacian matrices of large random graphs, An edge deletion model for complex networks, The spectra of multiplicative attribute graphs, A random model of publication activity, Heterogeneously coupled maps: hub dynamics and emergence across connectivity layers, Tests for differential Gaussian Bayesian networks based on quadratic inference functions, Bootstrap percolation and the geometry of complex networks, A Markov chain approach to randomly grown graphs, Growth of preferential attachment random graphs via continuous-time branching processes, Diameters in preferential attachment models, 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, 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, The many faces of graph dynamics, Typical distances in a geometric model for complex networks, 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, Small-world graphs: characterization and alternative constructions, From Graph Theory to Models of Economic Networks. A Tutorial
