SIAMDM
2010
12 years 11 months ago
2010
Every 3-graph in which no four vertices are independent and no four vertices span precisely three edges must have edge density 4/9(1 - o(1)). This bound is tight. The proof is a r...
CPHYSICS
2007
13 years 4 months ago
2007
We investigate the financial network of the Korea Stock Exchange (KSE) using numerical simulations and scaling arguments. The frequency of degree and the edge density for a real ...
AVI
2006
13 years 6 months ago
2006
This methodological note focuses on the edge density of real world examples of networks. The edge density is a parameter of interest typically when putting up user studies in an e...
FGR
2008
IEEE
13 years 11 months ago
2008
IEEE
This paper summarizes a study carried out on data from the Face Recognition Vendor Test 2006 (FRVT 2006). The finding of greatest practical importance is the discovery of a stron...