Results 1 to 10 of about 172,035 (261)
Random matrices and random graphs* [PDF]
ESAIM: Proceedings and Surveys, 2023 We collect recent results on random matrices and random graphs. The topics covered are: fluctuations of the empirical measure of random matrices, finite-size effects of algorithms involving random matrices, characteristic polynomial of sparse matrices ...
Capitaine Mireille +4 more
doaj +3 more sources
On the use of random graphs in analysing resource utilization in urban systems [PDF]
Royal Society Open Science, 2020 Urban resource models increasingly rely on implicit network formulations. Resource consumption behaviours documented in the existing empirical studies are ultimately by-products of the network abstractions underlying these models.
Hadi Arbabi +6 more
doaj +2 more sources
Randomized graph cluster randomization
Journal of Causal Inference, 2023 Abstract The global average treatment effect (GATE) is a primary quantity of interest in the study of causal inference under network interference. With a correctly specified exposure model of the interference, the Horvitz–Thompson (HT) and Hájek estimators of the GATE are unbiased and consistent, respectively, yet known to exhibit ...
Ugander Johan, Yin Hao
openaire +3 more sources
Colouring random geometric graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A random geometric graph $G_n$ is obtained as follows. We take $X_1, X_2, \ldots, X_n ∈\mathbb{R}^d$ at random (i.i.d. according to some probability distribution ν on $\mathbb{R}^d$). For $i ≠j$ we join $X_i$ and $X_j$ by an edge if $║X_i - X_j ║< r(n)$.
Colin J. H. McDiarmid, Tobias Müller
doaj +1 more source
Physical Review E, 2002 We analyse graphs in which each vertex is assigned random coordinates in a geometric space of arbitrary dimensionality and only edges between adjacent points are present. The critical connectivity is found numerically by examining the size of the largest cluster. We derive an analytical expression for the cluster coefficient which shows that the graphs
Dall, J., Christensen, Michael
openaire +4 more sources
Improved Expansion of Random Cayley Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2004 In Random Cayley Graphs and Expanders, N. Alon and Y. Roichman proved that for every ε > 0 there is a finite c(ε) such that for any sufficiently large group G, the expected value of the second largest (in absolute value) eigenvalue of the ...
Po-Shen Loh, Leonard J. Schulman
doaj +2 more sources
Perfect matchings in inhomogeneous random bipartite graphs in random environment
Cubo, 2022 In this note we study inhomogeneous random bipartite graphs in random environment. These graphs can be thought of as an extension of the classical Erd\H os-R\'enyi random bipartite graphs in a random environment.
Jairo Bochi +2 more
doaj +1 more source
Physical Review Letters, 2002 We study the graph coloring problem over random graphs of finite average connectivity $c$. Given a number $q$ of available colors, we find that graphs with low connectivity admit almost always a proper coloring whereas graphs with high connectivity are uncolorable.
R. MULET +3 more
openaire +5 more sources
Random rectangular graphs [PDF]
Physical Review E, 2015 A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square [0,1]^2. The topological properties of the random rectangular graphs (RRGs) generated by this model are then studied as a function of the rectangle sides ...
Estrada, Ernesto, Sheerin, Matthew
openaire +4 more sources
Logconcave random graphs [PDF]
Proceedings of the fortieth annual ACM symposium on Theory of computing, 2008 We propose the following model of a random graph on $n$ vertices. Let $F$ be a distribution in $R_+^{n(n-1)/2}$ with a coordinate for every pair $ij$ with $1 \le i,j \le n$. Then $G_{F,p}$ is the distribution on graphs with $n$ vertices obtained by picking a random point $X$ from $F$ and defining a graph on $n$ vertices whose edges are pairs $ij$ for ...
Frieze, Alan +2 more
openaire +4 more sources