Coupling online and offline analyses for random power law graphs
We develop a coupling technique for analyzing online models by using offline models. This
method is especially effective for a growth-deletion model that generalizes and includes the …
method is especially effective for a growth-deletion model that generalizes and includes the …
A survey of models of the web graph
A Bonato - Workshop on Combinatorial and Algorithmic Aspects of …, 2004 - Springer
LNCS 3405 - A Survey of Models of the Web Graph Page 1 A Survey of Models of the Web
Graph Anthony Bonato⋆ Department of Mathematics, Wilfrid Laurier University, Waterloo …
Graph Anthony Bonato⋆ Department of Mathematics, Wilfrid Laurier University, Waterloo …
A preferential attachment model with random initial degrees
M Deijfen, H Van Den Esker, R Van Der Hofstad… - Arkiv för matematik, 2009 - Springer
In this paper, a random graph process {G (t)} t≥ 1 is studied and its degree sequence is
analyzed. Let {W t} t≥ 1 be an iid sequence. The graph process is defined so that, at each …
analyzed. Let {W t} t≥ 1 be an iid sequence. The graph process is defined so that, at each …
[PS][PS] The bin-covering technique for thresholding random geometric graph properties
S Muthukrishnan, G Pandurangan - SODA, 2005 - dimacs.rutgers.edu
We study the emerging phenomenon of ad hoc, sensor-based communication networks. The
communication is modeled by the geometric random graph model G (n, r, ℓ) where n points …
communication is modeled by the geometric random graph model G (n, r, ℓ) where n points …
On the topology of multicast trees
RC Chalmers, KC Almeroth - IEEE/ACM Transactions on …, 2003 - ieeexplore.ieee.org
The benefit derived from using multicast is seemingly dependent upon the shape of the
distribution tree. We attempt to model interdomain multicast trees accurately. We measure a …
distribution tree. We attempt to model interdomain multicast trees accurately. We measure a …
[PDF][PDF] The diameter of random massive graphs.
L Lu - SODA, 2001 - Citeseer
Many massive graphs (such as the WWW graph and Call graphs) share certain universal
characteristics which can be described by so-called the “power law”. Here we determine the …
characteristics which can be described by so-called the “power law”. Here we determine the …
A model-based evaluation of data quality activities in KDD
We live in the Information Age, where most of the personal, business, and administrative
data are collected and managed electronically. However, poor data quality may affect the …
data are collected and managed electronically. However, poor data quality may affect the …
A geometric preferential attachment model of networks II
We study a random graph G n that combines certain aspects of geometric random graphs
and preferential attachment graphs. This model yields a graph with power law degree …
and preferential attachment graphs. This model yields a graph with power law degree …
Topology and dependency tests in spatial and network autoregressive models
Social network analysis has been identified as a promising direction for further applications
of spatial statistical and econometric models. The type of network analysis envisioned is …
of spatial statistical and econometric models. The type of network analysis envisioned is …
Computational study of the US stock market evolution: a rank correlation-based network model
O Shirokikh, G Pastukhov, V Boginski… - Computational …, 2013 - Springer
This paper presents a computational study of global characteristics of the US stock market
using a network-based model referred to as the market graph. The market graph reflects …
using a network-based model referred to as the market graph. The market graph reflects …