Results 11 to 20 of about 43 (42)
EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS
Mathematika, Volume 66, Issue 2, Page 422-447, April 2020., 2020 Abstract We study the model Gα∪G(n,p) of randomly perturbed dense graphs, where Gα is any n‐vertex graph with minimum degree at least αn and G(n,p) is the binomial random graph. We introduce a general approach for studying the appearance of spanning subgraphs in this model using absorption.
Julia Böttcher +3 more
wiley +1 more source
Random subgraphs of certain graph powers
International Journal of Mathematics and Mathematical Sciences, Volume 32, Issue 5, Page 285-292, 2002., 2002 We determine the limiting probability that a random subgraph of the Cartesian power Kan or of Ka,an is connected.
Lane Clark
wiley +1 more source
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
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
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
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
INVARIANT MEASURES CONCENTRATED ON COUNTABLE STRUCTURES
Forum of Mathematics, Sigma, 2016 Let $L$ be a countable language. We say that a countable infinite $L$
NATHANAEL ACKERMAN +2 more
doaj +1 more source
Mixing Cutoff for Simple Random Walks on the Chung–Lu Digraph
Random Structures &Algorithms, Volume 66, Issue 1, January 2025.ABSTRACT In this article, we are interested in the mixing behavior of simple random walks on inhomogeneous directed graphs. We focus our study on Chung–Lu digraphs, which are inhomogeneous networks that generalize Erdös–Rényi digraphs, and where edges are included independently and according to given Bernoulli laws.
Alessandra Bianchi, Giacomo Passuello
wiley +1 more source
Zagreb connection indices on polyomino chains and random polyomino chains
Open MathematicsIn this manuscript, we delve into the exploration of the first and second Zagreb connection indices of both polyomino chains and random polyomino chains. Our methodology relies on the utilization of Markov chain theory. Within this framework, the article
Sigarreta Saylé, Cruz-Suárez Hugo
doaj +1 more source
Two-Point Concentration of the Independence Number of the Random Graph
Forum of Mathematics, SigmaWe show that the independence number of $ G_{n,p}$ is concentrated on two values if $ n^{-2/3+ \epsilon } < p \le 1$ . This result is roughly best possible as an argument of Sah and Sawhney shows that the independence number is not, in ...
Tom Bohman, Jakob Hofstad
doaj +1 more source