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 Concept Videos

Cluster Sampling Method01:20

Cluster Sampling Method

11.1K
Appropriate sampling methods ensure that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest.
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
11.1K
¹H NMR: Interpreting Distorted and Overlapping Signals01:02

¹H NMR: Interpreting Distorted and Overlapping Signals

1.3K
Spin systems where the difference in chemical shifts of the coupled nuclei is greater than ten times J are called first-order spin systems. These nuclei are weakly coupled, and their chemical shifts and coupling constant can generally be estimated from the well-separated signals in the spectrum.
As Δν decreases and the signals move closer, the doublets appear increasingly distorted. The intensities of the inner lines increase at the cost of those of the outer lines as the signals are...
1.3K
Scatter Plot01:15

Scatter Plot

8.5K
The most common and easiest way to display the relationship between two variables, x and y, is a scatter plot. A scatter plot shows the direction of a relationship between the variables. A clear direction happens when there is either:
8.5K
¹³C NMR: ¹H–¹³C Decoupling01:04

¹³C NMR: ¹H–¹³C Decoupling

1.7K
The probability of having two carbon-13 atoms next to each other is negligible because of the low natural abundance of carbon-13. Consequently, peak splitting due to carbon-carbon spin-spin coupling is not observed in spectra. However, protons up to three sigma bonds away split the carbon signal according to the n+1 rule, resulting in complicated spectra.
A broadband decoupling technique is used to simplify these complex, sometimes overlapping, signals. Broadband decoupling relies on a...
1.7K
Protein Networks02:26

Protein Networks

3.7K
An organism can have thousands of different proteins, and these proteins must cooperate to ensure the health of an organism. Proteins bind to other proteins and form complexes to carry out their functions. Many proteins interact with multiple other proteins creating a complex network of protein interactions.
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
3.7K
Protein Networks02:26

Protein Networks

1.8K
1.8K

You might also read

Related Articles

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

Sort by
Same author

Streamlined optical training of large-scale modern deep learning architectures with direct feedback alignment.

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

Inference in spreading processes with neural-network priors.

Physical review. E·2026
Same author

Dynamical cavity method for hypergraphs and its application to quenches in the k-XOR-SAT problem.

Physical review. E·2025
Same author

Integer traffic assignment problem: Algorithms and insights on random graphs.

Physical review. E·2025
Same author

Errors are robustly tamed in cumulative knowledge processes.

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

Model for efficient dynamical ranking in networks.

Physical review. E·2024
Same journal

The TaMYB55-TaSnRK1α1-TabZIP9 module confers heat stress tolerance in wheat.

Proceedings of the National Academy of Sciences of the United States of America·2026
Same journal

Superstatistics approach to turbulent circulation fluctuations.

Proceedings of the National Academy of Sciences of the United States of America·2026
Same journal

A molecular timescale for evolution of cobamide biosynthesis.

Proceedings of the National Academy of Sciences of the United States of America·2026
Same journal

Pierre Chambon, a pioneer of molecular biology and gene regulation in eukaryotes.

Proceedings of the National Academy of Sciences of the United States of America·2026
Same journal

Granulosa cell glycogen fuels the avascular corpus luteum.

Proceedings of the National Academy of Sciences of the United States of America·2026
Same journal

Synthetic essentiality of TRAIL/TNFSF10 in VHL-deficient renal cell carcinoma.

Proceedings of the National Academy of Sciences of the United States of America·2026
See all related articles

Related Experiment Video

Updated: May 5, 2026

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
12:27

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Published on: February 15, 2017

6.3K

Spectral redemption in clustering sparse networks.

Florent Krzakala1, Cristopher Moore, Elchanan Mossel

  • 1Ecole Supérieure de Physique et de Chimie Industrielles, 75005 Paris, France.

Proceedings of the National Academy of Sciences of the United States of America
|November 27, 2013
PubMed
Summary
This summary is machine-generated.

We introduce a novel spectral algorithm using nonbacktracking walks for improved community detection in sparse networks. This method enhances spectral clustering by better separating eigenvalues relevant to network structure.

More Related Videos

ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis
07:11

ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis

Published on: August 19, 2021

3.3K
A Visual Guide to Sorting Electrophysiological Recordings Using 'SpikeSorter'
10:31

A Visual Guide to Sorting Electrophysiological Recordings Using 'SpikeSorter'

Published on: February 10, 2017

10.5K

Related Experiment Videos

Last Updated: May 5, 2026

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
12:27

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Published on: February 15, 2017

6.3K
ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis
07:11

ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis

Published on: August 19, 2021

3.3K
A Visual Guide to Sorting Electrophysiological Recordings Using 'SpikeSorter'
10:31

A Visual Guide to Sorting Electrophysiological Recordings Using 'SpikeSorter'

Published on: February 10, 2017

10.5K

Area of Science:

  • Network Science
  • Graph Theory
  • Data Mining

Background:

  • Spectral algorithms are standard for network community detection.
  • Traditional methods struggle with sparse networks, failing to identify communities.
  • Alternative algorithms like belief propagation show promise.

Purpose of the Study:

  • To develop a superior spectral algorithm for community detection in sparse networks.
  • To address the limitations of existing spectral clustering techniques.
  • To enhance the performance of spectral methods in analyzing graph structures.

Main Methods:

  • Developed a new class of spectral algorithms based on nonbacktracking walks on directed graph edges.
  • Analyzed the spectrum of the nonbacktracking operator.
  • Evaluated algorithm performance on the stochastic block model and real-world networks.

Main Results:

  • The nonbacktracking operator's spectrum is more robust for sparse networks.
  • Maintained strong separation between bulk and community-relevant eigenvalues.
  • Achieved optimal community detection in stochastic block models down to the theoretical limit.
  • Demonstrated advantages over traditional spectral clustering on real-world networks.

Conclusions:

  • Nonbacktracking spectral algorithms offer significant improvements for community detection in sparse networks.
  • This approach provides a more reliable method for analyzing network community structures.
  • The nonbacktracking operator is a powerful tool for spectral graph analysis.