Hidden variables in bipartite networks.

Phys Rev E Stat Nonlin Soft Matter Phys

Cooperative Association for Internet Data Analysis (CAIDA), University of California, San Diego (UCSD), 9500 Gilman Drive, La Jolla, California 92093, USA.

Published: August 2011

We introduce and study random bipartite networks with hidden variables. Nodes in these networks are characterized by hidden variables that control the appearance of links between node pairs. We derive analytic expressions for the degree distribution, degree correlations, the distribution of the number of common neighbors, and the bipartite clustering coefficient in these networks. We also establish the relationship between degrees of nodes in original bipartite networks and in their unipartite projections. We further demonstrate how hidden variable formalism can be applied to analyze topological properties of networks in certain bipartite network models, and verify our analytical results in numerical simulations.

Download full-text PDF

Source
http://dx.doi.org/10.1103/PhysRevE.84.026114DOI Listing

Publication Analysis

Top Keywords

hidden variables
12
bipartite networks
12
networks
6
bipartite
5
hidden
4
variables bipartite
4
networks introduce
4
introduce study
4
study random
4
random bipartite
4

Similar Publications

Compartmental analysis of retinal vascular parameters and thickness in myopic eyes using SS-OCTA.

Front Med (Lausanne)

December 2024

Chongqing Key Laboratory of Prevention and Treatment on Major Blinding Diseases, Chongqing Eye Institute, Chongqing Branch (Municipality Division) of National Clinical Research Center for Ocular Diseases, The First Affiliated Hospital of Chongqing Medical University, Chongqing, China.

Background: This study aimed to comprehensively explore the thickness and topographic distributions of retinal vessel alterations of different myopic eyes by using swept-source OCT angiography (SS-OCTA).

Methods: One hundred myopes were included in this observational cross-sectional study. All participants underwent a series of ocular examinations of biometrical parameters, including spherical equivalent refraction (SER), axial length (AL), intraocular pressure (IOP), curvature radius (CR), and others.

View Article and Find Full Text PDF

Objective: It takes significant time and energy to collect data on explicit networks. This study used graph machine learning to identify hidden networks and predict mental health conditions in the middle-aged and old.

Methods: Data came from the Korean Longitudinal Study of Ageing (2016-2018), with 2,000 participants aged 56 or more.

View Article and Find Full Text PDF

The objectives of this study were to evaluate different machine learning algorithms for predicting body weight (BW) in Sujiang pigs using the following morphological traits: age, body length (BL), backfat thickness (BFT), chest circumference (CC), body height (BH), chest width (CW), and hip width (HW). Additionally, this study also investigated which machine learning algorithms could accurately and efficiently predict body weight in pigs using a limited set of morphological traits. For this purpose, morphological measurements of 365 mature (180 ± 5 days) Sujiang pigs from the Jiangsu Sujiang Pig Breeding Farm in Taizhou, Jiangsu Province, China were used.

View Article and Find Full Text PDF
Article Synopsis
  • A classification prediction model using Gradient Boosting Decision Tree (GBDT) is developed to analyze factors leading to escape behaviors in hit-and-run crashes, based on data from the U.S. Crash Report Sampling System (CRSS).
  • GBDT outperforms other common methods like CART, Random Forest, and Logistic Regression, achieving the best metrics (lowest negative log-likelihood, misclassification rate, and highest AUC) and showcasing better computational efficiency.
  • The GBDT model uncovers previously unmentioned factors, such as crash type and relation to the trafficway, and effectively studies interactions between variables, providing valuable insights for improving hit-and-run incident prevention and safety analysis.
View Article and Find Full Text PDF

Event-based sliding mode control for singularly perturbed systems with switching parameters.

ISA Trans

December 2024

School of Mathematics and Statistics, Guangxi Normal University, Guilin 541006, China. Electronic address:

This paper addresses the event-based sliding mode control problem for singularly perturbed systems with switching parameters. Unlike traditional Markovian switching systems, singularly perturbed S-MSSs allow more flexible state transitions, which can be described by a general distribution rather than the exponential distribution assumed in Markovian switching systems. To enhance the performance of such systems, a novel memory-based dynamic event-triggered protocol (DETP) is proposed, incorporating a memory term for the auxiliary offset variable.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!