Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Evolutionary reconstruction of networks.

Mads Ipsen1, Alexander S Mikhailov

  • 1Fritz-Haber-Institut der Max-Planck-Gesellschaft, Faradayweg 4-6, D-14195 Berlin, Germany. mpi@osc.kiku.dk

Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics
|November 22, 2002
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Quantification and demonstration of the collective constriction-by-ratchet mechanism in the dynamin molecular motor.

Proceedings of the National Academy of Sciences of the United States of America·2021
Same author

Mechanochemical enzymes and protein machines as hydrodynamic force dipoles: the active dimer model.

Soft matter·2020
Same author

Polymer-like Model to Study the Dynamics of Dynamin Filaments on Deformable Membrane Tubes.

Biophysical journal·2019
Same author

Simple mechanics of protein machines.

Journal of the Royal Society, Interface·2019
Same author

Stochastic thermodynamics of a chemical nanomachine: The channeling enzyme tryptophan synthase.

The Journal of chemical physics·2017
Same author

Self-Organized Stationary Patterns in Networks of Bistable Chemical Reactions.

Angewandte Chemie (International ed. in English)·2016

This study introduces a Metropolis algorithm to reconstruct network graphs from signal data. The method accurately rebuilds small networks and approximates larger ones using spectral properties.

Area of Science:

  • Network science
  • Graph theory
  • Dynamical systems

Background:

  • Understanding complex network structures is crucial for analyzing dynamical systems.
  • Reconstructing network topology from observed signals remains a significant challenge.

Purpose of the Study:

  • To develop and validate a computational method for reconstructing network graphs from their Laplacian spectra.
  • To assess the efficacy of the proposed algorithm across various network types.

Main Methods:

  • A Metropolis algorithm employing mutations and selection was developed for graph reconstruction.
  • The algorithm evolves test networks towards a reference graph based on spectral properties.
  • The method was applied to random, clustered, and small-world network models.

Related Experiment Videos

Main Results:

  • The proposed stochastic evolution algorithm successfully reconstructed small networks exactly.
  • Good approximations of larger network structures were achieved.
  • The method demonstrated versatility across different graph topologies.

Conclusions:

  • The Metropolis algorithm provides an effective approach for inferring network topology from spectral data.
  • This method holds potential for analyzing complex dynamical systems where network structure is unknown.