Relaxing the uniformity and independence assumptions using the concept of fractal dimension
From MaRDI portal
Publication:1376406
DOI10.1006/jcss.1997.1522zbMath0889.68050WikidataQ59552462 ScholiaQ59552462MaRDI QIDQ1376406
Ibrahim Kamel, Christos Faloutsos
Publication date: 17 December 1997
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1997.1522
68P15: Database theory
Related Items
Long-Range Interactions and Network Synchronization, Some Typical Properties of the Spatial Preferred Attachment Model, Less is More: Sparse Graph Mining with Compact Matrix Decomposition, Non‐negative residual matrix factorization: problem definition, fast solutions, and applications, Summarizing and understanding large graphs, Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection, Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection, Why Do Simple Algorithms for Triangle Enumeration Work in the Real World?, Rate of Convergence to the Poisson Law of the Numbers of Cycles in the Generalized Random Graphs, Distributed Core Decomposition in Probabilistic Graphs, A Linear-Time Algorithm and Analysis of Graph Relative Hausdorff Distance, True scale-free networks hidden by finite size effects, Bounds on the Spectral Radius of Digraphs from Subgraph Counts, Finding maximum subgraphs with relatively large vertex connectivity, Robustness of power-law networks: its assessment and optimization, Modeling and analysis of the effect of network eigenvalue on viral spread, Communication network designing: transmission capacity, cost and scalability, An integer programming framework for critical elements detection in graphs, Community discovery using nonnegative matrix factorization, Opinions and networks: how do they effect each other, SoMR: a scalable distributed QoS multicast routing protocol, A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks, Clustering and community detection in directed networks: a survey, General results on preferential attachment and clustering coefficient, How to improve snap-stabilizing point-to-point communication space complexity?, A sequential algorithm for generating random graphs, Scale free properties of random \(k\)-trees, Graph spectra in computer science, A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents, How to determine if a random graph with a fixed degree sequence has a giant component, Security of scale-free networks, Generation of networks with prescribed degree-dependent clustering, Modeling generation of the router-level topology of an ISP network, A branch-and-bound approach for maximum quasi-cliques, Graph spanners in the streaming model: An experimental study, A preferential attachment model with random initial degrees, Entropic grid scheduling, A packet filter placement problem with application to defense against spoofed denial of service attacks, The degree distribution of the generalized duplication model, Complex networks: from graph theory to biology, Distance in random graphs with infinite mean degrees, New method to estimate scaling exponents of power-law degree distribution and hierarchical clustering function for complex networks, A complex network approach to text summarization, Geometry of complex networks and topological centrality, When is a scale-free graph ultra-small?, On limit behavior of maximum vertex degree in a conditional configuration graph near critical points, Univariate \(L^p\) and \(l^p\) averaging, \(0<p<1\), in polynomial time by utilization of statistical structure, Computing the eccentricity distribution of large graphs, Optimizing network robustness by edge rewiring: a general framework, Triadic closure in configuration models with unbounded degree fluctuations, Message survival and decision dynamics in a class of reactive complex systems subject to external fields, Matching games with partial information, Actively learning to infer social ties, Assortativity in generalized preferential attachment models, Immunization strategies in directed networks, Effect of adaptive rewiring delay in an SIS network epidemic model, A fair-cost analysis of the random neighbor sampling method, Extinction and stationary distribution of a stochastic SIQR epidemic model with demographics and non-monotone incidence rate on scale-free networks, The many facets of the Estrada indices of graphs and networks, Mean estimation with sub-Gaussian rates in polynomial time, Greed is good for deterministic scale-free networks, Heavy-tailed configuration models at criticality, Optimal subgraph structures in scale-free configuration models, Predicting pattern formation in multilayer networks, The spread of computer viruses under the influence of removable storage devices, Adversarial topology discovery in network virtualization environments: a threat for ISPs?, Degree distribution of shortest path trees and bias of network sampling algorithms, Estimation of sums of random variables: examples and information bounds, Scalable percolation search on complex networks, Local heuristics and the emergence of spanning subgraphs in complex networks, Recovery of missing information in graph sequences by means of reference pattern matching and decision tree learning, Delay-dependent synchronization for complex dynamical networks with interval time-varying and switched coupling delays, Approximate distributed top-\(k\) queries, Examining the potential effects of species aggregation on the network structure of food webs, Detecting community structure: from parsimony to weighted parsimony, Asymptotic behavior and distributional limits of preferential attachment graphs, Misleading stars: what cannot be measured in the internet?, Epidemics of computer viruses: a complex-network approach, Using raster-based GIS and graph theory to analyze complex networks, Mathematical modeling of the malignancy of cancer using graph evolution, On certain connectivity properties of the internet topology, Mining market data: a network approach, Force-based incremental algorithm for mining community structure in dynamic network, Time-varying network models, On the mean distance in scale free graphs, Scale reduction techniques for computing maximum induced bicliques, A Random Graph Model for Power Law Graphs, Decompositions of Triangle-Dense Graphs, A new method for identifying influential nodes and important edges in complex networks, A general critical condition for the emergence of a giant component in random graphs with given degrees, Optimization in Designing Complex Communication Networks, Predicting Triadic Closure in Networks Using Communicability Distance Functions, Asymptotic Properties of a Random Graph with Duplications, On the estimation of the heavy-tail exponent in time series using the max-spectrum, Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics, Second-order phase transition in phytoplankton trait dynamics, Normalization Phenomena in Asynchronous Networks, Percolation-Based Replica Discovery in Peer-to-Peer Grid Infrastructures, A Discrete Model for a Network Having Broken Packages, Modeling and Designing Real–World Networks, Finding Cliques in Social Networks: A New Distribution-Free Model, COHERENCE ANALYSIS FOR ITERATED LINE GRAPHS OF MULTI-SUBDIVISION GRAPH, Restoration by path concatenation: fast recovery of MPLS paths, How rare are power-law networks really?, Shortest-path queries in static networks, Subgraphs in preferential attachment models, The k-Observer Problem on d-regular Graphs, Degree correlations in scale-free random graph models, Asymptotic analysis of the Ginzburg–Landau functional on point clouds, Finding a Dense-Core in Jellyfish Graphs, Local Clustering Coefficient in Generalized Preferential Attachment Models
Cites Work
