skip to main content
10.1145/1276958.1277147acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
Article

Stability in the self-organized evolution of networks

Published: 07 July 2007 Publication History

Abstract

The modeling and analysis of large networks of autonomous agents is an important topic with applications in many different disciplines. One way of modeling the development of such networks is by means of an evolutionary process. The autonomous agents are randomly chosen to become active, may apply some kind of local mutation operators to the network and decide about accepting these changes via some fitness-based selection whereas the fitness models the agent's preferences. This general framework for the self-organized evolution of networks can be instantiated in many different ways. For interesting instances, one would like to know whether stable topologies eventually evolve and how long this process may take. Here, known results for one instantiation are improved. Moreover, a more natural and local instantiation is presented and analyzed with respect to the expected time needed to reach a stable state.

References

[1]
G. Agnarsson, N. Deo, and P. Micikevicis. On the expected number of level-i-nodes in a random labeled tree. Bulletin of the ICA, 41:51--60, 2004.
[2]
E. Anshelevich, A. Dasgupta, E. Tardos, and T. Wexler. Near-optimal network design with selfish agents. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC '03), pages 511--520, 2003.
[3]
V. Bala and S. Goyal. A noncooperative model of network formation. Econometrica, 68:1181--1230, 2000.
[4]
N. Deo and P. Micikevicis. A new encoding for labeled trees employing a stack and a queue. Bulletin of the ICA, 34:77--85, 2002.
[5]
D. Dubashi and D. Ranjan. Balls and bins: a study in negative dependence. Random Structures and Algorithms, 12(2):99--124, 1998.
[6]
R. C. Entringer, A. Meir, J. W. Moon, and L. Székely. On the wiender index of trees from certain families. Australasian Journal of Combinatorics, 10:211--224, 1994.
[7]
A. Fabrikant, A. Luthra, E. Maneva, and C. Papadimitriou. On a network creation game. In Proceedings of the 22nd Annual Symposium on Principles of Distributed Computing (PODC '03), pages 347--351, 2003.
[8]
M. Fischermann, A. Hoffmann, D. Rautenbach, L. Szekely, and L. Volkmann. Wiener index versus maximum degree in trees. Discrete Applied Mathematics, 122:127--137, 2002.
[9]
J. Garnier, L. Kallel, and M. Schoenauer. Rigorous hitting times for binary mutations. Evolutionary Computation, 7(2):173--203, 1999.
[10]
S. Janson. The wiener index of simply generated random trees. Random Structures and Algorithms, 22(4):337--358, 2003.
[11]
M. E. C. Jordan. Sur les assemblages des lignes. Journal für die Reine und Angewandte Mathematik, 70:185--190, 1869.
[12]
K. Lehmann and M. Kaufmann. Evolutionary algorithms for the self-organized evolution of networks. In Proceedings of the Conference on Genetic and Evolutionary Computation (GECCO '05), pages 563--570, 2005.
[13]
M. Mitzenmacher and E. Upfal. Probability and Computing. Cambridge University Press, 2005.
[14]
N. Nisam. Algorithms for selfish agents. In Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS '99), pages 1--15, 1999.
[15]
H. Prüfer. Neuer Beweis eines Satzes über Permutationen. Archiv für Mathematik und Physik, pages 142--144, 1918.
[16]
A. Renyi and G. Szekeres. On the height of trees. Journal of the Australian Mathematical Society, 7:497--507, 1967.
[17]
R. Rojas. Neural Networks. Springer, 1996.
[18]
D. Williams. Probability with Martingales. Cambridge Mathematical Textbooks, 1991.

Cited By

View all
  • (2010)The emergence of sparse spanners and greedy well-separated pair decompositionProceedings of the 12th Scandinavian conference on Algorithm Theory10.1007/978-3-642-13731-0_6(50-61)Online publication date: 21-Jun-2010
  • (2009)Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of linksInternational Journal of Intelligent Computing and Cybernetics10.1108/175637809109598932:2(243-284)Online publication date: 5-Jun-2009
  • (2009)Modeling and Designing Real---World NetworksAlgorithmics of Large and Complex Networks10.1007/978-3-642-02094-0_17(359-379)Online publication date: 29-Jun-2009
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation
July 2007
2313 pages
ISBN:9781595936974
DOI:10.1145/1276958
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 July 2007

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. evolutionary algorithms
  2. run time analysis
  3. self-organization
  4. stability

Qualifiers

  • Article

Conference

GECCO07
Sponsor:

Acceptance Rates

GECCO '07 Paper Acceptance Rate 266 of 577 submissions, 46%;
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 16 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2010)The emergence of sparse spanners and greedy well-separated pair decompositionProceedings of the 12th Scandinavian conference on Algorithm Theory10.1007/978-3-642-13731-0_6(50-61)Online publication date: 21-Jun-2010
  • (2009)Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of linksInternational Journal of Intelligent Computing and Cybernetics10.1108/175637809109598932:2(243-284)Online publication date: 5-Jun-2009
  • (2009)Modeling and Designing Real---World NetworksAlgorithmics of Large and Complex Networks10.1007/978-3-642-02094-0_17(359-379)Online publication date: 29-Jun-2009
  • (2008)Preliminary theoretical analysis of a local search algorithm to optimize network communication subject to preserving the total number of links2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)10.1109/CEC.2008.4630989(1484-1491)Online publication date: Jun-2008

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media