Results 21 to 30 of about 154 (96)
Queues, random graphs and branching processes
International Journal of Stochastic Analysis, Volume 1, Issue 3, Page 223-243, 1988., 1988 In this paper it is shown that certain basic results of queueing theory can be used successfully in solving various problems of random graphs and branching processes.
Lajos Takács
wiley +1 more source
The Largest Component in Critical Random Intersection Graphs
Discussiones Mathematicae Graph Theory, 2018 In this paper, through the coupling and martingale method, we prove the order of the largest component in some critical random intersection graphs is n23$n^{{2 \over 3}}$ with high probability and the width of scaling window around the critical ...
Wang Bin, Wang Longmin, Xiang Kainan
doaj +1 more source
SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS
Forum of Mathematics, Sigma, 2017 A celebrated result of Rödl and Ruciński states that for every graph $F$ , which is not a forest of stars and paths of length 3, and fixed number of colours
LUCA GUGELMANN +5 more
doaj +1 more source
Formal design of structure process in machining parts
, 2017 In article the theoretical aspects connected with selection of complete sets of technological bases for orientation semi-finished product at processing of details are considered. Simulation is based on a comprehensive consideration of the complete set of
G. Tsitsiashvili +3 more
semanticscholar +1 more source
Ramsey Properties of Random Graphs and Folkman Numbers
Discussiones Mathematicae Graph Theory, 2017 For two graphs, G and F, and an integer r ≥ 2 we write G → (F)r if every r-coloring of the edges of G results in a monochromatic copy of F. In 1995, the first two authors established a threshold edge probability for the Ramsey property G(n, p) → (F)r ...
Rödl Vojtěch +2 more
doaj +1 more source
Limit theorems for the weights and the degrees in anN-interactions random graph model
Open Mathematics, 2016 A random graph evolution based on interactions of N vertices is studied. During the evolution both the preferential attachment rule and the uniform choice of vertices are allowed. The weight of an M-clique means the number of its interactions.
Fazekas István, Porvázsnyik Bettina
doaj +1 more source
Definition of tolerance size in some coordinate direction
, 2015 Copyright c © 2015 G.Sh. Tsitsiashvili, V.E. Lelukhin, O.V. Kolesnikova and M.A. Osipova. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any ...
G. Tsitsiashvili +3 more
semanticscholar +1 more source
EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS
Forum of Mathematics, Sigma, 2015 Let $p(k)$ denote the partition function of $k$. For each $k\geqslant 2$, we describe a list of $p(k)-1$ quasirandom properties that a $k$-uniform hypergraph can have. Our work connects previous notions on linear hypergraph quasirandomness by Kohayakawa,
JOHN LENZ, DHRUV MUBAYI
doaj +1 more source
On the length of a random minimum spanning tree
, 2016 We study the expected value of the length Ln of the minimum spanning tree of the complete graph Kn when each edge e is given an independent uniform [0, 1] edge weight.
Janson, Svante, +14 more
core +1 more source
TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM
Forum of Mathematics, Sigma, 2015 For natural numbers $n,r\in \mathbb{N}$ with $n\geqslant r$, the Kneser graph $K(n,r)$ is the graph on the family of $r$-element subsets of $\{1,\ldots ,n\}$ in which two sets are adjacent if and only if they are disjoint.
JÓZSEF BALOGH +2 more
doaj +1 more source