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

Quantifying and Rejecting Outliers: The Grubbs Test01:02

Quantifying and Rejecting Outliers: The Grubbs Test

3.3K
Sometimes, a data set can have a recorded numerical observation that greatly  deviates from the rest of the data. Assuming that the data is normally distributed, a statistical method called the Grubbs test can be used to determine whether the observation is truly an outlier.  To perform a two-tailed Grubbs test, first, calculate the absolute difference between the outlier and the mean. Then, calculate the ratio between this difference and the standard deviation of the sample. This...
3.3K
Survival Tree01:19

Survival Tree

295
Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
 Building a Survival Tree
Constructing a...
295
Wilcoxon Signed-Ranks Test for Matched Pairs01:09

Wilcoxon Signed-Ranks Test for Matched Pairs

353
The Wilcoxon signed-rank test for matched pairs evaluates the null hypothesis by combining the ranks of differences with their signs. It essentially tests whether the median of the differences in a population of matched pairs is zero. Since the test incorporates more information than the sign test, it generally yields more trustable conclusions. This test also does not require the data to follow a normal distribution, but two conditions must be met for it to be applicable: (1) the data must...
353
Sign Test for Matched Pairs01:17

Sign Test for Matched Pairs

317
The sign test for matched pairs offers a robust method for comparing two paired samples, often for the effects of an intervention in one of them. This method is very useful in situations where the underlying distribution of the data is unknown. The test compares two related samples—often pre- and post-treatment measurements on the same subjects—to determine if there are significant differences in their median values.
To conduct the sign test, we first calculate the differences in...
317
Residuals and Least-Squares Property01:11

Residuals and Least-Squares Property

8.7K
The vertical distance between the actual value of y and the estimated value of y. In other words, it measures the vertical distance between the actual data point and the predicted point on the line
If the observed data point lies above the line, the residual is positive, and the line underestimates the actual data value for y. If the observed data point lies below the line, the residual is negative, and the line overestimates the actual data value for y.
The process of fitting the best-fit...
8.7K
Truncation in Survival Analysis01:09

Truncation in Survival Analysis

451
Truncation in survival analysis refers to the exclusion of individuals or events from the dataset based on specific criteria related to the time of the event. This exclusion can happen in two primary forms: left truncation and right truncation.
Left truncation occurs when individuals who experienced the event of interest before a certain time are not included in the study. This is often due to a "delayed entry" into the study where only those who survive until a certain entry point are...
451

You might also read

Related Articles

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

Sort by
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

Sampling with flows, diffusion, and autoregressive neural networks from a spin-glass perspective.

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

Dynamical phase transitions in graph cellular automata.

Physical review. E·2024
Same author

Gaussian universality of perceptrons with random labels.

Physical review. E·2024
Same journal

Erratum: Low-dimensional model for adaptive networks of spiking neurons [Phys. Rev. E 111, 014422 (2025)].

Physical review. E·2026
Same journal

Disentangling the effects of many-body forces on depletion interactions.

Physical review. E·2026
Same journal

Charge transport and mode transition in dual-energy electron beam diodes.

Physical review. E·2026
Same journal

Optimization of multisite reactions in complex compartmentalized media.

Physical review. E·2026
Same journal

Origin of geometric cohesion in nonconvex granular materials: Interplay between interdigitation and rotational constraints enhancing frictional stability.

Physical review. E·2026
Same journal

Interaction of walkers with a standing Faraday wave.

Physical review. E·2026
See all related articles

Related Experiment Video

Updated: Dec 8, 2025

Collecting and Processing Drone-based Remotely Sensed Data for Use in Forest Recovery Monitoring
08:16

Collecting and Processing Drone-based Remotely Sensed Data for Use in Forest Recovery Monitoring

Published on: October 24, 2025

226

Recovery thresholds in the sparse planted matching problem.

Guilhem Semerjian1, Gabriele Sicuro1, Lenka Zdeborová2

  • 1Laboratoire de Physique de l'École Normale Supérieure, ENS, Université PSL, CNRS, Sorbonne Université, Université de Paris, F-75005 Paris, France.

Physical Review. E
|September 18, 2020
PubMed
Summary
This summary is machine-generated.

This study analyzes recovering hidden perfect matchings in weighted random graphs. Researchers identified a phase transition criterion for generic distributions and sparse graphs, offering a precise description of the critical regime.

More Related Videos

Author Spotlight: UAV Remote Sensing for Efficient Invasive Plant Biomass Estimation
08:47

Author Spotlight: UAV Remote Sensing for Efficient Invasive Plant Biomass Estimation

Published on: February 9, 2024

1.9K
A Simple Planting Technique for Re-establishing Trees Where Frequent Inundation Occurs
04:41

A Simple Planting Technique for Re-establishing Trees Where Frequent Inundation Occurs

Published on: January 26, 2018

6.4K

Related Experiment Videos

Last Updated: Dec 8, 2025

Collecting and Processing Drone-based Remotely Sensed Data for Use in Forest Recovery Monitoring
08:16

Collecting and Processing Drone-based Remotely Sensed Data for Use in Forest Recovery Monitoring

Published on: October 24, 2025

226
Author Spotlight: UAV Remote Sensing for Efficient Invasive Plant Biomass Estimation
08:47

Author Spotlight: UAV Remote Sensing for Efficient Invasive Plant Biomass Estimation

Published on: February 9, 2024

1.9K
A Simple Planting Technique for Re-establishing Trees Where Frequent Inundation Occurs
04:41

A Simple Planting Technique for Re-establishing Trees Where Frequent Inundation Occurs

Published on: January 26, 2018

6.4K

Area of Science:

  • Graph Theory
  • Statistical Inference
  • Random Graphs

Background:

  • Recovering hidden perfect matchings in weighted random graphs is a complex statistical inference problem.
  • Previous work identified a phase transition in fully connected graphs for specific weight distributions, distinguishing between full and partial recovery phases.

Purpose of the Study:

  • To generalize and extend the understanding of phase transitions in hidden matching recovery.
  • To derive a criterion for the phase transition location applicable to generic weight distributions and potentially sparse graphs.
  • To provide a more quantitatively precise description of the critical regime surrounding the phase transition.

Main Methods:

  • Exploiting differences in weight distributions for edges inside and outside the planted matching.
  • Utilizing a technical connection with branching random walk processes.
  • Analyzing large-size limits and critical regimes in random graph models.

Main Results:

  • A criterion for the phase transition location is established for generic weight distributions and sparse graphs.
  • The study offers a quantitatively refined description of the critical regime near the phase transition.
  • The findings extend previous results from fully connected graphs to more general settings.

Conclusions:

  • The established criterion advances the understanding of hidden matching recovery in random graphs.
  • The precise description of the critical regime aids in analyzing the limits of recovery accuracy.
  • This work provides a more robust theoretical framework for statistical inference on random graph structures.