| Author | Title | Year | Journal/Proceedings | Reftype | DOI/URL |
|---|---|---|---|---|---|
| Li, L., Alderson, D., Doyle, J. & Willinger, W. | Towards a theory of scale-free graphs: Definition, properties, and implications [BibTeX] |
2005 | Internet Mathematics | article | URL |
BibTeX:
@article{li2005towards,
author = {Li, L. and Alderson, D. and Doyle, J.C. and Willinger, W.},
title = {{Towards a theory of scale-free graphs: Definition, properties, and implications}},
journal = {Internet Mathematics},
publisher = {AK Peters},
year = {2005},
volume = {2},
number = {4},
pages = {431--523},
url = {http://scholar.google.de/scholar.bib?q=info:Xi5NYPJyMvMJ:scholar.google.com/&output=citation&hl=de&as_sdt=2000&ct=citation&cd=0}
}
|
|||||
| Newman, M. E. J. | Power laws, Pareto distributions and Zipf's law [BibTeX] |
2005 | Contemporary Physics | article | URL |
BibTeX:
@article{newman05power,
author = {Newman, M. E. J.},
title = {Power laws, Pareto distributions and Zipf's law},
journal = {Contemporary Physics},
year = {2005},
volume = {46},
pages = {323},
url = {doi:10.1080/00107510500052444}
}
|
|||||
| Wu, A. Y., Garland, M. & Han, J. | Mining scale-free networks using geodesic clustering | 2004 | KDD '04: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining | inproceedings | URL |
| Abstract: Many real-world graphs have been shown to be scale-free---vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is small. We present a new model for understanding scale-free networks based on multilevel geodesic approximation, using a new data structure called a multilevel mesh.Using this multilevel framework, we propose a new kind of graph clustering for data reduction of very large graph systems such as social, biological, or electronic networks. Finally, we apply our algorithms to real-world social networks and protein interaction graphs to show that they can reveal knowledge embedded in underlying graph structures. We also demonstrate how our data structures can be used to quickly answer approximate distance and shortest path queries on scale-free networks.
|
|||||
BibTeX:
@inproceedings{1014146,
author = {Wu, Andrew Y. and Garland, Michael and Han, Jiawei},
title = {Mining scale-free networks using geodesic clustering},
booktitle = {KDD '04: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining},
publisher = {ACM Press},
year = {2004},
pages = {719--724},
url = {http://doi.acm.org/10.1145/1014052.1014146}
}
|
|||||
| Newman, M. E. J. | The structure and function of complex networks [BibTeX] |
2003 | SIAM Review | article | URL |
BibTeX:
@article{newman03structure,
author = {Newman, M. E. J.},
title = {The structure and function of complex networks},
journal = {SIAM Review},
year = {2003},
volume = {45},
pages = {167},
url = {http://www.citebase.org/abstract?id=oai:arXiv.org:cond-mat/0303516}
}
|
|||||
| Ebel, H., Mielsch, L.-I. & Bornholdt, S. | Scale-free topology of e-mail networks [BibTeX] |
2002 | Physical Review E | article | URL |
BibTeX:
@article{ebel2002scalefree,
author = {Ebel, Holger and Mielsch, Lutz-Ingo and Bornholdt, Stefan},
title = {Scale-free topology of e-mail networks},
journal = {Physical Review E},
year = {2002},
volume = {66},
url = {http://www.citebase.org/cgi-bin/citations?id=oai:arXiv.org:cond-mat/0201476}
}
|
|||||
| Boulicaut, J.-F., Bykowski, A. & Rigotti, C. | Approximation of Frequency Queris by Means of Free-Sets [BibTeX] |
2000 | Principles of Data Mining and Knowledge Discovery | inproceedings | URL |
BibTeX:
@inproceedings{boulicaut00approximation,
author = {Boulicaut, Jean-Francois and Bykowski, Artur and Rigotti, Christophe},
title = {Approximation of Frequency Queris by Means of Free-Sets},
booktitle = {Principles of Data Mining and Knowledge Discovery},
year = {2000},
pages = {75-85},
url = {citeseer.ist.psu.edu/boulicaut00approximation.html}
}
|
|||||
| Stumme, G. | Free Distributive Completions of Partial Complete Lattices [BibTeX] |
1998 | In: Order | article | URL |
BibTeX:
@article{stumme98free,
author = {Stumme, Gerd},
title = {Free Distributive Completions of Partial Complete Lattices},
journal = {{In:} {O}rder},
year = {1998},
volume = {14},
pages = {179-189},
url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/SIGKDD_Explorations00.ps}
}
|
|||||
| Garcia, O. & Nelson, E. | On the nonexistence of free complete distributive lattices | 1985 | Order | article | URL |
| Abstract: We prove that there is no free object over a countable set in the category of complete distributive lattices with homomorphisms preserving binary meets and arbitrary joins. | |||||
BibTeX:
@article{octavio1985nonexistence,
author = {Garcia, Octavio and Nelson, Evelyn},
title = {On the nonexistence of free complete distributive lattices},
journal = {Order},
year = {1985},
volume = {1},
number = {4},
pages = {399--403},
url = {http://dx.doi.org/10.1007/BF00582745}
}
|
|||||
| Hales, A. W. | On the non-existence of free complete Boolean algebras [BibTeX] |
1964 | Fundamentae Mathematica | article | URL |
BibTeX:
@article{hales1964nonexistence,
author = {Hales, A. W.},
title = {On the non-existence of free complete Boolean algebras},
journal = {Fundamentae Mathematica},
year = {1964},
volume = {54},
pages = {45-66},
url = {http://matwbn.icm.edu.pl/tresc.php?wyd=1&tom=54}
}
|
|||||
Created by JabRef export filters on 27/04/2024 by the social publication management platform PUMA