Graph evolution: Densification and shrinking diameters

J Leskovec, J Kleinberg, C Faloutsos - ACM transactions on Knowledge …, 2007 - dl.acm.org
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 …

[图书][B] The structure and dynamics of networks

M Newman, AL Barabási, DJ Watts - 2011 - degruyter.com
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 …

Configuring random graph models with fixed degree sequences

BK Fosdick, DB Larremore, J Nishimura, J Ugander - Siam Review, 2018 - SIAM
Random graph null models have found widespread application in diverse research
communities analyzing network datasets, including social, information, and economic …

Graphs over time: densification laws, shrinking diameters and possible explanations

J Leskovec, J Kleinberg, C Faloutsos - Proceedings of the eleventh ACM …, 2005 - dl.acm.org
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 …

Characterization of complex networks: A survey of measurements

LF Costa, FA Rodrigues, G Travieso… - Advances in …, 2007 - Taylor & Francis
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 …

Critical phenomena in complex networks

SN Dorogovtsev, AV Goltsev, JFF Mendes - Reviews of Modern Physics, 2008 - APS
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 …

Fennel: Streaming graph partitioning for massive scale graphs

C Tsourakakis, C Gkantsidis, B Radunovic… - Proceedings of the 7th …, 2014 - dl.acm.org
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 …

Connected components in random graphs with given expected degree sequences

F Chung, L Lu - Annals of combinatorics, 2002 - Springer
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 …

Core-periphery structure in networks

MP Rombach, MA Porter, JH Fowler, PJ Mucha - SIAM Journal on Applied …, 2014 - SIAM
Intermediate-scale (or “meso-scale'') structures in networks have received considerable
attention, as the algorithmic detection of such structures makes it possible to discover …

Vertex similarity in networks

EA Leicht, P Holme, MEJ Newman - … Review E—Statistical, Nonlinear, and Soft …, 2006 - APS
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 …