Name
Abstract | ||
|---|---|---|
We introduce a set of iterative equations that exactly solves the size distribution of components on small arbitrary graphs after the random removal of edges. We also demonstrate how these equations can be used to predict the distribution of the node partitions (i.e., the constrained distribution of the size of each component) in undirected graphs. Besides opening the way to the theoretical prediction of percolation on arbitrary graphs of large but finite size, we show how our results find application in graph theory, epidemiology, percolation and fragmentation theory. Copyright (C) EPLA, 2012 |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1209/0295-5075/98/16001 | EPL |
Keywords | Field | DocType |
exact solution,graph theory | Discrete mathematics,Modular decomposition,Indifference graph,Random graph,Quantum mechanics,Chordal graph,Pathwidth,Continuum percolation theory,Physics,Dense graph,Maximal independent set | Journal |
Volume | Issue | ISSN |
98 | 1 | 0295-5075 |
Citations | PageRank | References |
1 | 0.39 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Antoine Allard | 1 | 29 | 5.05 |
| Laurent Hébert-Dufresne | 2 | 38 | 7.03 |
| Pierre-André Noël | 3 | 31 | 3.39 |
| Vincent Marceau | 4 | 25 | 2.61 |
| Louis J. Dubé | 5 | 26 | 4.66 |