Results 181 to 190 of about 8,313 (308)
Large Deviations of the Giant Component in Scale‐Free Inhomogeneous Random Graphs
Random Structures &Algorithms, Volume 68, Issue 4, July 2026.ABSTRACT We study large deviations of the size of the largest connected component in a general class of inhomogeneous random graphs with iid weights, parametrized so that the degree distribution is regularly varying. We derive a large‐deviation principle with logarithmic speed: the rare event that the largest component contains linearly more vertices ...
Joost Jorritsma, Bert Zwart
wiley +1 more source
Is It Easier to Count Communities Than Find Them?
Random Structures &Algorithms, Volume 68, Issue 4, July 2026.ABSTRACT Random graph models with community structure have been studied extensively in the literature. For both the problems of detecting and recovering community structure, an interesting landscape of statistical and computational phase transitions has emerged. A natural unanswered question is: Might it be possible to infer properties of the community
Cynthia Rush +3 more
wiley +1 more source
Strategic Management Journal, Volume 47, Issue 7, Page 1840-1877, July 2026.Abstract Research Summary We extend ecosystem theory to cases in which platforms are complementors to each other: inter‐platform ecosystems. Analyzing web traffic data on 241 European platforms, we identify and characterize demand‐side inter‐platform ecosystems, and propose a theory of why they emerge.
Bruno Carballa‐Smichowski +3 more
wiley +1 more source
Characterizing path graphs by forbidden induced subgraphs [PDF]
, 2009 Benjamin Lévêque +2 more
openalex +1 more source
Approximation algorithms for the Maximum Induced Planar and Outerplanar Subgraph problems
, 2008 The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some new approximation algorithms for MIPS are introduced.
Graham Farr, Kerri Morgan
core
AI Magazine, Volume 47, Issue 2, Summer 2026.Abstract The exponential growth of scientific literature—over 2.5 million papers and 3.5 million patents annually—poses critical challenges for knowledge discovery. To address these, we propose SCIMKG (Scientific Knowledge Graph), a framework for constructing scientific knowledge graphs via multi‐source heterogeneous multi‐source.
Erxi Zhu, Yuan Hu
wiley +1 more source
Extremal G-free induced subgraphs of Kneser graphs [PDF]
, 2018 Meysam Alishahi, Ali Taherkhani
openalex +1 more source
Energy Science &Engineering, Volume 14, Issue 6, Page 2941-2960, June 2026.Interpretable tree‐based models integrate microseismic, geological, and mining indicators to predict short‐term rockburst risk. SHAP analysis reveals the dominant role of energy‐related features and clarifies nonlinear factor interactions, enabling transparent and reliable early‐warning in deep coal mines.
Shuai Chen +4 more
wiley +1 more source
On Subgraphs Induced by Transversals in Vertex-Partitions of Graphs [PDF]
, 2006 Maria Axenovich
openalex +1 more source