scientific article; zbMATH DE number 5059208

Publication date: 29 September 2006

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

random graphs large scale networks graph models complex graphs

Programming involving graphs or networks (90C35) Random graphs (graph-theoretic aspects) (05C80) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Large-scale problems in mathematical programming (90C06) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory to circuits and networks (94C15) Randomized algorithms (68W20)

Related Items

A Scalable Unsupervised Framework for Comparing Graph Embeddings, The Iterated Local Directed Transitivity Model for Social Networks, Iterated Global Models for Complex Networks, Mapping Out Emerging Network Structures in Dynamic Network Models Coupled with Epidemics, A class of scale-free networks with fractal structure based on subshift of finite type, 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, The Fiedler Vector of a Laplacian Tensor for Hypergraph Partitioning, Causal Structural Learning via Local Graphs, An evolving network model from clique extension, Heavy-Traffic Analysis Through Uniform Acceleration of Queues with Diminishing Populations, 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, Random Walks on Simplicial Complexes and the Normalized Hodge 1-Laplacian, Stochastic recursions on directed random graphs, Total Variation Based Community Detection Using a Nonlinear Optimization Approach, 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, The Geometric Spectrum of a Graph and Associated Curvatures, Spread of Infection over P.A. random graphs with edge insertion, Neural Network Spectral Robustness under Perturbations of the Underlying Graph, A Spatial Web Graph Model with Local Influence Regions, KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation, First-Order Model-Checking in Random Graphs and Complex Networks, The connected component of the partial duplication graph, ENTROPY OF SOME MODELS OF SPARSE RANDOM GRAPHS WITH VERTEX-NAMES, Some Typical Properties of the Spatial Preferred Attachment Model, Clustering and the Hyperbolic Geometry of Complex Networks, Community Detection in Networks via Nonlinear Modularity Eigenvectors, Spectral properties of the trap model on sparse networks, Scale‐free graphs of increasing degree, Epidemic spreading on evolving networks, Vertex Pursuit Games in Stochastic Network Models, FRACTALITY OF SUBSTITUTION NETWORKS, Price Variation in a Bipartite Exchange Network, Disparity of clustering coefficients in the Holme‒Kim network model, Modeling and Designing Real–World Networks, TheN-star network evolution model, Large deviations for the leaves in some random trees, 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, Asymptotic Analysis of Bifurcations in Feedforward Networks, Consensus and synchronization problems on small-world 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, Large deviations for power-law thinned Lévy processes, An algorithm for improved delay-scaling in input-queued switches, eGHWT: the extended generalized Haar-Walsh transform, Tests for differential Gaussian Bayesian networks based on quadratic inference functions, Typical Distances in Ultrasmall Random Networks, Symmetric Graph Properties Have Independent Edges, Core Size and Densification in Preferential Attachment Networks, Constructive Discrepancy Minimization by Walking on the Edges, Spectral properties of unimodular lattice triangulations, 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 number of Seymour vertices in random tournaments and digraphs, Large communities in a scale-free network, The referenced vertex ordering problem: theory, applications, and solution methods, Scale-free graph with preferential attachment and evolving internal vertex structure, The diffusion geometry of fibre bundles: horizontal diffusion maps, The robot crawler graph process, A hierarchical Bayesian model for predicting ecological interactions using scaled evolutionary relationships, A bag-of-paths framework for network data analysis, A concentration inequality for the facility location problem, Spectral distributions of adjacency and Laplacian matrices of random graphs, The First-Order Contiguity of Sparse Random Graphs with Prescribed Degrees, From quasirandom graphs to graph limits and graphlets, The resistance perturbation distance: a metric for the analysis of dynamic networks, Bootstrap percolation and the geometry of complex networks, Scale free properties of random \(k\)-trees, Normal approximations for discrete-time occupancy processes, Graph spectra in computer science, Techniques for analyzing dynamic random graph models of web-like networks: An overview, Large deviations for the degree structure in preferential attachment schemes, Local/Global Phenomena in Geometrically Generated Graphs, Detecting local network motifs, The devil is in the details: spectrum and eigenvalue distribution of the discrete Preisach memory model, A cutting-plane algorithm for solving a weighted influence interdiction problem, A random growth model with any real or theoretical degree distribution, Isospectral graph reductions and improved estimates of matrices' spectra, First passage percolation on random graphs with finite mean degrees, Markov fundamental tensor and its applications to network analysis, The sparse Laplacian shrinkage estimator for high-dimensional regression, Asset pricing in large information networks, The degree analysis of an inhomogeneous growing network with two types of vertices, Concentration of the Kirchhoff index for Erdős-Rényi graphs, Preferential attachment random graphs with edge-step functions, Infinite random geometric graphs, On hitting times for a simple random walk on dense Erdös-Rényi random graphs, Algebraic connectivity may explain the evolution of gene regulatory networks, A Markov chain approach to randomly grown graphs, Random geometric complexes and graphs on Riemannian manifolds in the thermodynamic limit, Testing goodness of fit of random graph models, The many faces of graph dynamics, Per-spectral characterizations of bicyclic networks, PageRank on inhomogeneous random digraphs, PageRank's behavior under degree correlations, Growth of preferential attachment random graphs via continuous-time branching processes, Evolution of a modified binomial random graph by agglomeration, The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs, Detecting large risk-averse 2-clubs in graphs with random edge failures, Continuum limit of critical inhomogeneous random graphs, 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, Novel scaling limits for critical inhomogeneous random graphs, High-dimensional structure estimation in Ising models: local separation criterion, A modularity based spectral method for simultaneous community and anti-community detection, Diameters in preferential attachment models, Community detection in complex networks via adapted Kuramoto dynamics, Testing permutation properties through subpermutations, Low eigenvalues of Laplacian matrices of large random graphs, An edge deletion model for complex networks, Developments in the theory of randomized shortest paths with a comparison of graph node distances, Equilibrium games in networks, Small-world graphs: characterization and alternative constructions, Power-law partial correlation network models, From Graph Theory to Models of Economic Networks. A Tutorial, Metastability of the contact process on fast evolving scale-free networks, Sparse randomized shortest paths routing with Tsallis divergence regularization, Evolution of social networks, Time-varying network models, The degree sequences of an asymmetrical growing network, The spectra of multiplicative attribute graphs, A random model of publication activity, Returnability in complex directed networks (digraphs), A probabilistic linear solver based on a multilevel Monte Carlo method, Talagrand concentration inequalities for stochastic partial differential equations, Persistence of Network Synchronization under Nonidentical Coupling Functions, Typical distances in a geometric model for complex networks, A constructive proof of a concentration bound for real-valued random variables, A remark on the spectra of random graphs with given expected degrees, Concentration in the generalized Chinese restaurant process, Heterogeneously coupled maps: hub dynamics and emergence across connectivity layers, 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), 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