No article text was recorded for this version.
edge independence assumption (independent edge assumption)
Version 2 of 2141 papers169 conceptsfrozen 2026-10-04
Papers in this version
- Blog: On the Power of Edge Independent Graph Models
- Blog: On the Power of Edge Independent Graph Models
- Blog: Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases
- Blog: Motif Prediction with Graph Neural Networks
- Blog: A zero-one law for the existence of triangles in random key graphs
- Blog: The Erlang weighted tree, a new branching process
- Blog: On Graph Reconstruction via Empirical Risk Minimization: Fast Learning Rates and Scalability
- Blog: Moment-Based Estimation of Stochastic Kronecker Graph Parameters
- Blog: Joint Vertex Degrees in the Inhomogeneous Random Graph Model ℊ(n,{pij })
- Blog: Effective Index Construction Algorithm for Optimal (k,η)-cores Computation
- Blog: Coalitions and coordination in Washington think tanks: board interlock among Washington D.C.-based policy research and planning organizations
- Blog: Graph Classification Using Signal-Subgraphs: Applications in Statistical Connectomics
- Blog: Two-sample Tests for Random Graphs
- Blog: Typicality Matching for Pairs of Correlated Graphs
- Blog: Markov Chain Modelling of the Probabilistic Packet Marking Algorithm
- Blog: Two-Sample Tests for Inhomogeneous Random Graphs in Lr Norm: Optimality and Asymptotics
- Blog: Edge Probability Graph Models Beyond Edge Independency: Concepts, Analyses, and Algorithms
- Blog: On connectivity in random graph models with limited dependencies
- Blog: Graph model selection by edge probability sequential inference
- Blog: Monotone Increasing Properties and Their Phase Transitions in Uniform Random Intersection Graphs
- Blog: Uncovering the Formation of Triadic Closure in Social Networks
- Blog: Logconcave Random Graphs
- Blog: Motif Prediction with Graph Neural Networks
- Blog: Efficient Graph Generation with Graph Recurrent Attention Networks
- Blog: Joint Vertex Degrees in an Inhomogeneous Random Graph Model
- Blog: Learn Beneficial Noise as Graph Augmentation
- Blog: Coin-flipping, ball-dropping, and grass-hopping for generating random graphs from matrices of edge probabilities
- Blog: Challenges of Modeling Directed Networks.
- Blog: Poisson approximation of subgraph counts in stochastic block models and a graphon model
- Blog: Stochastic blockmodels and community structure in networks
- Blog: Preventing Failures by Dataset Shift Detection in Safety-Critical Graph Applications
- Blog: The Multivariate Community Hawkes Model for Dependent Relational Events in Continuous-time Networks
- Blog: An Annotated Graph Model with Differential Degree Heterogeneity for Directed Networks
- Blog: Shortest paths and centrality in uncertain networks
- Blog: On the Role of Edge Dependency in Graph Generative Models
- Blog: Learning Sparse Gaussian Graphical Models with Overlapping Blocks
- Blog: Targeted Intervention in Random Graphs
- Blog: The Geometric Block Model
- Blog: Generative Graph Neural Networks for Link Prediction
- Blog: Network Growth From Global and Local Influential Nodes
- Blog: Effective Decoding in Graph Auto-Encoder Using Triadic Closure
- Blog: Improved Achievability and Converse Bounds for Erdős-Rényi Graph Matching
- Blog: Optimal Nonparametric Inference on Network Effects with Dependent Edges
- Blog: Hypothesis testing for populations of networks
- Blog: Learning Dependency Structures for Weak Supervision Models
- Blog: Sequential Changepoint Approach for Online Community Detection
- Blog: Compound Poisson approximation of subgraph counts in stochastic block models with multiple edges
- Blog: Effective Decoding in Graph Auto-Encoder using Triadic Closure
- Blog: Relational Models for Generating Labeled Real-world Graphs
- Blog: Finite Mixtures of ERGMs for Modeling Ensembles of Networks
- Blog: Masked Graph Autoencoder with Non-discrete Bandwidths
- Blog: Statistical Connectomics
- Blog: Graphon Cross-Validation: Assessing Models on Network Data
- Blog: A Scalable Null Model for Directed Graphs Matching All Degree Distributions: In, Out, and Reciprocal
- Blog: A Review of Dynamic Network Models with Latent Variables
- Blog: The latent structure of national scientific development
- Blog: Seeded Graph Matching: Efficient Algorithms and Theoretical Guarantees
- Blog: Logconcave Random Graphs
- Blog: Fast Truss Decomposition in Large-scale Probabilistic Graphs
- Blog: A Kernelised Stein Discrepancy for Assessing the Fit of Inhomogeneous Random Graph Models
Showing 60 of 141 papers.
History & citation
Current · Permanent link
- edge independence assumption (correlated edge uncertainty) split from this direction (67% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_edge_independence_assumption_independent_03b395b5,
title = {edge independence assumption (independent edge assumption)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/edge-independence-assumption-independent-edge-assumption/rdr_03b395b5d70448358b54436899d818f3},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-21},
}This exact version (version 2, frozen text):
@misc{lacuna_edge_independence_assumption_independent_03b395b5_v2,
title = {edge independence assumption (independent edge assumption)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/edge-independence-assumption-independent-edge-assumption/rdr_03b395b5d70448358b54436899d818f3/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-21},
}