Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Random graph theory of gelation (view), Exponential family random graph models (view), Maximum-entropy random graph model (view), Pseudorandom graph (view), The Strange Logic of Random Graphs (view)

searching for Random graph 47 found (208 total)

alternate case: random graph

Graphon (5,460 words) [view diff] exact match in snippet view article find links to article

objects of exchangeable random graph models. Graphons are tied to dense graphs by the following pair of observations: the random graph models defined by graphons

Rapidly exploring random tree (2,673 words) [view diff] exact match in snippet view article find links to article

methods do themselves converge to an optimum, though. Rapidly exploring random graph (RRG) and RRT*, a variant of RRT that converges towards an optimal solution

Social network analysis software (1,324 words) [view diff] exact match in snippet view article find links to article

exponential random graph models exponential random graph models; Bergm provides tools for Bayesian analysis for exponential random graph models; hergm

Null model (386 words) [view diff] exact match in snippet view article find links to article

model, which in this case is the configuration model (the maximally random graph subject to a constraint on the degree of each vertex). Null hypothesis

Graphlets (1,675 words) [view diff] exact match in snippet view article find links to article

defined as over- or under-represented graphlets with respect to some random graph null model. RGF-distance compares the frequencies of the appearance of

Krista Gile (277 words) [view diff] exact match in snippet view article find links to article

known for her research on respondent-driven sampling, on exponential random graph models, and more generally on the statistical behavior of social networks

Saturated model (1,095 words) [view diff] exact match in snippet view article find links to article

endpoints is a ηα set if and only if it is ℵα-saturated. The countable random graph, with the only non-logical symbol being the edge existence relation,

JUNG (264 words) [view diff] exact match in snippet view article find links to article

routines for clustering, decomposition[clarify], optimization[clarify], random graph generation, statistical analysis, and calculation of network distances

Complex network zeta function (2,075 words) [view diff] no match in snippet view article find links to article

Different definitions have been given for the dimension of a complex network or graph. For example, metric dimension is defined in terms of the resolving

Universal graph (865 words) [view diff] exact match in snippet view article find links to article

first constructed by Richard Rado and is now called the Rado graph or random graph. More recent work has focused on universal graphs for a graph family

Sonja Petrović (statistician) (465 words) [view diff] exact match in snippet view article

algebraic statistics, applied and computational algebraic geometry and random graph (network) models. She was elected to the International Statistics Institute

Gradient network (1,512 words) [view diff] exact match in snippet view article find links to article

When the substrate G is a random graph and each pair of nodes is connected with probability P (i.e. an Erdős–Rényi random graph), the scalars hi are i.i

Subgraph isomorphism problem (1,857 words) [view diff] exact match in snippet view article find links to article

bioinformatics of protein-protein interaction networks, and in exponential random graph methods for mathematically modeling social networks. Ohlrich et al. (1993)

Self-complementary graph (366 words) [view diff] exact match in snippet view article find links to article

North-Holland, pp. 223–238, MR 0806985. Cameron, Peter J. (1997), "The random graph", The mathematics of Paul Erdős, II, Algorithms Combin., vol. 14, Berlin:

Friend of a friend (1,102 words) [view diff] exact match in snippet view article find links to article

(2009). "Birds of a feather, or friend of a friend? Using exponential random graph models to investigate adolescent social networks". Demography. 46 (1):

Colour refinement algorithm (899 words) [view diff] exact match in snippet view article find links to article

(example V.1 in ). Despite this, the algorithm is very powerful in that a random graph will be identified by the algorithm asymptotically almost surely. Even

Rick Durrett (324 words) [view diff] case mismatch in snippet view article find links to article

Introduction. CRC Press (1996). 341 pp. ISBN 0-8493-8071-5 Durrett, R. Random Graph Dynamics. Cambridge University Press (2006). 222 pp. ISBN 0-521-86656-1

Webgraph (492 words) [view diff] exact match in snippet view article find links to article

webgraph strongly differs from the degree distribution of the classical random graph model, the Erdős–Rényi model: in the Erdős–Rényi model, there are very

Hereditarily finite set (1,448 words) [view diff] exact match in snippet view article find links to article

finite sets and edges correspond to set membership is the Rado graph or random graph. In the common axiomatic set theory approaches, the empty set { } {\displaystyle

Yule–Simon distribution (1,312 words) [view diff] exact match in snippet view article find links to article

parameters. The same happens also for other preferential attachment random graph models. The preferential attachment process can also be studied as an

Van H. Vu (617 words) [view diff] exact match in snippet view article find links to article

In 2007, with Johansson and Kahn, Vu solved the Shamir conjecture in random graph theory. Among others, they established the sharp threshold for the existence

Adam Logan (299 words) [view diff] exact match in snippet view article find links to article

A; Molloy, M; Pralat, P (28 June 2018). "A variant of the Erdos-Renyi random graph process". arXiv:1806.10975 [math.CO]. Adam Logan Scrabble tournament

Connectivity (graph theory) (2,062 words) [view diff] exact match in snippet view article

n) space. The problem of computing the probability that a Bernoulli random graph is connected is called network reliability and the problem of computing

Nick Wormald (412 words) [view diff] exact match in snippet view article find links to article

1214/aoap/1177004612. Nicholas C Wormald (1999). "The differential equation method for random graph processes and greedy algorithms" (PDF). Lectures on Approximation and

