Evolutionary games on graphs
G Szabó, G Fath - Physics reports, 2007 - Elsevier
Game theory is one of the key paradigms behind many scientific disciplines from biology to
behavioral sciences to economics. In its evolutionary form and especially when the …
behavioral sciences to economics. In its evolutionary form and especially when the …
[BOOK][B] Random graphs
S Janson, T Luczak, A Rucinski - 2011 - books.google.com
A unified, modern treatment of the theory of random graphs-including recent results and
techniques Since its inception in the 1960s, the theory of random graphs has evolved into a …
techniques Since its inception in the 1960s, the theory of random graphs has evolved into a …
The size of the giant component of a random graph with a given degree sequence
Given a sequence of nonnegative real numbers λ0, λ1,… that sum to 1, we consider a
random graph having approximately λin vertices of degree i. In [12] the authors essentially …
random graph having approximately λin vertices of degree i. In [12] the authors essentially …
[PDF][PDF] Models of random regular graphs
NC Wormald - London mathematical society lecture note series, 1999 - williams.edu
This is a survey of results on properties of random regular graphs, together with an
exposition of some of the main methods of obtaining these results. Related results on …
exposition of some of the main methods of obtaining these results. Related results on …
Differential equations for random processes and random graphs
NC Wormald - The annals of applied probability, 1995 - JSTOR
General criteria are given to ensure that in a family of discrete random processes, given
parameters exhibit convergence to the solution of a system of differential equations. As one …
parameters exhibit convergence to the solution of a system of differential equations. As one …
Hybrid quantum-classical algorithms for approximate graph coloring
We show how to apply the recursive quantum approximate optimization algorithm (RQAOA)
to MAX-$ k $-CUT, the problem of finding an approximate $ k $-vertex coloring of a graph …
to MAX-$ k $-CUT, the problem of finding an approximate $ k $-vertex coloring of a graph …
Fixed-angle conjectures for the quantum approximate optimization algorithm on regular MaxCut graphs
The quantum approximate optimization algorithm (QAOA) is a near-term combinatorial
optimization algorithm suitable for noisy quantum devices. However, little is known about …
optimization algorithm suitable for noisy quantum devices. However, little is known about …
[PDF][PDF] The differential equation method for random graph processes and greedy algorithms
NC Wormald - Lectures on approximation and randomized algorithms, 1999 - Citeseer
Random graph processes and related discrete random processes are being used
increasingly in the analysis of randomised algorithms and the study of random graphs …
increasingly in the analysis of randomised algorithms and the study of random graphs …
[BOOK][B] Graphical Evolution: an introduction to the theory of random graphs
EM Palmer - 1985 - dl.acm.org
Graphical evolution: an introduction to the theory of random graphs | Guide books ACM Digital
Library home ACM home Google, Inc. (search) Advanced Search Browse About Sign in …
Library home ACM home Google, Inc. (search) Advanced Search Browse About Sign in …
Ising model on networks with an arbitrary distribution of connections
We find the exact critical temperature T c of the nearest-neighbor ferromagnetic Ising model
on an “equilibrium” random graph with an arbitrary degree distribution P (k). We observe an …
on an “equilibrium” random graph with an arbitrary degree distribution P (k). We observe an …