Results 11 to 20 of about 1,253 (97)
On the expected total number of infections for virus spread on a finite network [PDF]
, 2012 In this paper we consider a simple virus infection spread model on a finite population of n agents connected by some neighborhood structure. Given a graph G on n vertices, we begin with some fixed number of initial infected vertices.
Antar Bandyopadhyay, F. Sajadi
semanticscholar +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
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
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
Upper tails for triangles [PDF]
, 2010 With $\xi$ the number of triangles in the usual (Erd\H{o}s-R\'enyi) random graph $G(m,p)$, $p>1/m$ and $\eta>0$, we show (for some $C_{\eta}>0$) $$\Pr(\xi> (1+\eta)\E \xi) < \exp[-C_{\eta}\min{m^2p^2\log(1/p),m^3p^3}].$$ This is tight up to the value of $
Alon +10 more
core +1 more source
Second Errata to “Processes on Unimodular Random Networks”
Electronic Journal of Probability, 2019 We correct a few more minor errors in our paper, Electron. J. Probab. 12 , Paper 54 (2007), 1454–1508. spanning forests; sofic groups. AMS MSC 2010: Primary 60C05, Secondary 60K99; 05C80. Our first set of errata, Electron. J. Probab.
D. Aldous, R. Lyons
semanticscholar +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
Lower bounds for bootstrap percolation on Galton-Watson trees [PDF]
, 2014 Bootstrap percolation is a cellular automaton modelling the spread of an `infection' on a graph. In this note, we prove a family of lower bounds on the critical probability for $r$-neighbour bootstrap percolation on Galton--Watson trees in terms of ...
Gunderson, Karen, Przykucki, Michał
core +2 more sources
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