Illes J. Farkas

Illes J. Farkas

Auto-generated profile, based on publicly available information

Illes J. Farkas

Department of Biological Physics, Eötvös University, Budapest, Pázmány Péter Sétány 1A, H-1117 Hungary

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2005 in Nature
Verified
Journal Article
Closed access
PDF file
GPGergely Palla
Gergely Palla
IDImre Derényi
Imre Derényi
IFIllés Farkas
Illés Farkas
TVTamás Vicsek
Tamás Vicsek

1 September 2000 in Nature
Verified
Journal Article
Closed access
PDF file
DHDirk Helbing
Dirk Helbing
IFIllés Farkas
Illés Farkas
TVTamás Vicsek
Tamás Vicsek

10 February 2006 in Bioinformatics
Verified
Journal Article
Closed access
BABalázs Adamcsek
Balázs Adamcsek
GPGergely Palla
Gergely Palla
IFIllés J. Farkas
Illés J. Farkas
IDImre Derényi
Imre Derényi
TVTamás Vicsek
Tamás Vicsek
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 as groups of densely interconnected nodes, also called communities or clusters. These modules often overlap with each other and form a network of their own, in which nodes (links) represent the modules (overlaps). We introduce CFinder, a fast program locating and visualizing overlapping, densely interconnected groups of nodes in undirected graphs, and allowing the user to easily navigate between the original graph and the web of these groups. We show that in gene (protein) association networks CFinder can be used to predict the function(s) of a single protein and to discover novel modules. CFinder is also very efficient for locating the cliques of large sparse graphs. Availability: CFinder (for Windows, Linux and Macintosh) and its manual can be downloaded from . Supplementary information: Supplementary data are available on Bioinformatics online. Contact: cfinder@angel.elte.hu

1 June 2001 in Environment and Planning B: Planning and Design
Verified
Journal Article
Closed access
DHDirk Helbing
Dirk Helbing
PMPéter Molnár
Péter Molnár
IFIllés J Farkas
Illés J Farkas
KBKai Bolay
Kai Bolay
Although pedestrians have individual preferences, aims, and destinations, the dynamics of pedestrian crowds is surprisingly predictable. Pedestrians can move freely only at small pedestrian densities. Otherwise their motion is affected by repulsive interactions with other pedestrians, giving rise to self-organization phenomena. Examples of the resulting patterns of motion are separate lanes of uniform walking direction in crowds of oppositely moving pedestrians or oscillations of the passing direction at bottlenecks. If pedestrians leave footprints on deformable ground (for example, in green spaces such as public parks) this additionally causes attractive interactions which are mediated by modifications of their environment. In such cases, systems of pedestrian trails will evolve over time. The corresponding computer simulations are a valuable tool for developing optimized pedestrian facilities and way systems.

7 February 2000 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
DHDirk Helbing
Dirk Helbing
IFIllés J. Farkas
Illés J. Farkas
TVTamás Vicsek
Tamás Vicsek
We investigate a simple model corresponding to particles driven in opposite directions and interacting via a repulsive potential. The particles move off-lattice on a periodic strip and are subject to random forces as well. We show that this model—which can be considered as a continuum version of some driven diffusive systems—exhibits a paradoxical, new kind of transition called here “freezing by heating.” One interesting feature of this transition is that a crystallized state with a higher total energy is obtained from a fluid state by increasing the amount of fluctuations.

20 July 2001 in Physical Review E
Verified
Journal Article
Open access
PDF file
IFIllés J. Farkas
Illés J. Farkas
IDImre Derényi
Imre Derényi
ABAlbert-László Barabási
Albert-László Barabási
TVTamás Vicsek
Tamás Vicsek
Many natural and social systems develop complex networks that are usually modeled as random graphs. The eigenvalue spectrum of these graphs provides information about their structural properties. While the semicircle law is known to describe the spectral densities of uncorrelated random graphs, much less is known about the spectra of real-world graphs, describing such complex systems as the Internet, metabolic pathways, networks of power stations, scientific collaborations, or movie actors, which are inherently correlated and usually very sparse. An important limitation in addressing the spectra of these systems is that the numerical determination of the spectra for systems with more than a few thousand nodes is prohibitively time and memory consuming. Making use of recent advances in algorithms for spectral characterization, here we develop methods to determine the eigenvalues of networks comparable in size to real systems, obtaining several surprising results on the spectra of adjacency matrices corresponding to models of real-world graphs. We find that when the number of links grows as the number of nodes, the spectral density of uncorrelated random matrices does not converge to the semicircle law. Furthermore, the spectra of real-world graphs have specific features, depending on the details of the corresponding models. In particular, scale-free graphs develop a trianglelike spectral density with a power-law tail, while small-world graphs have a complex spectral density consisting of several sharp peaks. These and further results indicate that the spectra of correlated graphs represent a practical tool for graph classification and can provide useful insight into the relevant structural properties of real networks.