Trevor Chi-Yuen Tao
Biographic Data
| ID | 4163945 |
|---|---|
| NAME | Trevor Chi-Yuen Tao |
| GIVEN NAMES | Trevor Chi-Yuen |
| FAMILY NAME | Tao |
| SIGNATURE | TAO T C |
| AFFILIATIONS | Defence Science and Technology Group |
| VERIFIED | No |
| TOTAL WORKS | 1 |
| TOTAL CITATIONS | 1 |
| WORKS AS AUTHOR | 1 |
| WORKS AS EDITOR | 0 |
| FIRST PUBLICATION YEAR | 2016 |
| LATEST PUBLICATION YEAR | 2016 |
| H-INDEX | 1 |
An improved MCMC algorithm for generating random graphs from constrained distributions
We consider the problem of generating uniformly random graphs from a constrained distribution. A graph is valid if it obeys certain constraints such as a given number of nodes, edges, k -stars or degree sequence, and each graph must occur with equal probability. A typical application is to confirm the correctness of a model by repeated sampling and comparing statistical properties against empirical data. Markov Chain Monte Carlo (MCMC) algorithms…
An improved MCMC algorithm for generating random graphs from constrained distributions
We consider the problem of generating uniformly random graphs from a constrained distribution. A graph is valid if it obeys certain constraints such as a given number of nodes, edges, k -stars or degree sequence, and each graph must occur with equal probability. A typical application is to confirm the correctness of a model by repeated sampling and comparing statistical properties against empirical data. Markov Chain Monte Carlo (MCMC) algorithms…
An improved MCMC algorithm for generating random graphs from constrained distributions
We consider the problem of generating uniformly random graphs from a constrained distribution. A graph is valid if it obeys certain constraints such as a given number of nodes, edges, k -stars or degree sequence, and each graph must occur with equal probability. A typical application is to confirm the correctness of a model by repeated sampling and comparing statistical properties against empirical data. Markov Chain Monte Carlo (MCMC) algorithms…
Algorithm (1 work) · Combinatorics (1 work) · Complex Network Analysis Techniques (1 work) · Computer Science (1 work) · Correctness (1 work) · Graph (1 work) · Markov chain Monte Carlo (1 work) · Markov Chains and Monte Carlo Methods (1 work) · Mathematical optimization (1 work) · Mathematics (1 work)