Results 1 to 10 of about 1,132 (55)
COVID-19: Analytics of contagion on inhomogeneous random social networks [PDF]
Infectious Disease Modelling, 2021 Motivated by the need for robust models of the Covid-19 epidemic that adequately reflect the extreme heterogeneity of humans and society, this paper presents a novel framework that treats a population of N individuals as an inhomogeneous random social ...
T.R. Hurd
doaj +2 more sources
Asymptotic Behavior of the Edge Metric Dimension of the Random Graph
Discussiones Mathematicae Graph Theory, 2021 Given a simple connected graph G(V,E), the edge metric dimension, denoted edim(G), is the least size of a set S ⊆ V that distinguishes every pair of edges of G, in the sense that the edges have pairwise different tuples of distances to the vertices of S.
Zubrilina Nina
doaj +1 more source
Covering the Edges of a Random Hypergraph by Cliques
Discussiones Mathematicae Graph Theory, 2022 We determine the order of magnitude of the minimum clique cover of the edges of a binomial, r-uniform, random hypergraph G(r)(n, p), p fixed. In doing so, we combine the ideas from the proofs of the graph case (r = 2) in Frieze and Reed [Covering the ...
Rödl Vojtěch, Ruciński Andrzej
doaj +1 more source
Finding Hamilton cycles in random intersection graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 The construction of the random intersection graph model is based on a random family of sets. Such structures, which are derived from intersections of sets, appear in a natural manner in many applications. In this article we study the problem of finding a
Katarzyna Rybarczyk
doaj +1 more source
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
Topology of random $2$-dimensional cubical complexes
Forum of Mathematics, Sigma, 2021 We study a natural model of a random $2$-dimensional cubical complex which is a subcomplex of an n-dimensional cube, and where every possible square $2$-face is included independently with probability p. Our main result exhibits a sharp threshold $p=1/2$
Matthew Kahle +2 more
doaj +1 more source
FORCING QUASIRANDOMNESS WITH TRIANGLES
Forum of Mathematics, Sigma, 2019 We study forcing pairs for quasirandom graphs. Chung, Graham, and Wilson initiated the study of families ${\mathcal{F}}$ of graphs with the property that if a large graph $G$ has approximately homomorphism density $p^{e(F)}$ for some fixed $p\in (0,1 ...
CHRISTIAN REIHER, MATHIAS SCHACHT
doaj +1 more source
Persisting randomness in randomly growing discrete structures: graphs and search trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 The successive discrete structures generated by a sequential algorithm from random input constitute a Markov chain that may exhibit long term dependence on its first few input values.
Rudolf Grübel
doaj +1 more source
Limit distribution of degrees in random family trees [PDF]
, 2010 In a one-parameter model for evolution of random trees, which also includes the Barabasi-Albert random tree, almost sure behavior and the limiting distribution of the degree of a vertex in a fixed position are examined. Results about Polya urn models are
Backhausz, Agnes
core +2 more sources
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