Relaxing the uniformity and independence assumptions using the concept of fractal dimension
From MaRDI portal
Publication:1376406
DOI10.1006/JCSS.1997.1522zbMath0889.68050DBLPjournals/jcss/FaloutsosK97OpenAlexW2034385326WikidataQ59552462 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
Related Items (only showing first 100 items - show all)
Matching games with partial information ⋮ The many facets of the Estrada indices of graphs and networks ⋮ 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 ⋮ Graph spanners in the streaming model: An experimental study ⋮ Finding maximum subgraphs with relatively large vertex connectivity ⋮ Normalization Phenomena in Asynchronous Networks ⋮ A preferential attachment model with random initial degrees ⋮ Delay-dependent synchronization for complex dynamical networks with interval time-varying and switched coupling delays ⋮ Approximate distributed top-\(k\) queries ⋮ Scale reduction techniques for computing maximum induced bicliques ⋮ Entropic grid scheduling ⋮ Robustness of power-law networks: its assessment and optimization ⋮ Optimization in Designing Complex Communication Networks ⋮ A packet filter placement problem with application to defense against spoofed denial of service attacks ⋮ Modeling and analysis of the effect of network eigenvalue on viral spread ⋮ The degree distribution of the generalized duplication model ⋮ Complex networks: from graph theory to biology ⋮ True scale-free networks hidden by finite size effects ⋮ Communication network designing: transmission capacity, cost and scalability ⋮ A sequential algorithm for generating random graphs ⋮ Geometry of complex networks and topological centrality ⋮ Distance in random graphs with infinite mean degrees ⋮ Predicting Triadic Closure in Networks Using Communicability Distance Functions ⋮ Asymptotic Properties of a Random Graph with Duplications ⋮ When is a scale-free graph ultra-small? ⋮ An integer programming framework for critical elements detection in graphs ⋮ Community discovery using nonnegative matrix factorization ⋮ On limit behavior of maximum vertex degree in a conditional configuration graph near critical points ⋮ Scale free properties of random \(k\)-trees ⋮ Examining the potential effects of species aggregation on the network structure of food webs ⋮ Mean estimation with sub-Gaussian rates in polynomial time ⋮ Graph spectra in computer science ⋮ Bounds on the Spectral Radius of Digraphs from Subgraph Counts ⋮ Detecting community structure: from parsimony to weighted parsimony ⋮ Actively learning to infer social ties ⋮ A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents ⋮ Opinions and networks: how do they effect each other ⋮ SoMR: a scalable distributed QoS multicast routing protocol ⋮ Greed is good for deterministic scale-free networks ⋮ Long-Range Interactions and Network Synchronization ⋮ 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 ⋮ Heavy-tailed configuration models at criticality ⋮ A Random Graph Model for Power Law Graphs ⋮ 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 ⋮ New method to estimate scaling exponents of power-law degree distribution and hierarchical clustering function for complex networks ⋮ Second-order phase transition in phytoplankton trait dynamics ⋮ Using raster-based GIS and graph theory to analyze complex networks ⋮ A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks ⋮ Optimizing network robustness by edge rewiring: a general framework ⋮ Mathematical modeling of the malignancy of cancer using graph evolution ⋮ Optimal subgraph structures in scale-free configuration models ⋮ Assortativity in generalized preferential attachment models ⋮ How to determine if a random graph with a fixed degree sequence has a giant component ⋮ Clustering and community detection in directed networks: a survey ⋮ Percolation-Based Replica Discovery in Peer-to-Peer Grid Infrastructures ⋮ General results on preferential attachment and clustering coefficient ⋮ Triadic closure in configuration models with unbounded degree fluctuations ⋮ Security of scale-free networks ⋮ Generation of networks with prescribed degree-dependent clustering ⋮ Some Typical Properties of the Spatial Preferred Attachment Model ⋮ On certain connectivity properties of the internet topology ⋮ How to improve snap-stabilizing point-to-point communication space complexity? ⋮ Modeling generation of the router-level topology of an ISP network ⋮ Mining market data: a network approach ⋮ Message survival and decision dynamics in a class of reactive complex systems subject to external fields ⋮ Force-based incremental algorithm for mining community structure in dynamic network ⋮ Decompositions of Triangle-Dense Graphs ⋮ A Discrete Model for a Network Having Broken Packages ⋮ Immunization strategies in directed networks ⋮ Time-varying network models ⋮ Effect of adaptive rewiring delay in an SIS network epidemic model ⋮ A complex network approach to text summarization ⋮ Predicting pattern formation in multilayer networks ⋮ A branch-and-bound approach for maximum quasi-cliques ⋮ 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 ⋮ Modeling and Designing Real–World Networks ⋮ A new method for identifying influential nodes and important edges in complex networks ⋮ 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? ⋮ On the estimation of the heavy-tail exponent in time series using the max-spectrum ⋮ A fair-cost analysis of the random neighbor sampling method ⋮ A general critical condition for the emergence of a giant component in random graphs with given degrees ⋮ Extinction and stationary distribution of a stochastic SIQR epidemic model with demographics and non-monotone incidence rate on scale-free networks ⋮ Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics ⋮ Rate of Convergence to the Poisson Law of the Numbers of Cycles in the Generalized Random Graphs ⋮ The spread of computer viruses under the influence of removable storage devices ⋮ On the mean distance in scale free graphs ⋮ Distributed Core Decomposition in Probabilistic Graphs ⋮ A Linear-Time Algorithm and Analysis of Graph Relative Hausdorff Distance ⋮ Adversarial topology discovery in network virtualization environments: a threat for ISPs? ⋮ Degree distribution of shortest path trees and bias of network sampling algorithms
Cites Work
This page was built for publication: Relaxing the uniformity and independence assumptions using the concept of fractal dimension
