296 research outputs found
Multi-layer model for the web graph
This paper studies stochastic graph models of the WebGraph. We present a new model that describes the WebGraph as an ensemble of different regions generated by independent stochastic processes (in the spirit of a recent paper by Dill et al. [VLDB 2001]). Models such as the Copying Model [17] and Evolving Networks Model [3] are simulated and compared on several relevant measures such as degree and clique distribution
Detecting and Characterizing Small Dense Bipartite-like Subgraphs by the Bipartiteness Ratio Measure
We study the problem of finding and characterizing subgraphs with small
\textit{bipartiteness ratio}. We give a bicriteria approximation algorithm
\verb|SwpDB| such that if there exists a subset of volume at most and
bipartiteness ratio , then for any , it finds a set
of volume at most and bipartiteness ratio at most
. By combining a truncation operation, we give a local
algorithm \verb|LocDB|, which has asymptotically the same approximation
guarantee as the algorithm \verb|SwpDB| on both the volume and bipartiteness
ratio of the output set, and runs in time
, independent of the size of the
graph. Finally, we give a spectral characterization of the small dense
bipartite-like subgraphs by using the th \textit{largest} eigenvalue of the
Laplacian of the graph.Comment: 17 pages; ISAAC 201
- …