First passage percolation (862 words) [view diff] exact match in snippet view article find links to article

Hooghiemstra, G.; Van Mieghem, P. "First passage percolation on the random graph" (PDF). ewi.tudelft.nl. Delft University of Technology. Retrieved 2014-11-17

Ecological network (3,274 words) [view diff] exact match in snippet view article find links to article

patterns of under/over representation of certain motifs compared to a random graph, have found that food webs have particular motif structures Trophic coherence:

Cascading failure (2,953 words) [view diff] exact match in snippet view article find links to article

theory – Mathematical theory on behavior of connected clusters in a random graph Progressive collapse – Building collapse type Virtuous circle and vicious

Classification scheme (information science) (649 words) [view diff] exact match in snippet view article

(application area). network (mathematics) – an arrangement of objects in a random graph. ontology – an arrangement of concepts that are related by various well

Vickrey auction (2,220 words) [view diff] exact match in snippet view article find links to article

2004, it was shown that the expected VCG overpayment of an Erdős–Rényi random graph with n nodes and edge probability p, G ∈ G ( n , p ) {\displaystyle \scriptstyle

Shortcut model (1,752 words) [view diff] exact match in snippet view article find links to article

randomly chosen node. As a result, the small world model tends to a random graph rather than a two-dimensional graph as the shortcut probability is increased

Zipf's law (4,663 words) [view diff] exact match in snippet view article find links to article

Kali, Raja (15 September 2003). "The city as a giant component: a random graph approach to Zipf's law". Applied Economics Letters. 10 (11): 717–720

KHOPCA clustering algorithm (1,017 words) [view diff] exact match in snippet view article find links to article

acting in a dynamic 2D simulation. The geometry is based on a geometric random graph; all existing links are drawn in this network. KHOPCA also works in a

Co-stardom network (853 words) [view diff] exact match in snippet view article find links to article

path length: 3.65 Average clustering coefficient: 0.79 Compared to a random graph of the same size and average degree, the average path length is close

Any-angle path planning (1,980 words) [view diff] exact match in snippet view article find links to article

by increasingly finding shorter and shorter paths: Rapidly-exploring random graph (RRG) and RRT* Informed RRT* improves the convergence speed of RRT* by

Phase transition (6,649 words) [view diff] exact match in snippet view article find links to article

theory – Mathematical theory on behavior of connected clusters in a random graph Continuum percolation theory Superfluid film – Thin layer of liquid in

Constraint satisfaction problem (3,363 words) [view diff] exact match in snippet view article find links to article

{\displaystyle (\mathbb {Q} ,<)} , all first-order reducts of the countable random graph, all first-order reducts of the model companion of the class of all C-relations

Diffusion (8,690 words) [view diff] exact match in snippet view article find links to article

theory – Mathematical theory on behavior of connected clusters in a random graph Social Networks – journalPages displaying wikidata descriptions as a

BIT predicate (2,149 words) [view diff] exact match in snippet view article find links to article

1007/978-1-4419-1221-3. ISBN 978-1-4419-1220-6. Cameron, Peter J. (2001). "The random graph revisited" (PDF). European Congress of Mathematics, Vol. I (Barcelona

Paul A. Catlin (1,724 words) [view diff] exact match in snippet view article find links to article

Paul A.; Chen, Zhi-Hong (1991). "Chapter 10: The arboricity of the random graph". In Alavi, Yousef (ed.). Graph theory, combinatorics, algorithms, and

Common graph (1,823 words) [view diff] exact match in snippet view article find links to article

of F {\displaystyle F} are monochromatic. Note that in a Erdős–Rényi random graph G = G ( n , p ) {\displaystyle G=G(n,p)} with each edge drawn with probability

Aanderaa–Karp–Rosenberg conjecture (3,557 words) [view diff] exact match in snippet view article find links to article

{\displaystyle p} in the range [ 0 , 1 ] {\displaystyle [0,1]} such that a random graph G ( n , p ) {\displaystyle G(n,p)} (obtained by choosing randomly whether

Convolution power (1,136 words) [view diff] exact match in snippet view article find links to article

regular for the convolution to be well-defined. In the configuration random graph, the size distribution of connected components can be expressed via the

Counting lemma (2,423 words) [view diff] exact match in snippet view article find links to article

local patterns, to be roughly equal to the count of such patterns in a random graph. These small patterns can be, for instance, the number of graph embeddings

Zarankiewicz problem (5,119 words) [view diff] exact match in snippet view article find links to article

, Y {\displaystyle X,Y} . Let G {\displaystyle G} be the associated random graph on vertex set F q s {\displaystyle \mathbb {F} _{q}^{s}} , such that

Networks in marketing (4,713 words) [view diff] exact match in snippet view article find links to article

as Paul Erdös and Alfréd Rényi, Erdős–Rényi model, which applies to random graph theory, and Watts & Strogatz Small-world network, all of which can be

List of Clarivate Citation laureates in Physics (383 words) [view diff] exact match in snippet view article find links to article

research on network systems including work on community structure and random graph models." University of Michigan 2021 Giorgio Parisi (born 1948) Italy

List of women in statistics (8,609 words) [view diff] exact match in snippet view article find links to article

Gile, American expert on respondent-driven sampling and exponential random graph models Dorothy M. Gilford (1919–2014), head of mathematical statistics