Results 11 to 20 of about 154 (96)
Fluctuations of extreme eigenvalues of sparse Erdős-Rényi graphs. [PDF]
Probab Theory Relat Fields, 2021 We consider a class of sparse random matrices which includes the adjacency matrix of the Erdős-Rényi graph G(N,p) . We show that if Nε⩽Np⩽N1/3−ε then all nontrivial eigenvalues away from 0 have asymptotically Gaussian fluctuations. These fluctuations are
He Y, Knowles A.
europepmc +2 more sources
Percolation by cumulative merging and phase transition for the contact process on random graphs
, 2016 International audienceGiven a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters.
Ménard, Laurent, Singh, Arvind
core +5 more sources
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
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
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
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
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
The Percolation Process on a Tree Where Infinite Clusters are Frozen [PDF]
, 1999 Modify the usual percolation process on the infinite binary tree by forbidding infinite clusters to grow further. The ultimate configuration will consist of both infinite and finite clusters.
ALDOUS, DAVID J, David J. Aldous
core +1 more source
Largest nearest-neighbour link and connectivity threshold in a polytopal random sample [PDF]
, 2023 A preprint version of the article is available at arXiv:2301.02506v1 [math.PR], https://arxiv.org/abs/2301.02506.. It has not been certified by peer-review.A CC BY or equivalent licence is applied to the AAM arising from this submission, in accordance ...
Penrose, MD, Higgs, F, Yang, X
core +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