- Full text PDF available (6)
We propose a method to determine the community structure of a complex network. In this method the ground state problem of a ferromagnetic random field Ising model is considered on the network with the magnetic field Bs = +∞, Bt = −∞, and B i =s,t = 0 for a node pair s and t. The ground state problem is equivalent to the so-called maximum flow problem, which… (More)
References  M. A-Razzak and R. C. Glen. Applications of rule-induction in the derivation of quantitative structure-activity relationships. Efficient generation, storage, and manipulation of fully flexible pharmacophore multiplets and their use in 3-D similarity searching.  J. Aires-de Sousa and J. Gasteiger. Prediction of enantiomeric excess in a… (More)
This paper studies the question of how well a signal can be reprsented by a sparse linear combination of reference signals from an overcomplete dictionary. When the dictionary size is exponential in the dimension of signal, then the exact characterization of the optimal distortion is given as a function of the dictionary size exponent and the number of… (More)
References  R. Albert and A.L. Barabási. Statistical mechanics of complex networks.  M. Molloy and B. Reed. A critical point for random graphs with a given degree sequence.  M. Molloy and B. Reed. The size of the giant component of a random graph with a given degree sequence. graphs with arbitrary degree distributions and their applications. Phys.
Amen00  B. Amento, L. Terveen, and W. Hill. Does " authority " mean quality? predicting expert quality ratings of web documents. Amit98  E. Amitay. Using common hypertext links to identify the best phrasal description of target web documents. a multipurpose test collection for web retrieval experiments. In press.
Bianconi Growth model with a probability of attaching to an existing node p ∼ η i k i , where η i is a fitness parameter. Here we use a random fitness landscape, where η is drawn from a uniform distribution in (0, 1)  Callaway Growth model adding one node and several edges between randomly chosen existing nodes (not necessarily the newly introduced one)… (More)