Zobrazeno 1 - 10
of 4 397 368
pro vyhledávání: '"In, S. R."'
We study the intersection of a random geometric graph with an Erd\H{o}s-R\'enyi graph. Specifically, we generate the random geometric graph $G(n, r)$ by choosing $n$ points uniformly at random from $D=[0, 1]^2$ and joining any two points whose Euclid
Externí odkaz:
http://arxiv.org/abs/2411.04349
We study the sparse multi-type Erd\H{o}s R\'enyi random graphs. Despite that the corresponding central limit results are unknown, we are able to prove the moderate deviation principles for the size of the largest connected component, the number of a
Externí odkaz:
http://arxiv.org/abs/2412.09471
Autor:
Budzinski, Thomas, Contat, Alice
The Karp--Sipser algorithm consists in removing recursively the leaves as well their unique neighbours and all isolated vertices of a given graph. The remaining graph obtained when there is no leaf left is called the Karp--Sipser core. When the under
Externí odkaz:
http://arxiv.org/abs/2412.04328
Autor:
Fibich, Gadi, Warman, Yonatan
We derive explicit expressions for the expected adoption and infection level in the Bass and SI models, respectively, on sparse Erd\H{o}s-R\'enyi networks and on $d$-regular networks. These expressions are soloutions of first-order ordinary different
Externí odkaz:
http://arxiv.org/abs/2411.12076
Autor:
Bogart, Tristram, Morales, Santiago
De Loera, O'Neill and Wilburne introduced a general model for random numerical semigroups in which each positive integer is chosen independently with some probability p to be a generator, and proved upper and lower bounds on the expected Frobenius nu
Externí odkaz:
http://arxiv.org/abs/2411.13767
We study adjacency and Laplacian matrices of Erd\H{o}s-R\'{e}nyi $r$-uniform hypergraphs on $n$ vertices with hyperedge inclusion probability $p$, in the setting where $r$ can vary with $n$ such that $r / n \to c \in [0, 1)$. Adjacency matrices of hy
Externí odkaz:
http://arxiv.org/abs/2409.03756
Autor:
Islak, Umit, Incekara, Bugra
We analyze the number of cliques of given size and the size of the largest clique in tensor product $G \times H$ of two Erd\H{o}s-R\'enyi graphs $G$ and $H$. Then an extended clustering coefficient is introduced and is studied for $G \times H$. Restr
Externí odkaz:
http://arxiv.org/abs/2408.07627
We describe the shape of the Lyubeznik table of either rings in positive characteristic or Stanley-Reisner rings in any characteristic when they satisfy Serre's condition $S_r$ or they are Cohen-Macaulay in a given codimension, condition denoted by $
Externí odkaz:
http://arxiv.org/abs/2407.20129
In this paper we consider a dynamic version of the Erd\H{o}s-R\'{e}nyi random graph, in which edges independently appear and disappear in time, with the on- and off times being exponentially distributed. The focus lies on the evolution of the princip
Externí odkaz:
http://arxiv.org/abs/2407.02686
Autor:
Yang, Joonhyuk, Chung, Hye Won
Graph matching problem aims to identify node correspondence between two or more correlated graphs. Previous studies have primarily focused on models where only edge information is provided. However, in many social networks, not only the relationships
Externí odkaz:
http://arxiv.org/abs/2407.12604