Zobrazeno 1 - 10
of 303
pro vyhledávání: '"Erdős, Péter"'
The notion of $P$-stability of an infinite set of degree sequences plays influential role in approximating the permanents, rapidly sampling the realizations of graphic degree sequences, or even studying and improving network privacy. While there exis
Externí odkaz:
http://arxiv.org/abs/2405.12013
An independent vertex subset $S$ of the directed graph $G$ is a kernel if the set of out-neighbors of $S$ is $V(G)\setminus S$. An independent vertex subset $Q$ of $G$ is a quasi-kernel if the union of the first and second out-neighbors contains $V(G
Externí odkaz:
http://arxiv.org/abs/2307.04112
Autor:
Erdős, Péter L.1 (AUTHOR) erdos.peter@renyi.hun-ren.hu, Kharel, Shubha R.2 (AUTHOR) shubha.raj.kharel@gmail.com, Mezei, Tamás Róbert1 (AUTHOR), Toroczkai, Zoltán2 (AUTHOR) toro@nd.edu
Publikováno v:
Mathematics (2227-7390). Nov2024, Vol. 12 Issue 22, p3518. 14p.
Autor:
Erdős, Péter L., Mezei, Tamás Róbert
Publikováno v:
Algorithms 2023, Volume 16, Issue 7, 341
In contemporary wireless communication networks, base-stations are organized into coordinated clusters (called cells) to jointly serve the users. However, such fixed systems are plagued by the so-called cell-edge problem: near the boundaries, the int
Externí odkaz:
http://arxiv.org/abs/2212.10129
Autor:
Erdős, Péter L., Harcos, Gergely, Kharel, Shubha R., Maga, Péter, Mezei, Tamás R., Toroczkai, Zoltán
Publikováno v:
Math. Ann. 388 (2024), 2195-2215
Let us call a simple graph on $n\geq 2$ vertices a prime gap graph if its vertex degrees are $1$ and the first $n-1$ prime gaps. We show that such a graph exists for every large $n$, and in fact for every $n\geq 2$ if we assume the Riemann hypothesis
Externí odkaz:
http://arxiv.org/abs/2205.00580
Publikováno v:
Ann. Comb. (2023)
The approximate uniform sampling of graph realizations with a given degree sequence is an everyday task in several social science, computer science, engineering etc. projects. One approach is using Markov chains. The best available current result abo
Externí odkaz:
http://arxiv.org/abs/2204.09493
Publikováno v:
Mathematics 12(22) (2024), \#3518, Open Access
The recently introduced \emph{Degree Preserving Growth} model (Nature Physics, \DOI{10.1038/s41567-021-01417-7}) uses matchings to insert new vertices of prescribed degrees into the current graph of an ever-growing graph sequence. The process depends
Externí odkaz:
http://arxiv.org/abs/2204.07423
Publikováno v:
In Advances in Applied Mathematics February 2025 163 Part A
Publikováno v:
Journal of Complex Networks, Volume 11, Issue 6, December 2023
Real-world networks evolve over time via additions or removals of vertices and edges. In current network evolution models, vertex degree varies or grows arbitrarily. A recently introduced degree-preserving network growth (DPG) family of models preser
Externí odkaz:
http://arxiv.org/abs/2111.11994
We propose a simple and fast method for providing a high quality solution for the sum-interference minimization problem. As future networks are deployed in high density urban areas, improved clustering methods are needed to provide low interference n
Externí odkaz:
http://arxiv.org/abs/2111.00885