the Erdos-Renyi
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Steering Fractional-Order Network Dynamics via Joint Parameter and State Control
arXiv:2605.31270v1 Announce Type: new Abstract: This paper studies the control of discrete-time linear fractional-order networks, a flexible modeling framework for systems with long-range memory such as power grids, biological networks, and neuronal circuits. In contrast to the common view that fractional exponents (time-scales) are fixed parameters, we show that they can be systematically steered, together with the network coupling matrix, by appropriately designed input sequences. We first...
$q$-Exponential Random Graphs: higher-order networks from simple constraints
Announce Type: new Abstract: Exponential Random Graphs (ERGs) are among the most widely used network models, derived as principled least-bias graph ensembles that maximize Shannon entropy under constraints on the expected values of given structural properties. However, it has been recently (re)discovered that, in the absence of additional information privileging Shannon entropy, the most agnostic inferential construction should maximize the broader class of Uffink entropies. The resulting...
Chaining 2-FWL GNNs for Combinatorial Graph Alignment
arXiv:2510.03086v2 Announce Type: replace Abstract: For the combinatorial graph alignment problem (GAP) -- finding the node correspondence that maximizes the number of common edges (nce) between two unlabeled graphs -- properly initialized FAQ remains a strong classical baseline, while existing GNN approaches struggle in the purely structural setting. We introduce a chaining procedure: a sequence of Folklore-type (2-FWL) GNNs in which each network is trained with cross-entropy after decoding...
Adjacency Spectral Radius Under Laplacian Sparsification: Deterministic and Probabilistic Bounds
arXiv:2606.07459v1 Announce Type: cross Abstract: Spielman-Srivastava spectral sparsification preserves Laplacian quadratic forms to within (1 +/- epsilon), but does not directly control the adjacency spectral radius lambda_1, which governs the NIMFA epidemic threshold and arises in spectral clustering. We prove |lambda_1(A_H) - lambda_1(A_G)| <= epsilon(2 Delta - lambda_1) deterministically, with a sharp epsilon*lambda_1 bound for reweighting sparsifiers via Perron-Frobenius monotonicity....
polyDAG: Polynomial Acyclicity Constraints for Efficient Continuous Causal Discovery in Visual Semantic Graphs
Announce Type: new Abstract: Modern image-analysis pipelines often convert images into structured semantic variables, such as facial attributes, object concepts, and scene descriptors. Learning directed dependencies among these variables can produce interpretable visual semantic graphs, but continuous directed acyclic graph learning is limited by the cost of enforcing acyclicity. We present polyDAG, a polynomial acyclicity framework for efficient continuous causal discovery in visual...