Results 1 to 10 of about 267,735 (315)
The Random Plots Graph Generation Model for Studying Systems with Unknown Connection Structures
Entropy, 2022 We consider the problem of modeling complex systems where little or nothing is known about the structure of the connections between the elements. In particular, when such systems are to be modeled by graphs, it is unclear what vertex degree distributions
Evgeny Ivanko, Mikhail Chernoskutov
doaj +1 more source
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
Degree distribution in random planar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We prove that for each $k \geq 0$, the probability that a root vertex in a random planar graph has degree $k$ tends to a computable constant $d_k$, and moreover that $\sum_k d_k =1$. The proof uses the tools developed by Gimènez and Noy in their solution
Michael Drmota, Omer Gimenez, Marc Noy
doaj +1 more source
Limit Theorem for Spectra of Laplace Matrix of Random Graphs
Mathematics, 2023 We consider the limit of the empirical spectral distribution of Laplace matrices of generalized random graphs. Applying the Stieltjes transform method, we prove under general conditions that the limit spectral distribution of Laplace matrices converges ...
Alexander N. Tikhomirov
doaj +1 more source
Rigorous Result for the CHKNS Random Graph Model [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 We study the phase transition in a random graph in which vertices and edges are added at constant rates. Two recent papers in Physical Review E by Callaway, Hopcroft, Kleinberg, Newman, and Strogatz, and Dorogovstev, Mendes, and Samukhin have computed ...
Rick Durrett
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
Limit distribution of the size of the giant component in a web random graph [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 Consider random graph with $N+ 1$ vertices as follows. The degrees of vertices $1,2,\ldots, N$ are the independent identically distributed random variables $\xi_1, \xi_2, \ldots , \xi_N$ with distribution $\mathbf{P}\{\xi_1 \geq k\}=k^{− \tau},$ $k= 1,2,\
Yuri Pavlov
doaj +1 more source
The Spectral Distribution of Random Mixed Graphs
Axioms, 2022 In this work, we propose a random mixed graph model Gn(p(n),q(n)) that incorporates both the classical Erdős-Rényi’s random graph model and the random oriented graph model.
Yue Guan +7 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