Cox and R. Durrett, The stepping stone model: new formulas expose old myths, Ann. Darling and J. Norris, Differential equation approximations for markov chains, Probab. Palla, and T. Vicsek, Clique percolation in random networks, Physical Review Letters , 94 , Devroye, C.
McDiarmid, and B. Dorogovtsev and J. Mendes, Evolution of networks, Adv. Dorogovtsev, A. Goltsev, and J. Mendes, k -core architecture and k -core percolation on complex networks, Phys. D , , 7— Dorogovtsev, J.
Mendes, and A. Samukhin, Anomalous percolation properties of growing networks, Phys. Durrett and H. Cambridge Univ. Press, Cambridge, Durrett and M. Restrepo, One-dimensional stepping stone models, sardine genetics and Brownian local time, Ann. Academic Press, New York, I, Publ. Debrecen , 6 , — II, Studia Sci. Suen, and P. Winkler, On the size of a random maximal graph, Random Structures Algorithms , 6 , — Fabrikant, E. Koutsoupias, and C. Faloutsos, P. Faloutsos, and C. Fenner and A.
Frieze, Hamiltonian cycles in random regular graphs, J. B , 37 , — Fernholz and V. Ramachandran, The diameter of sparse random graphs, Random Structures Algorithms , 31 , — Ford, R. Norman, and G. Uhlenbeck, Combinatorial problems in the theory of graphs. II, Proc.
Ford and G. I, Proc. III, Proc. IV, Proc. Frieze and R. Kannan, Quick approximation to matrices and applications, Combinatorica , 19 , — Frieze, J. Kleinberg, R. Ravi, and W. Debany, Line-of-sight networks, in: Proc. Frieze, M. Krivelevich, and C. Smyth, On the chromatic number of random graphs with a fixed degree sequence, Combin.
Frieze, Finding Hamilton cycles in sparse random graphs, J. B , 44 , — Gilbert, Random graphs, Ann. Gilbert, A simulation of the structure of academic science, Sociological Research Online , 2 , Goltsev, S. Dorogovtsev, and J. Mendes, k -core bootstrap percolation on complex networks: critical phenomena and nonlocal effects, Phys.
Greenhill, A. Wormald, Random hypergraph processes with degree restrictions, Graphs Combin. Springer-Verlag, Berlin, Harris, The theory of branching processes , Dover Phoenix Editions. Dover Publications Inc. Janson, On a random graph related to quantum theory, Combin.
Janson, On percolation in random graphs with given vertex degrees, Electron. Janson, Standard representation of multivariate functions on a general probability space, Preprint available from arXiv Janson, D. Knuth, T. Luczak, and B. Pittel, The birth of the giant component, Random Structures Algorithms , 4 , — With an introduction by the editors.
Janson and M. Luczak, A simple solution to the k -core problem, Random Structures Algorithms , 30 , 50— Luczak, A new approach to the giant component problem, Random Structures Algorithms , 34 , — Janson, T. Luczak, and A. Wiley-Interscience, New York, Janson and J. Spencer, A point process describing the component sizes in the critical window of the random graph evolution, Combin. Kalikow and B. Weiss, When are random graphs connected, Israel J.
Kang and T. Seierstad, The critical phase for random graphs with a given degree sequence, Combin. Karp, The transitive closure of a random digraph, Random Structures Algorithms , 1 , 73— Katz, Probability of indecomposability of a random mapping function, Ann.
Kendall, Deterministic and stochastic epidemics in closed populations, in: Proceedings of the Third Berkeley Symposium on Mathematical Statistics and Probability, — , vol. IV , pages —, Berkeley and Los Angeles, University of California Press. Kendall, Branching processes since , J. Khokhlov and V. Kolchin, On the structure of a random graph with nonuniform distribution, in: New trends in probability and statistics, Vol. VSP, Utrecht, Japan , 3 , 62— Kolchin and V.
Khokhlov, On the number of cycles in a random nonequiprobable graph, Diskret. Krivelevich, B. Sudakov, V. Vu, and N. Wormald, Random regular graphs of high degree, Random Structures Algorithms , 18 , — Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. IEEE Comput. Press, Los Alamitos, CA, Lotka, The frequency distribution of scientific productivity, J. Washington Acad. Szegedy, Limits of dense graph sequences, J. B , 96 , — B , 98 , — Luczak, Component behavior near the critical point of the random graph process, Random Structures Algorithms , 1 , — Luczak, Random trees and random graphs, Random Structures Algorithms , 13 , — Luczak, B.
Pittel, and J. Wierman, The structure of a random graph at the point of the phase transition, Trans. Luczak and J. Wierman, The chromatic number of random graphs at the double-jump threshold, Combinatorica , 9 , 39— McKay, Asymptotics for 0—1 matrices with prescribed line sums, in: Enumeration and design Waterloo, Ont. Academic Press, Toronto, ON, McKay and N. Wormald, Asymptotic enumeration by degree sequence of graphs of high degree, European J. Wormald, Uniform generation of random regular graphs of moderate degree, J.
Algorithms , 11 , 52— Molloy, Cores in random hypergraphs and Boolean formulas, Random Structures Algorithms , 27 , — Molloy and B. Reed, A critical point for random graphs with a given degree sequence, Random Structures Algorithms , 6 , — Reed, The size of the giant component of a random graph with a given degree sequence, Combin. Nachmias and Y. Watts, Random graphs with arbitrary degree distributions and their applications, Phys.
Norros and H. Reittu, On a conditionally Poissonian graph process, Adv. Osthus and A. Palla, D. Farkas, P. Pollner, I. Vicsek, k -clique percolation and clustering, this volume , — Palla, I. Vicsek, Directed network modules, New Journal of Physics , 9 , 21 pages. Penrose, On the spread-out limit for bond and continuum percolation, Ann. Pittel, On tree census and the giant component in sparse random graphs, Random Structures Algorithms , 1 , — Pittel, On the largest component of the random graph at a nearcritical stage, J.
B , 82 , — Pittel, J. Spencer, and N. Wormald, Sudden emergence of a giant k -core in a random graph, J. B , 67 , — I, Magyar Tud. Riddell, Jr. Uhlenbeck, On the theory of the virial development of the equation of state of mono-atomic gases, J. Riordan, The small giant component in scale-free random graphs, Combin. Riordan, The k -core and branching processes, Combin. Riordan and N. Wormald, The diameter of G n, p , Preprint available from arXiv Robinson and N.
Wormald, Random graph processes with degree restrictions, Combin. Wormald, Random graph processes with maximum degree 2, Ann. Wormald, Connectedness of graphs generated by a random d-process, J. Schmidt-Pruzan and E. Shamir, Component structure in the evolution of random hypergraphs, Combinatorica , 5 , 81— Scott and G. Shepp, Connectedness of certain random graphs, Israel J. Simon, On a class of skew distribution functions, Biometrika , 42 , — Simonovits, A method for solving extremal problems in graph theory, stability problems, in: f Theory of Graphs Proc.
Stepanov, The probability of the connectedness of a random graph G m t , Teor. Stepanov, Phase transitions in random graphs, Teor. Stepanov, Structure of the random graphs G m xh , Teor. Condition: Very Good. Item is in very good condition. Photos are stock pictures and not of the actual item. Seller Inventory DS Harris, Theodore E. Publisher: Dover Publications , This specific ISBN edition is currently not available. View all copies of this ISBN edition:. Other Popular Editions of the Same Title.
Search for all books with this author and title. Customers who bought this item also bought. Stock Image. Published by Dover Publications Used Hardcover Quantity: 1.
0コメント