Results 1 to 10 of about 1,253 (97)
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
Quasirandom Graphs and the Pantograph Equation [PDF]
American Mathematical Monthly, 2021 Mykhaylo Tyomkyn
exaly +2 more sources
All Feedback Arc Sets of a Random Turán Tournament Have $\lfloor {n}/{k}\rfloor-{k}+1$ Disjoint k-Cliques (and This Is Tight) [PDF]
SIAM Journal on Discrete Mathematics, 2021 What must one do in order to make acyclic a given oriented graph? Here we look at the structures that must be removed (or reversed) in order to make acyclic a given oriented graph.
Safwat Nassar, R. Yuster
semanticscholar +1 more source
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
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
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
RETRACTED ARTICLE: Strong limiting behavior in binary search trees
Journal of Inequalities and Applications, 2013 AbstractIn a binary search tree of size n, each node has no more than two children, we denote the number of the node with k children by ξn,k. In this paper, we study the strong limit behavior of the random variables ξn,k and σn,m, where σn,m represents ...
Peishu Chen, Weicai Peng
semanticscholar +2 more sources
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
From random walk trajectories to random interlacements
Ensaios matemáticos, 2013 We review and comment recent research on random interlacements model introduced by A.-S. Sznitman in [43]. A particular emphasis is put on motivating the definition of the model via natural questions concerning geometrical/percolative properties of ...
A. Teixeira, J. Černý
semanticscholar +1 more source