<rdf:RDF xmlns:community="http://www.bibsonomy.org/ontologies/2008/05/community#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:admin="http://webns.net/mvcb/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:cc="http://web.resource.org/cc/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xml:base="http://www.bibsonomy.org/user/andreab/models"><owl:Ontology rdf:about=""><rdfs:comment>BibSonomy publications for /user/andreab/models</rdfs:comment><owl:imports rdf:resource="http://swrc.ontoware.org/ontology/portal"/></owl:Ontology><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/203874e666c56f22bce1b7db254420d77/andreab"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/203874e666c56f22bce1b7db254420d77/andreab"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://portal.acm.org/citation.cfm?id=1150476#"/><swrc:date>Sat Apr 05 14:58:45 CEST 2008</swrc:date><swrc:address>New York, NY, USA</swrc:address><swrc:booktitle>KDD &#039;06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining</swrc:booktitle><swrc:pages>611--617</swrc:pages><swrc:publisher><swrc:Organization swrc:name="ACM"/></swrc:publisher><swrc:title>Structure and evolution of online social networks</swrc:title><swrc:year>2006</swrc:year><swrc:keywords>yahoo structure social imported network flickr models analysis 2006 </swrc:keywords><swrc:abstract>In this paper, we consider the evolution of structure within large online social networks. We present a series of measurements of two such networks, together comprising in excess of five million people and ten million friendship links, annotated with metadata capturing the time of every event in the life of the network. Our measurements expose a surprising segmentation of these networks into three regions: singletons who do not participate in the network; isolated communities which overwhelmingly display star structure; and a giant component anchored by a well-connected core region which persists even in the absence of stars.We present a simple model of network growth which captures these aspects of component structure. The model follows our experimental results, characterizing users as either passive members of the network; inviters who encourage offline friends and acquaintances to migrate online; and linkers who fully participate in the social evolution of the network.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="Philadelphia, PA, USA" swrc:key="location"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="1-59593-339-5" swrc:key="isbn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="http://doi.acm.org/10.1145/1150402.1150476" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Ravi Kumar"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Jasmine Novak"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Andrew Tomkins"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/21e48408318dd223af54c60ad063f2dd9/andreab"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/21e48408318dd223af54c60ad063f2dd9/andreab"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Book"/><swrc:date>Tue Apr 10 15:50:31 CEST 2007</swrc:date><swrc:address>New York</swrc:address><swrc:publisher><swrc:Organization swrc:name="Wiley"/></swrc:publisher><swrc:title>Urn Models and Their Applications: An Approach to Modern Discrete Probability Theory</swrc:title><swrc:year>1977</swrc:year><swrc:keywords>d4.1 statistics models polya urns tagora </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Norman L. Johnson"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Samuel Kotz"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2483235201d73b2181ea4e305cb7092f4/andreab"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2483235201d73b2181ea4e305cb7092f4/andreab"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://stacks.iop.org/1742-5468/2006/P02004"/><swrc:date>Fri Feb 23 15:33:22 CET 2007</swrc:date><swrc:journal>Journal of Statistical Mechanics: Theory and Experiment</swrc:journal><swrc:number>02</swrc:number><swrc:pages>P02004</swrc:pages><swrc:title>Understanding scale invariance in a minimal model of complex relaxation phenomena</swrc:title><swrc:volume>2006</swrc:volume><swrc:year>2006</swrc:year><swrc:keywords>imported modeling physics models citingme scaling </swrc:keywords><swrc:abstract>We report on the computer study of a lattice system that relaxes from a metastable state. Under appropriate nonequilibrium randomness, relaxation occurs by avalanches, i. e., the model evolution is discontinuous and displays many scales in a way that closely resembles the relaxation in a large number of complex systems in nature. Such apparent scale invariance simply results in the model from summing over many exponential relaxations, each with a scale which is determined by the curvature of the domain wall at which the avalanche originates. The claim that scale invariance in a nonequilibrium setting is to be associated with criticality is therefore not supported. Some hints that may help in checking this experimentally are discussed.</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="P I Hurtado"/></rdf:_1><rdf:_2><swrc:Person swrc:name="J Marro"/></rdf:_2><rdf:_3><swrc:Person swrc:name="P L Garrido"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/21116c03c4e127f16a232e13bdb93d4e3/andreab"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/21116c03c4e127f16a232e13bdb93d4e3/andreab"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><swrc:date>Thu Dec 21 18:20:07 CET 2006</swrc:date><swrc:journal>Journal of Statistical Physics</swrc:journal><swrc:number>1</swrc:number><swrc:pages>1-48</swrc:pages><swrc:title>Scaling, Optimality, and Landscape Evolution</swrc:title><swrc:volume>104</swrc:volume><swrc:year>2001</swrc:year><swrc:keywords>review statistical modeling physics models rivernetworks </swrc:keywords><swrc:abstract>A nonlinear model is studied which describes the evolution of a landscape under the effects of erosion and regeneration by geologic uplift by mean of a simple differential equation. The equation, already in wide use among geomorphologists and in that context obtained phenomenologically, is here derived by reparametrization invariance arguments and exactly solved in dimension d=1. Results of numerical simulations in d=2 show that the model is able to reproduce the critical scaling characterizing landscapes associated with natural river basins. We show that configurations minimizing the rate of energy dissipation (optimal channel networks) are stationary solutions of the equation describing the landscape evolution. Numerical simulations show that a careful annealing of the equation in the presence of additive noise leads to configurations very close to the global minimum of the dissipated energy, characterized by mean field exponents. We further show that if one considers generalized river network configurations in which splitting of the flow (i.e., braiding) and loops are allowed, the minimization of the dissipated energy results in spanning loopless configurations, under the constraints imposed by the continuity equations. This is stated in the form of a general theorem applicable to generic networks, suggesting that other branching structures occurring in nature may possibly arise as optimal structures minimizing a cost function.</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Jayanth R. Banavar"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Francesca Colaiori"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Alessandro Flammini"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Amosd Maritan"/></rdf:_4><rdf:_5><swrc:Person swrc:name="Andreae Rinaldo"/></rdf:_5></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/251186ba16a6e366133245628b780071c/andreab"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/251186ba16a6e366133245628b780071c/andreab"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.citebase.org/abstract?id=oai:arXiv.org:cond-mat/0602611"/><swrc:date>Mon Dec 18 20:20:02 CET 2006</swrc:date><swrc:journal>Physical Review E</swrc:journal><swrc:pages>056101</swrc:pages><swrc:title>k-core (bootstrap) percolation on complex networks: Critical phenomena  and nonlocal effects</swrc:title><swrc:volume>73</swrc:volume><swrc:year>2006</swrc:year><swrc:keywords>kcore percolation theory networks models physics network simulation model imported graphs </swrc:keywords><swrc:abstract>We develop the theory of the k-core (bootstrap) percolation on uncorrelated random networks with arbitrary degree distributions. We show that the k-core percolation is an unusual, hybrid phase transition with a jump emergence of the k-core as at a first order phase transition but also with a critical singularity as at a continuous transition. We describe the properties of the k-core, explain the meaning of the order parameter for the k-core percolation, and reveal the origin of the specific critical phenomena. We demonstrate that a so-called ``corona&#039;&#039; of the k-core plays a crucial role (corona is a subset of vertices in the k-core which have exactly k neighbors in the k-core). It turns out that the k-core percolation threshold is at the same time the percolation threshold of finite corona clusters. The mean separation of vertices in corona clusters plays the role of the correlation length and diverges at the critical point. We show that a random removal of even one vertex from the k-core may result in the collapse of a vast region of the k-core around the removed vertex. The mean size of this region diverges at the critical point. We find an exact mapping of the k-core percolation to a model of cooperative relaxation. This model undergoes critical relaxation with a divergent rate at some critical moment.</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="A. V. Goltsev"/></rdf:_1><rdf:_2><swrc:Person swrc:name="S. N. Dorogovtsev"/></rdf:_2><rdf:_3><swrc:Person swrc:name="J. F. F. Mendes"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/24d8844a74d4a378c21ae7fdf939d2ed3/andreab"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/24d8844a74d4a378c21ae7fdf939d2ed3/andreab"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Misc"/><owl:sameAs rdf:resource="http://www.citebase.org/abstract?id=oai:arXiv.org:cond-mat/0609341"/><swrc:date>Mon Dec 18 20:10:08 CET 2006</swrc:date><swrc:title>The dynamical collision network in granular gases</swrc:title><swrc:year>2006</swrc:year><swrc:keywords>model kcore physics statistics simulation imported network models granular </swrc:keywords><swrc:abstract>We dynamically construct the interaction network in a granular gas, using the sequence of collisions collected in an MD event driven simulation of inelastic hard disks from time 0 till time t. The network is decomposed into its k-core structure: particles in a core of index k have collided at least k times with other particles in the same core. The difference between cores k+1 and k is the so-called k-shell, and the set of all shells is a complete and on-overlapping decomposition of the system. Because of energy dissipation, the gas cools down: its initial spatially homogeneous dynamics, characterized by the Haff law, i.e. a t^{-2} energy decay, is unstable towards a strongly inhomogeneous phase with clusters and vortices, where energy decays as t^{-1}. The clear transition between those two phases appears in the evolution of the k-shells structure in the collision network. In the homogeneous regime the k-shell structure evolves as in a growing network with fixed number of vertices and randomly added links: the shell distribution is strongly peaked around the most populated shell, which has an index k\_{max} ~ 0.9 &lt;d&gt; with &lt;d&gt; the average number of collisions experienced by a particle. During the final non-homogeneous regime a growing fraction of collisions is concentrated in small, almost closed, &#039;communities&#039; of particles: k\_{max} is no more linear in &lt;d&gt; and the distribution of shells becomes extremely large developing a power-law tail ~ k^{-3} for high shell indexes. We propose the k-shell decomposition as a quantitative characterization of Molecular Chaos violation.</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Jose Ignacio Alvarez-Hamelin"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Andrea Puglisi"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/22d4f0ca387048bfefafec9d74b3bc0a8/andreab"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/22d4f0ca387048bfefafec9d74b3bc0a8/andreab"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><swrc:date>Tue Dec 05 17:41:13 CET 2006</swrc:date><swrc:journal>Internet Mathematics </swrc:journal><swrc:number>4</swrc:number><swrc:pages> 525-534</swrc:pages><swrc:title>Editorial: The Future of Power
Law Research</swrc:title><swrc:volume>2</swrc:volume><swrc:year>2006</swrc:year><swrc:keywords>models d4.1 tagora research power paper editorial law article </swrc:keywords><swrc:abstract>Abstract. I argue that power law research must move from focusing on observation, in-
terpretation, and modeling of power law behavior to instead considering the challenging
problems of validation of models and control of systems.
</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Michael Mitzenmacher"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/236d933318b0e03fab1987ea7d9639b38/andreab"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/236d933318b0e03fab1987ea7d9639b38/andreab"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><swrc:date>Tue Dec 05 17:34:04 CET 2006</swrc:date><swrc:journal>submitted to Internet Mathematics </swrc:journal><swrc:pages> </swrc:pages><swrc:title>A Brief History of Generative Models for Power Law and Lognormal Distributions - submission version</swrc:title><swrc:year> 2004</swrc:year><swrc:keywords>paper simon submission yule d4.1 model zipf models power law review article tagora </swrc:keywords><swrc:abstract>Recently, I became interested in a current debate over whether ﬁle size
distributions are best modelled by a power law distribution or a lognormal distribution.
In trying to learn enough about these distributions to settle the question, I found a rich
and long history, spanning many ﬁelds. Indeed, several recently proposed models from
the computer science community have antecedents in work from decades ago. Here,
I brieﬂy survey some of this history, focusing on underlying generative models that
lead to these distributions. One ﬁnding is that lognormal and power law distributions
connect quite naturally, and hence, it is not surprising that lognormal distributions
have arisen as a possible alternative to power law distributions across many ﬁelds.
</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Michael Mitzenmacher"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/27cef5c65c8874e9d263a188b08993dfb/andreab"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/27cef5c65c8874e9d263a188b08993dfb/andreab"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><swrc:date>Tue Dec 05 17:30:15 CET 2006</swrc:date><swrc:journal>Internet Mathematics </swrc:journal><swrc:number>2</swrc:number><swrc:pages> 226-251</swrc:pages><swrc:title>A Brief History of Generative Models for Power Law and Lognormal Distributions</swrc:title><swrc:volume>1</swrc:volume><swrc:year> 2004</swrc:year><swrc:keywords>models d4.1 article model law paper zipf review yule tagora simon power </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Michael Mitzenmacher"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/25130f4955af49c18e6339ae833dfe006/andreab"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/25130f4955af49c18e6339ae833dfe006/andreab"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><swrc:date>Mon Dec 04 17:08:06 CET 2006</swrc:date><swrc:booktitle>ACL</swrc:booktitle><swrc:pages>271-278</swrc:pages><swrc:title>A Stochastic Process for Word Frequency Distributions.</swrc:title><swrc:year>1991</swrc:year><swrc:keywords>d4.1 mandelbrot tagora distribution words models frequency language simon imported stochastic zipf model statistics linguistics </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="DBLP, http://dblp.uni-trier.de" swrc:key="bibsource"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="R. Harald Baayen"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/211ff73ed92f9fcbd9f997ed83f7d17e9/andreab"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/211ff73ed92f9fcbd9f997ed83f7d17e9/andreab"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://arxiv.org/abs/physics/0601192"/><swrc:date>Fri Dec 01 16:29:10 CET 2006</swrc:date><swrc:title>Re-inventing Willis</swrc:title><swrc:year>2006</swrc:year><swrc:keywords>preferetial network tagora attachment physics models theory model d4.1 urn </swrc:keywords><swrc:abstract>Scientists often re-invent things which were long known. Here we review these activities as related to the mechanism of producing power law distributions, originally proposed in 1922 by Yule to explain experimental data on the sizes of biological genera, collected by Willis. We estimate that scientists are busy re-discovering America about 2/3 of time.</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="M.V. Simkin"/></rdf:_1><rdf:_2><swrc:Person swrc:name="V.P. Roychowdhury"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2992e0ffa73972fa69f6c58b89e7ab236/andreab"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2992e0ffa73972fa69f6c58b89e7ab236/andreab"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Misc"/><owl:sameAs rdf:resource="http://xxx.lanl.gov/abs/cs.CY/0605015"/><swrc:date>Thu Aug 31 15:02:04 CEST 2006</swrc:date><swrc:title>Collaborative Tagging and Semiotic Dynamics</swrc:title><swrc:year>2006</swrc:year><swrc:keywords>models d4.1 sapienza collaborative tagging tagora theory </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="C. Cattuto"/></rdf:_1><rdf:_2><swrc:Person swrc:name="V. Loreto"/></rdf:_2><rdf:_3><swrc:Person swrc:name="L. Pietronero"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description></rdf:RDF>