Limits on super-resolution and how to break them

S Baker, T Kanade - … IEEE Conference on Computer Vision and …, 2000 - ieeexplore.ieee.org
We analyze the super-resolution reconstruction constraints. In particular we derive a
sequence of results which all show that the constraints provide far less useful information as …

Cancer talk on twitter: community structure and information sources in breast and prostate cancer social networks

I Himelboim, JY Han - Journal of health communication, 2014 - Taylor & Francis
This study suggests taking a social networks theoretical approach to predict and explain
patterns of information exchange among Twitter prostate and breast cancer communities …

Using pagerank to characterize web structure

G Pandurangan, P Raghavan, E Upfal - International computing and …, 2002 - Springer
Recent work on modeling the Web graph has dwelt on capturing the degree distributions
observed on the Web. Pointing out that this represents a heavy reliance on “local” properties …

Eigenvalues of random power law graphs

F Chung, L Lu, V Vu - Annals of Combinatorics, 2003 - Springer
Many graphs arising in various information networks exhibit the" power law" behavior–the
number of vertices of degree k is proportional to k-β for some positive β. We show that if β> …

The Markov chain simulation method for generating connected power law random graphs.

C Gkantsidis, M Mihail, EW Zegura - Alenex, 2003 - books.google.com
Graph models for real-world complex networks such as the Internet, the WWW and
biological networks are necessary for analytic and simulation-based studies of network …

Trade-offs in probabilistic packet marking for IP traceback

M Adler - Journal of the ACM (JACM), 2005 - dl.acm.org
There has been considerable recent interest in probabilistic packet marking schemes for the
problem of tracing a sequence of network packets back to an anonymous source. An …

On the eigenvalue power law

M Mihail, C Papadimitriou - … 2002 Cambridge, MA, USA, September 13–15 …, 2002 - Springer
We show that the largest eigenvalues of graphs whose highest degrees are Zipf-like
distributed with slope a are distributed according to a power law with slope α/2. This follows …

[图书][B] A course on the web graph

A Bonato - 2008 - books.google.com
" A Course on the Web Graph provides a comprehensive introduction to state-of-the-art
research on the applications of graph theory to real-world networks such as the web graph. It …

Scalable graph exploration and visualization: Sensemaking challenges and opportunities

R Pienta, J Abello, M Kahng… - … conference on Big Data …, 2015 - ieeexplore.ieee.org
Making sense of large graph datasets is a fundamental and challenging process that
advances science, education and technology. We survey research on graph exploration and …

[图书][B] Agent-based computational economics: How the idea originated and where it is going

SH Chen - 2017 - taylorfrancis.com
This book aims to answer two questions that are fundamental to the study of agent-based
economic models: what is agent-based computational economics and why do we need …