Graph evolution: Densification and shrinking diameters
How do real graphs evolve over time? What are normal growth patterns in social,
technological, and information networks? Many studies have discovered patterns in static …
technological, and information networks? Many studies have discovered patterns in static …
[图书][B] The structure and dynamics of networks
From the Internet to networks of friendship, disease transmission, and even terrorism, the
concept--and the reality--of networks has come to pervade modern society. But what exactly …
concept--and the reality--of networks has come to pervade modern society. But what exactly …
Configuring random graph models with fixed degree sequences
Random graph null models have found widespread application in diverse research
communities analyzing network datasets, including social, information, and economic …
communities analyzing network datasets, including social, information, and economic …
Graphs over time: densification laws, shrinking diameters and possible explanations
How do real graphs evolve over time? What are" normal" growth patterns in social,
technological, and information networks? Many studies have discovered patterns in static …
technological, and information networks? Many studies have discovered patterns in static …
Characterization of complex networks: A survey of measurements
Each complex network (or class of networks) presents specific topological features which
characterize its connectivity and highly influence the dynamics of processes executed on the …
characterize its connectivity and highly influence the dynamics of processes executed on the …
Critical phenomena in complex networks
The combination of the compactness of networks, featuring small diameters, and their
complex architectures results in a variety of critical effects dramatically different from those in …
complex architectures results in a variety of critical effects dramatically different from those in …
Fennel: Streaming graph partitioning for massive scale graphs
Balanced graph partitioning in the streaming setting is a key problem to enable scalable and
efficient computations on massive graph data such as web graphs, knowledge graphs, and …
efficient computations on massive graph data such as web graphs, knowledge graphs, and …
Connected components in random graphs with given expected degree sequences
We consider a family of random graphs with a given expected degree sequence. Each edge
is chosen independently with probability proportional to the product of the expected degrees …
is chosen independently with probability proportional to the product of the expected degrees …
Core-periphery structure in networks
Intermediate-scale (or “meso-scale'') structures in networks have received considerable
attention, as the algorithmic detection of such structures makes it possible to discover …
attention, as the algorithmic detection of such structures makes it possible to discover …
Vertex similarity in networks
We consider methods for quantifying the similarity of vertices in networks. We propose a
measure of similarity based on the concept that two vertices are similar if their immediate …
measure of similarity based on the concept that two vertices are similar if their immediate …