Results 61 to 70 of about 1,095,825 (329)
9 pages, report CPTH-A264 ...
P.M.S. Petropoulos+2 more
openaire +3 more sources
An example of graph limits of growing sequences of random graphs
We consider a class of growing random graphs obtained by creating vertices sequentially one by one: at each step, we choose uniformly the neighbours of the newly created vertex; its degree is a random variable with a fixed but arbitrary distribution ...
Janson, Svante, Severini, Simone
core +3 more sources
Filtering Random Graph Processes Over Random Time-Varying Graphs [PDF]
Graph filters play a key role in processing the graph spectra of signals supported on the vertices of a graph. However, despite their widespread use, graph filters have been analyzed only in the deterministic setting, ignoring the impact of stochastic ...
Isufi, Elvin+3 more
core +3 more sources
A Probabilistic Counting Lemma for Complete Graphs [PDF]
We prove the existence of many complete graphs in almost all sufficiently dense partitions obtained by an application of Szemerédi's Regularity Lemma.
Stefanie Gerke+2 more
doaj +1 more source
A Comprehensive Approach to Synthetic Distribution Grid Generation: Erdős–Rényi to Barabási-Albert [PDF]
In this extended study, the focus is on advancing the generation of synthetic distribution grids (SDGs) through the introduction of a new algorithm based on the Barabási-Albert random graph model.
Mohammad Shahraeini
doaj +1 more source
Random triangles in random graphs
AbstractIn a recent paper, Oliver Riordan shows that for and p up to and slightly larger than the threshold for a Kr‐factor, the hypergraph formed by the copies of Kr in G(n, p) contains a copy of the binomial random hypergraph with . For r = 3, he gives a slightly weaker result where the density in the random hypergraph is reduced by a constant ...
openaire +3 more sources
Random Graphs and Their Subgraphs [PDF]
Random graphs are more and more used for modeling real world networks such as evolutionary networks of proteins. For this purpose we look at two different models and analyze how properties like connectedness and degree distributions are inherited by differently constructed subgraphs. We also give a formula for the variance of the degrees of fixed nodes
Klemens Taglieber, Uta Freiberg
openaire +3 more sources
Random graph products of finite groups are rational duality groups
Given an edge-independent random graph G(n,p), we determine various facts about the cohomology of graph products of groups for the graph G(n,p). In particular, the random graph product of a sequence of finite groups is a rational duality group with ...
Davis, Michael W., Kahle, Matthew
core +1 more source
The power of microRNA regulation—insights into immunity and metabolism
MicroRNAs are emerging as crucial regulators at the intersection of metabolism and immunity. This review examines how miRNAs coordinate glucose and lipid metabolism while simultaneously modulating T‐cell development and immune responses. Moreover, it highlights how cutting‐edge artificial intelligence applications can identify miRNA biomarkers ...
Stefania Oliveto+2 more
wiley +1 more source
Zero-One Law for Connectivity in Superposition of Random Key Graphs on Random Geometric Graphs
We study connectivity property in the superposition of random key graph on random geometric graph. For this class of random graphs, we establish a new version of a conjectured zero-one law for graph connectivity as the number of nodes becomes unboundedly
Y. Tang, Q. L. Li
doaj +1 more source