Fundamental statistical features and self-similar properties of tagged networks (2008)
Palla, Gergely, Farkas, Illes J., Pollner, Peter, Derenyi, Imre, Vicsek, Tamas
We investigate the fundamental statistical features of tagged (or annotated) networks having a rich variety of attributes associated with their nodes. Tags (attributes, annotations, properties,...
Centrality properties of directed module members in social networks (2008)
Pollner, Peter, Palla, Gergely, Abel, Daniel, Vicsek, Andras, Farkas, Illes J., Derenyi, Imre, ...
Several recent studies of complex networks have suggested algorithms for locating network communities, also called modules or clusters, which are mostly defined as groups of nodes with dense internal...
Gergely Palla, Imre Derényi, Illés Farkas, Tamás Vicsek
Uncovering the overlapping
BIOINFORMATICSAPPLICATIONS NOTE (2008)
Balázs Adamcsek, Gergely Palla, Illés J. Farkas, Imre Derényi, Tamás Vicsek
Data and text mining CFinder: locating cliques and overlapping modules in biological networks
Asymptotics of High Order Noise Corrections (2007)
Niels So Ndergaard, Gergely Palla, Gabor Vattay, Andre Voros
We consider an evolution operator for a discrete Langevin equation with a strongly hyperbolic classical dynamics and noise with finite moments. Using a perturbative expansion of the evolution...
Quantifying social group evolution (2007)
Palla, Gergely, Barabasi, Albert-Laszlo, Vicsek, Tamas
The rich set of interactions between individuals in the society results in complex community structure, capturing highly connected circles of friends, families, or professional cliques in a social...
Directed network modules (2007)
Palla, Gergely, Farkas, Illes J., Pollner, Peter, Derenyi, Imre, Vicsek, Tamas
A search technique locating network modules, i.e., internally densely connected groups of nodes in directed networks is introduced by extending the Clique Percolation Method originally proposed for...
Weighted network modules (2007)
Farkas, Illes J., Abel, Daniel, Palla, Gergely, Vicsek, Tamas
The inclusion of link weights into the analysis of network properties allows a deeper insight into the (often overlapping) modular structure of real-world webs. We introduce a clustering algorithm...
Spectral transitions in networks (2007)
We study the level spacing distribution p(s) in the spectrum of random networks. According to our numerical results, the shape of p(s) in the Erdos-Renyi (E-R) random graph is determined by the...
Quantifying social group evolution (2007)
Gergely Palla, Albert-lászló Barabási, Tamás Vicsek, Budapest Hungary
The rich set of interactions between individuals in the society [1,2,3,4,5,6,7] results in complex community structure, capturing highly connected circles of friends, families, or professional...
Quantitative social group dynamics on a large scale," Nature (forthcoming (2007)
Gergely Palla, Albert-lászló Barabási, Tamás Vicsek
The rich set of interactions between individuals in the society [1, 2, 3, 4, 5, 6] results in complex community structure, capturing highly connected circles of friends, families, or professional...
New Journal of Physics The open–access journal for physics Directed network modules (2007)
Gergely Palla, Illés J Farkas, Péter Pollner, Imre Derényi, Tamás Vicsek
doi:10.1088/1367-2630/9/6/186 Abstract. A search technique locating network modules, i.e. internally densely connected groups of nodes in directed networks is introduced by extending the clique...
The critical point of k-clique percolation in the Erdos-Renyi graph (2006)
Palla, Gergely, Derenyi, Imre, Vicsek, Tamas
Motivated by the success of a k-clique percolation method for the identification of overlapping communities in large real networks, here we study the k-clique percolation problem in the Erdos-Renyi...
CFinder: Locating cliques and overlapping modules in biological networks (2006)
Adamcsek, Balazs, Palla, Gergely, Farkas, Illes J., Derenyi, Imre, Vicsek, Tamas
Summary: Most cellular tasks are performed not by individual proteins, but by groups of functionally associated proteins, often referred to as modules. In a protein assocation network modules appear...
Preferential attachment of communities: the same principle, but a higher level (2006)
Pollner, Peter, Palla, Gergely, Vicsek, Tamas
The graph of communities is a network emerging above the level of individual nodes in the hierarchical organisation of a complex system. In this graph the nodes correspond to communities (highly...
The critical point of k-clique percolation in the Erdös-Rényi graph (2006)
Gergely Palla, Imre Derényi, Tamás Vicsek
Motivated by the success of a k-clique percolation method for the identification of overlapping communities in large real networks, here we study the k-clique percolation problem in the...
CFinder: locating cliques and overlapping modules in biological networks (2006)
Adamcsek, Balázs, Palla, Gergely, Farkas, Illés J., Derényi, Imre, Vicsek, Tamás
Summary: Most cellular tasks are performed not by individual proteins, but by groups of functionally associated proteins, often referred to as modules. In a protein assocation network modules appear...
Uncovering the overlapping community structure of complex networks in nature and society (2005)
Palla, Gergely, Derenyi, Imre, Farkas, Illes, Vicsek, Tamas
Many complex systems in nature and society can be described in terms of networks capturing the intricate web of connections among the units they are made of. A key question is how to interpret the...
Clique percolation in random networks (2005)
Derenyi, Imre, Palla, Gergely, Vicsek, Tamas
The notion of k-clique percolation in random graphs is introduced, where k is the size of the complete subgraphs whose large scale organizations are analytically and numerically investigated. For the...
Reverse engineering of linking preferences from network restructuring (2004)
Palla, Gergely, Farkas, Illes, Derenyi, Imre, Barabasi, Albert-Laszlo, Vicsek, Tamas
We provide a method to deduce the preferences governing the restructuring dynamics of a network from the observed rewiring of the edges. Our approach is applicable for systems in which the...
Equilibrium statistical mechanics of network structures (2004)
Illés Farkas, Imre Derényi, Gergely Palla, Tamás Vicsek
Abstract. In this article we give an in depth overview of the recent advances in the field of equilibrium networks. After outlining this topic, we provide a novel way of defining equilibrium graph...
Statistical mechanics of topological phase transitions in networks (2003)
Palla, Gergely, Derenyi, Imre, Farkas, Illes, Vicsek, Tamas
We provide a phenomenological theory for topological transitions in restructuring networks. In this statistical mechanical approach energy is assigned to the different network topologies and...
Topological phase transitions of random networks (2003)
Derenyi, Imre, Farkas, Illes, Palla, Gergely, Vicsek, Tamas
To provide a phenomenological theory for the various interesting transitions in restructuring networks we employ a statistical mechanical approach with detailed balance satisfied for the transitions...
Noise corrections to stochastic trace formulas (2001)
Palla, Gergely, Vattay, Gabor, Voros, Andre, Sondergaard, Niels, Dettmann, Carl Philip
We review studies of an evolution operator L for a discrete Langevin equation with a strongly hyperbolic classical dynamics and a Gaussian noise. The leading eigenvalue of L yields a physically...
Gergely Palla, Gábor Vattay, József Cserti
Semiclassical methods are accurate in general in leading order of ħ, since they approximate quantum mechanics via canonical invariants. Often canonically noninvariant terms appear in the...
Gergely Palla, Gábor Vattay, József Cserti
Semiclassical methods are accurate in general in leading order of ħ, since they approximate quantum mechanics via canonical invariants. Often canonically noninvariant terms appear in the...
Trace formula for noise corrections to trace formulas (2000)
Palla, Gergely, Vattay, Gabor, Voros, Andre
We consider an evolution operator for a discrete Langevin equation with a strongly hyperbolic classical dynamics and Gaussian noise. Using an integral representation of the evolution operator we...
Asymptotics of high order noise corrections (1999)
Sondergaard, Niels, Vattay, Gabor, Palla, Gergely, Voros, Andre
We consider an evolution operator for a discrete Langevin equation with a strongly hyperbolic classical dynamics and noise with finite moments. Using a perturbative expansion of the evolution...
Spectrum of stochastic evolution operators: Local matrix representation approach (1999)
Cvitanovic, Predrag, Sondergaard, Niels, Palla, Gergely, Vattay, Gabor, Dettmann, C. P.
A matrix representation of the evolution operator associated with a nonlinear stochastic flow with additive noise is used to compute its spectrum. In the weak noise limit a perturbative expansion for...
Stochastic trace formulas (1999)
Dettmann, C. P., Palla, Gergely, Søndergaard, Niels, Vattay, Gábor
The spectrum of the evolution Operator associated with a nonlinear stochastic flow with additive noise is evaluated by diagonalization in a polynomial basis. The method works for arbitrary noise...