Weight-driven growing networks
|
|
- Miles Morgan
- 5 years ago
- Views:
Transcription
1 PHYSICAL REVIEW E 71, Weight-driven groing netorks T. Antal* and P. L. Krapivsky Center for Polymer Studies and Department of Physics, Boston University, Boston, Massachusetts 02215, USA Received 12 August 2004; published 8 February 2005 We study groing netorks in hich each link carries a certain eight randomly assigned at birth and fixed thereafter. The eight of a node is defined as the sum of the eights of the links attached to the node, and the netork gros via the simplest eight-driven rule: A nely added node is connected to an already existing node ith the probability hich is proportional to the eight of that node. We sho that the node eight distribution n has a universal tail, that is, it is independent of the link eight distribution: n 3 as. Results are particularly neat for the exponential link eight distribution hen n is algebraic over the entire eight range. DOI: /PhysRevE PACS numbers: C, a, q, Sn I. INTRODUCTION The netork structure lies beneath many physical, biological, social, economic, and other real-orld systems. Examples include resistor netorks, metabolic netorks, communication netorks like the Internet, information netorks like the World Wide Web, transportation netorks, food ebs, etc. Some netorks are engineered, hile others like the World Wide Web are created in a chaotic manner, viz., by the uncoordinated actions of many individuals, and yet they sho a great deal of self-organization 1. This surprising order of seemingly disordered netorks as noticed long ago in the context of random graphs 2,3, and it is also apparent in the models of groing random netorks that have been thoroughly studied in the past fe years see revies 4 6 and references therein. Netorks or graphs are defined as sets of nodes joined by links. A link in a graph merely indicates that a given pair of nodes is connected. If, hoever, connections differ in strength, one may formalize this property by assigning a eight to each link. Many real-orld netorks are intrinsically eighted. In a collaboration netork, the eight of a link beteen co-authors measures the strength of the collaboration such as the number of jointly authored publications 7,8. In the airline transportation netork, the eight of a link beteen to airports gives the passenger capacity on this route 9,10. Thus mathematically the eighted netork is a graph in hich each link carries a certain number hich is called the eight. Weighted netorks appear in the literature under different names. For instance, the multigraph that is, the graph in hich to nodes can be joined by multiple links can be replaced by the graph in hich a link beteen to nodes carries the integer eight equal to the number of links in the original multigraph joining those to nodes. Numerous engineering and mathematical studies of the flos in netorks also treat eighted netorks the eight usually termed capacity represents *On leave from Institute for Theoretical Physics HAS, Eötvös University, Budapest, Hungary. Electronic address: paulk@bu.edu the maximum alloed flo 11,12. Resistor netorks see, e.g., form another very important class of eighted netorks. The models of eighted netorks are usually close to the uneighted ones as far as the underlying graph structure is concerned. In other ords, the link eights are passive variables. This allos us to study eighted netorks using the knoledge of uneighted netorks as the starting point 16,17. In reality, the link eights can of course affect the graph structure. The range of possible models in hich the link eights are active variables is extremely broad see, e.g., hile the mechanisms driving the evolution of the real-orld netorks are still hardly knon. In such a situation, one ants to study a minimal rather than detailed model. Here e introduce and investigate a minimal model of the eight-driven groth. In Sec. II, e introduce the minimal model precisely, and determine the node eight distribution and the joint node eight-degree distribution. We then compute the incomponent eight distribution. In Sec. III, e discuss some generalizations of the minimal model. We conclude in Sec. IV. II. THE MODEL The model is defined as follos. Each link carries a positive eight hich is dran from a certain distribution. We shall assume that the eights are positive 23. The eight is assigned to the link hen the link is created, and it remains fixed thereafter. The eight of a node is the sum of the eights of the links attached to the node. When a ne node is added, it is linked to a single target node ith probability proportional to the eight of the target node. We assume that only one link emanates from each nely introduced node, so the resulting netork is a tree; the general case hen a fe links emanate from each node is discussed in Sec. III. The eight of a node also termed the node strength by some authors increases hen a ne link is attached to it, yet, as the size of the netork gros, the node eight distribution approaches a stationary distribution. Our first goal is to determine this distribution /2005/712/ /$ The American Physical Society
2 T. ANTAL AND P. L. KRAPIVSKY PHYSICAL REVIEW E 71, A. Weight distribution Let N be the total number of nodes in the netork and N Nd the number of nodes hose eight lies in the range,+d. When N is large, it can be treated as a continuous variable, and N N satisfies dn dn = 1 dx xxn x N 0 +, 1 here N= 0 dn N is the total eight of all nodes 25. The term in Eq. 1 hich is proportional to xn x / accounts for nodes ith eight x hich gain a link of eight x thereby creating nodes of eight. The term N / is the corresponding loss term. The last term accounts for the nely introduced node hich has the same eight as its link. In the large N limit, N N=Nn, i.e., the eight distribution approaches a stationary N independent distribution n. Hence, Eq. 1 simplifies to + n dx xxnx +, 2 =0 here = 0 dn is the average node eight. The total eight of all nodes is tice the total eight of all links since each link connects to nodes and the same obviously holds for the average eights. Therefore, =2 d. =20 We no specialize Eq. 2 to the uniform link eight distribution =1, 1 3 0, 1. Using relation =2=1 and the shorthand notation F =1+ 0 dxxnx, e recast Eq. 2 into =F, 1 1+n 4 F F 1, 1. One can solve Eq. 4 recursively. Using F=n, e find that for 1, the cumulative distribution satisfies 1 +1F=F here F=dF/d. Solving this equation subject to the boundary condition F0=1 yields F =1+ 1 e. Therefore, the eight distribution is n = 1+ 2 e for 1. On the next interval 12, e ought to solve 1 +1 df d = F 1 e 1. The solution should match the previous one; this gives the boundary condition F1=e/2. The resulting cumulative distribution is F=e 1 e+1 /1+, from hich e obtain the node eight distribution FIG. 1. The node eight distribution n emerging for uniform and exponential link eight distributions. n = 1+ e 1 e for 1 2. Interestingly, the eight distribution loses continuity at the cutoff value =1 of the uniform link eight distribution: n1 0=e/4 hile n1+0=e 2/4. Proceeding, one finds the node eight distribution on the interval 23, etc. The distribution is analytic everyhere apart from the integer values; at the integer value =k2, the node eight distribution is continuously differentiable k 2 times see Fig The analytic expressions for the node eight distribution are very cumbersome for large. Fortunately, the asymptotic behavior is very simple. To extract the asymptotic, e expand the right-hand side of Eq. 4 using the Taylor series, F F 1 = F 1 2 F + = n 1 n +. 2 Plugging this expansion into Eq. 4, e obtain hich is solved to give dn +3n =0, d 5 n A 3 hen. 6 The amplitude A cannot be found by solving the linear equation 5; its determination requires analysis of the full problem 4. Note also that for the deterministic link eight distribution = 1, the eight of the node is equal to the degree, so the model becomes equivalent to the basic groing netork model ith preferential attachment hich also leads to a node eight distribution ith 3 tail. In general, the large eight tail of the node eight distribution is alays given by Eq. 6 if the link eight distribution has a cutoff. To prove this assertion, suppose that =0 for 1. For 1, Eq. 2 becomes
3 WEIGHT-DRIVEN GROWING NETWORKS + n = 7 ith = 1 0 dxx xn x; for the uniform distribution =F F 1 and Eq. 7 turns into Eq. 4. Expanding the integrand in, yields xn x = n xn + = n n +, 2 9 here relations d=1 and d=/2 ere used. In conjunction ith Eq. 9, Eq. 7 reduces to Eq. 5 leading to the tail given by Eq. 6. This derivation, as ell as the earlier one that led to Eq. 5, ignores the higher terms in the expansion 8. Keeping such terms, one ould obtain dn d +3n = 2n 1 3 3n + 10 ith 2 = 1 d 2, 3 = 1 d 3, etc. Solving Eq. 10 gives higher-order corrections to the tail asymptotics n = A but it does not affect the leading 3 tail. The exponential link eight distribution = e 12 is particularly appealing as the node eight distribution in this case is remarkably simple. The governing equation 2 becomes 2+e n dxxe =0 x nx Writing G=2+ 0 dxxe x nx, e recast integral equations 13 into a simple differential equation 2 dg +1 d = G. 14 We find G=8+2 2 e, from hich n = Thus for the exponential link eight distribution, the emerging node eight distribution is scale-free that is, purely algebraic over the entire eight range. We no outline the behavior for link distributions ith heavy tails. Consider particularly distributions ith a poerla tail ; the exponent must obey the inequality 1 to ensure normalization d=1. It is easy to check that for 3 the leading asymptotic of the node eight distribution is n 3 ; moreover, expansion 11 holds up to the order of n, here n is the largest integer smaller than i.e., nn For 23, the leading term shos even sloer decay n3 1. The situation is very different for 12 hen the total eight gros ith size faster than linearly: N 1/ 1. Using the usual definition N =Nn, e observe that the square bracket term in Eq. 1 is negligible for large N values. Hence n, suggesting that the number of nodes ith more than one links gros sloer than linearly in N, that is, only the dangling nodes give contribution to n. B. Weight-degree distribution The node eight distribution is perhaps the most natural, and therefore readily tractable, local characteristic for netorks ith eight-driven groth. Of course, the degree distribution remains geometrically the simplest local characteristic, yet for eighted netorks it is generally impossible to rite don a closed equation for the degree distribution n k. To compute n k, one must determine the joint eight-degree distribution n k ; the degree distribution is then found by integration, n k =0 dn k. 16 The eight-degree distribution obeys a set of equations similar to Eq. 2. The density of dangling nodes is given by + n 1 = hile for k2 the eight-degree distribution satisfies 17 + n k dx xxn k 1 x. 18 =0 One can treat Eqs. 17 and 18 recursively, yet even for the simplest link eight distributions like the uniform distribution 3 the exact expressions for n k become very unieldy as the degree gros. Exceptionally neat results emerge again for the exponential link eight distribution 12. In this case, 2+e n k dxe =0 x xn k 1 x. 19 Starting ith n 1 =2/2+e e explicitly computed a fe more n k hich led us to the hypothetical solution (e use the shorthand notation = 2 ln1+/2) n k = PHYSICAL REVIEW E 71, k 1 e 3 k 1!. 20 Of course, the above ansatz agrees ith the sum rule n = k1 n k. Having guessed the solution, it is then straightforard to verify its validity. Note that asymptotically k 1, the joint eight-degree distribution approaches a Gaussian centered around =k 4, or k k+2 lnk, ith idth k. Interestingly, the average eight of the nodes of degree k, viz., k k+2 lnk, slightly exceeds 27 the expected value k =k
4 T. ANTAL AND P. L. KRAPIVSKY PHYSICAL REVIEW E 71, i 0 n 1 0 = The density i 0, satisfies i 0, =0 dx x 0 +2xi 0,x FIG. 2. In- and out-components of node x. In this example, the out-component has size 3 and the in-component has size 5 node x itself belongs to its in- and out-components. The degree distribution does not admit a simple closed form even for the exponential link eight distribution. The exact expression n k =0 d k 1 e 2 k 1! 21 simplifies for k1. Indeed, utilizing to properties of the quantity k e /k!, viz., i it has a sharp maximum at =k and ii 0 d k e /k!=1, e estimate the integral in Eq. 21 as the value of the sloly varying part of the integrand /2 1 1+/2 2 near the maximum, i.e., at k k+2 lnk. Thus n k = 8 k 3 48ln k k 4 + Ok C. In-component eight distribution The emerging netork has the natural structure of a directed graph since each ne link starts at the ne node and ends up at some previous node. Taking into account the orientation of each link allos us to define an in-component and an out-component ith respect to each node. For instance, the in-component of node x is the set of all nodes from hich node x can be reached folloing a path of directed links Fig. 2. The computation of in- and out-component size distributions is quite complicated as one must first determine joint distributions that involve both size and eight. In contrast, in- and out-component eight distributions can be determined directly. Here e compute the in-component eight distribution. Let 0 be the eight of the link emanating from node x and the total eight of all other links in the in-component of node x; then the total eight of that in-component, that is, the sum of eights of all nodes in the in-component of node x, is Denote by i 0, the density of such incomponents. Here e tacitly assume that 0, that is, the size of the in-components is larger than 1. The density i 0 of in-components of size 1 and eight 0 is found by noting that such in-components are just dangling nodes, so 0 +2i 0, + i 0 0. For the exponential link eight distribution 12, this equation can be reritten in a simple form 2 G = G, 24 here G=G 0, is the auxiliary variable G =0 dxe x 0 +2xi 0,x e Solving Eq. 24, e obtain 2+ 0 G 0, = G 0, e. Equation 25 gives the initial condition, so the auxiliary variable reads 2 0 G = e 0. This result leads to the in-component density 2 0 i 0, = e 26 No the total eight of the in-component is s= 0 +2, and the respective eight distribution Is is s Is = is + 1 d 0 i 0,s 0 / Plugging Eqs. 23 and 26 into Eq. 27, e arrive at 1 Is = 2+s s s 2e s. 28 Therefore, up to an exponentially small correction, the incomponent eight distribution is algebraic ith exponent 2 the same exponent characterizes the in-component size distribution 28, hich is not so surprising as this exponent is found to be very robust. III. GENERALIZATIONS The model of the previous section alays results in a tree structure by construction. In this section, e consider to generalizations of that model hich allo the formation of loops in the evolving netork. The simplest generalization of the minimal model leading to a netork ith many loops is to connect a nely created node to m1 target nodes. The attachment probability is still
5 WEIGHT-DRIVEN GROWING NETWORKS proportional to the eight of the target node as before, and the eights of the m ne links are chosen independently from the link eight distribution. The eight of the nely introduced node becomes the sum of the m independent link eights, hich is then distributed according to m, the m-fold convolution of. The governing equation thus remains similar to Eq. 1 except that the last term becomes m, and the square bracketed term gains a factor m due to the m attached links. As the average node eight is also m times larger than previously, that is, =2m, and the node density satisfies equation 2 + n =0 dx xxnx +2 m, hich is almost identical to Eq. 2, the only difference is the second term on the right-hand side, hich no contains m instead of. The modified model leads to the same 3 tail for the node eight distribution for any ith a cutoff since then m also has a cutoff and the same argument applies as before. For the exponential link eight distribution =e the convoluted distribution is m =e m 1 /m 1!, and the resulting node eight distribution is algebraic up to an exponentially small correction, 2mm +3 n 2+ 3 for A more substantial generalization of the minimal model can be obtained by combining to processes: In addition to the original process of creating and linking ne nodes to the netork Sec. II, links beteen already existing nodes are created as ell 29. We again choose the simplest eightdriven rule, namely e assume that a ne link beteen to existing nodes is created ith a rate proportional to the product of their eights. Let r be the average number of link creations beteen already existing nodes per node creation, so in the netork ith N nodes the average number of links is 1+rN. This can be modeled by to independent processes: ith probability 1/1+r, a ne node is attached to the netork, and ith probability r/1+r, a ne link is added beteen to already existing nodes. The eights of the ne links created in both processes are dran independently from the same distribution. The node eight distribution N N satisfies an equation similar to Eq. 1, ith the term in the square brackets multiplied by 1 +2r/. The governing equation for the normalized eight distribution n is therefore almost identical to Eq. 2; the only change is the replacement =/1+2r, PHYSICAL REVIEW E 71, n dx xxnx =0 The average node eight = 0 dn is no equal to 21+r since the number of links 1+r times exceeds the number of nodes and each link contributes tice. Multiplying Eq. 30 by and integrating over, e indeed obtain =21+r 0 d, thereby providing a useful check of self-consistency. For the exponential link eight distribution 12, the node eight distribution satisfies r 2+2r e n =1+ 1+2r dxxe x nx. 2+2r0 Solving this equation, e again obtain the purely algebraic node eight distribution, n =1+ 1+2r, = 3+4r 2+2r 1+2r. The exponent monotonously decreases from 3 to 2 as r increases from 0 to. IV. CONCLUSIONS We examined a minimal model for the eight-driven netork groth. The virtue of the minimal model is that its many features, such as the node eight distribution, the joint node eight-degree distribution, the in-component eight distribution, etc., are tractable analytically. In particular, e shoed that the node eight distribution exhibits a universal 3 tail independently of the link eight distribution as long as the tail of the latter is sharper than 3, and the incomponent eight distribution displays a robust s 2 tail. Remarkably simple behaviors characterize the exponential link eight distribution: The emerging node eight distribution is purely algebraic, hile the joint node eightdegree distribution and the in-component eight distribution are also given by neat closed formulas. We also studied generalizations of the minimal model for the eight-driven netork groth. When a ne node is connected to several target nodes and/or links are additionally created beteen already existing nodes, the netork acquires loops yet it remains tractable. One generic feature of this class of models is that the node eight distribution remains algebraic, n, ith the exponent varying from 3 to 2 as the average node degree increases from 1 to. ACKNOWLEDGMENT T.A. thanks the Siss NSF for financial support. 1 S. N. Dorogovtsev and J. F. F. Mendes, Evolution of Netorks: From Biological Nets to the Internet and WWW Oxford University Press, Oxford, 2003; R. Pastor-Satorras and A. Vespignani, Evolution and Structure of the Internet: A Statistical Physics Approach Cambridge University Press, Cambridge, P. Erdős and P. Rényi, Publ. Math. Inst. Hung. Acad. Sci. 5,
6 T. ANTAL AND P. L. KRAPIVSKY PHYSICAL REVIEW E 71, B. Bollobás, Random Graphs Academic, London, R. Albert and A.-L. Barabási, Rev. Mod. Phys. 74, P. L. Krapivsky and S. Redner, Comput. Net. 39, M. E. J. Neman, SIAM Rev. 45, M. E. J. Neman, Phys. Rev. E 64, ; 64, A.-L. Barabási, H. Jeong, Z. Neda, E. Ravasz, A. Schubert, and T. Vicsek, Physica A 311, R. Guimera, M. Sales-Pardo, and L. A. N. Amaral, e-print cond-mat/ A. Barrat, M. Barthélemy, and A. Vespignani, Proc. Natl. Acad. Sci. U.S.A. 101, L. R. Ford and D. R. Fulkerson, Flos in Netorks Princeton University Press, Princeton, NJ, R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Netork Flos: Theory, Algorithms, and Applications Prentice Hall, Engleood Cliffs, NJ, P. G. Doyle and J. L. Snell, Random Walks and Electric Netorks Math. Assoc. Amer., Washington, D.C., L. de Arcangelis, S. Redner, and A. Coniglio, Phys. Rev. B 31, ; 34, R. Rammal, C. Tannous, P. Breton, and A.-M. S. Tremblay, Phys. Rev. Lett. 54, M. E. J. Neman, e-print cond-mat/ E. Almaas, P. L. Krapivsky, and S. Redner, e-print cond-mat/ S. H. Yook, H. Jeong, A.-L. Barabási, and Y. Tu, Phys. Rev. Lett. 86, J. D. Noh and H. Rieger, Phys. Rev. E 66, D. Zheng, S. Trimper, B. Zheng, and P. M. Hui, Phys. Rev. E 67, R P. J. Macdonald, E. Almaas, and A.-L. Barabási, e-print condmat/ A. Barrat, M. Barthélemy, and A. Vespignani, Phys. Rev. Lett. 92, ; Phys. Rev. E 70, Negative eights are occasionally appropriate, e.g., they can represent animosity beteen individuals in a social netork. 24 The analyticity of the node eight distribution n breaks don at integer values as is obvious from Eq. 4. Differentiating Eq. 4, one can express F k 1 via F, F 1,,F k+1. Since F is continuous but not differentiable at =1, the cumulative distribution is continuously differentiable k 1 times at =k implying that the eight distribution is continuously differentiable k 2 times. 25 N is a discrete variable and N N are random variables. Treating N as a continuous variable and N N as the average values of the corresponding random variables is asymptotically exact hen the eight is sufficiently small; see, e.g., P. L. Krapivsky and S. Redner, J. Phys. A 35, for the detailed analysis of these issues in the model here groth is governed by preferential attachment. 26 For integer 4, the th term in expansion 11 acquires a logarithmic correction; for =3, even the leading-order term has a logarithmic correction n 3 ln. 27 The expected value for the sum of k independent identically distributed random variables taken from the exponential distribution is =k; in the present case, the average eight of the node of large degree is slightly higher since the groth is eight-driven. 28 P. L. Krapivsky and S. Redner, Phys. Rev. E 63, P. L. Krapivsky, G. J. Rodgers, and S. Redner, Phys. Rev. Lett. 86,
Statistics of weighted treelike networks
Statistics of weighted treelike networks E. Almaas, 1, * P. L. Krapivsky, 2, and S. Redner 2, 1 Center for Network Research and Department of Physics, University of Notre Dame, Notre Dame, Indiana 46617,
More informationDeterministic scale-free networks
Physica A 299 (2001) 559 564 www.elsevier.com/locate/physa Deterministic scale-free networks Albert-Laszlo Barabasi a;, Erzsebet Ravasz a, Tamas Vicsek b a Department of Physics, College of Science, University
More informationarxiv:cond-mat/ v1 [cond-mat.dis-nn] 4 May 2000
Topology of evolving networks: local events and universality arxiv:cond-mat/0005085v1 [cond-mat.dis-nn] 4 May 2000 Réka Albert and Albert-László Barabási Department of Physics, University of Notre-Dame,
More informationSelf-organized scale-free networks
Self-organized scale-free networks Kwangho Park and Ying-Cheng Lai Departments of Electrical Engineering, Arizona State University, Tempe, Arizona 85287, USA Nong Ye Department of Industrial Engineering,
More informationEvolving network with different edges
Evolving network with different edges Jie Sun, 1,2 Yizhi Ge, 1,3 and Sheng Li 1, * 1 Department of Physics, Shanghai Jiao Tong University, Shanghai, China 2 Department of Mathematics and Computer Science,
More informationarxiv:cond-mat/ v1 [cond-mat.dis-nn] 24 Mar 2005
APS/123-QED Scale-Free Networks Emerging from Weighted Random Graphs Tomer Kalisky, 1, Sameet Sreenivasan, 2 Lidia A. Braunstein, 2,3 arxiv:cond-mat/0503598v1 [cond-mat.dis-nn] 24 Mar 2005 Sergey V. Buldyrev,
More informationNumerical evaluation of the upper critical dimension of percolation in scale-free networks
umerical evaluation of the upper critical dimension of percolation in scale-free networks Zhenhua Wu, 1 Cecilia Lagorio, 2 Lidia A. Braunstein, 1,2 Reuven Cohen, 3 Shlomo Havlin, 3 and H. Eugene Stanley
More informationMutual selection model for weighted networks
Mutual selection model for weighted networks Wen-Xu Wang, Bo Hu, Tao Zhou, Bing-Hong Wang,* and Yan-Bo Xie Nonlinear Science Center and Department of Modern Physics, University of Science and Technology
More informationStability and topology of scale-free networks under attack and defense strategies
Stability and topology of scale-free networks under attack and defense strategies Lazaros K. Gallos, Reuven Cohen 2, Panos Argyrakis, Armin Bunde 3, and Shlomo Havlin 2 Department of Physics, University
More informationINTRODUCTION TO MATHEMATICAL MODELLING LECTURES 6-7: MODELLING WEALTH DISTRIBUTION
January 004 INTRODUCTION TO MATHEMATICAL MODELLING LECTURES 6-7: MODELLING WEALTH DISTRIBUTION Project in Geometry and Physics, Department of Mathematics University of California/San Diego, La Jolla, CA
More informationCompetition and multiscaling in evolving networks
EUROPHYSICS LETTERS 5 May 2 Europhys. Lett., 54 (4), pp. 436 442 (2) Competition and multiscaling in evolving networs G. Bianconi and A.-L. Barabási,2 Department of Physics, University of Notre Dame -
More informationTowards a Theory of Societal Co-Evolution: Individualism versus Collectivism
Toards a Theory of Societal Co-Evolution: Individualism versus Collectivism Kartik Ahuja, Simpson Zhang and Mihaela van der Schaar Department of Electrical Engineering, Department of Economics, UCLA Theorem
More informationNetwork growth by copying
PHYSICAL REVIEW E 71, 036118 2005 etwork growth by copying P. L. Krapivsky 1, * and S. Redner 2, 1 Center for Polymer Studies and Department of Physics, Boston University, Boston, Massachusetts 02215,
More informationShlomo Havlin } Anomalous Transport in Scale-free Networks, López, et al,prl (2005) Bar-Ilan University. Reuven Cohen Tomer Kalisky Shay Carmi
Anomalous Transport in Complex Networs Reuven Cohen Tomer Kalisy Shay Carmi Edoardo Lopez Gene Stanley Shlomo Havlin } } Bar-Ilan University Boston University Anomalous Transport in Scale-free Networs,
More informationMinimum spanning trees of weighted scale-free networks
EUROPHYSICS LETTERS 15 October 2005 Europhys. Lett., 72 (2), pp. 308 314 (2005) DOI: 10.1209/epl/i2005-10232-x Minimum spanning trees of weighted scale-free networks P. J. Macdonald, E. Almaas and A.-L.
More informationAn evolving network model with community structure
INSTITUTE OF PHYSICS PUBLISHING JOURNAL OF PHYSICS A: MATHEMATICAL AND GENERAL J. Phys. A: Math. Gen. 38 (2005) 9741 9749 doi:10.1088/0305-4470/38/45/002 An evolving network model with community structure
More informationBetweenness centrality of fractal and nonfractal scale-free model networks and tests on real networks
Betweenness centrality of fractal and nonfractal scale-free model networks and tests on real networks Maksim Kitsak, 1 Shlomo Havlin, 1,2 Gerald Paul, 1 Massimo Riccaboni, 3 Fabio Pammolli, 1,3,4 and H.
More informationarxiv: v1 [physics.soc-ph] 15 Dec 2009
Power laws of the in-degree and out-degree distributions of complex networks arxiv:0912.2793v1 [physics.soc-ph] 15 Dec 2009 Shinji Tanimoto Department of Mathematics, Kochi Joshi University, Kochi 780-8515,
More informationErzsébet Ravasz Advisor: Albert-László Barabási
Hierarchical Networks Erzsébet Ravasz Advisor: Albert-László Barabási Introduction to networks How to model complex networks? Clustering and hierarchy Hierarchical organization of cellular metabolism The
More informationy(x) = x w + ε(x), (1)
Linear regression We are ready to consider our first machine-learning problem: linear regression. Suppose that e are interested in the values of a function y(x): R d R, here x is a d-dimensional vector-valued
More informationSmall-world structure of earthquake network
Small-world structure of earthquake network Sumiyoshi Abe 1 and Norikazu Suzuki 2 1 Institute of Physics, University of Tsukuba, Ibaraki 305-8571, Japan 2 College of Science and Technology, Nihon University,
More informationUniversal dependence of distances on nodes degrees in complex networks
Universal dependence of distances on nodes degrees in complex networs Janusz A. Hołyst, Julian Sieniewicz, Agata Froncza, Piotr Froncza, Krzysztof Sucheci and Piotr Wójcici Faculty of Physics and Center
More informationarxiv:cond-mat/ v1 12 Oct 2004
First Passage Properties of the Erdős-Renyi Random Graph V. Sood and S. Redner Theory Division and Center for Nonlinear Studies, Los Alamos National Laboratory, Los Alamos, New Mexico 87545 D. ben-avraham
More informationarxiv:cond-mat/ v2 [cond-mat.stat-mech] 3 Oct 2005
Growing Directed Networks: Organization and Dynamics arxiv:cond-mat/0408391v2 [cond-mat.stat-mech] 3 Oct 2005 Baosheng Yuan, 1 Kan Chen, 1 and Bing-Hong Wang 1,2 1 Department of Computational cience, Faculty
More information6.207/14.15: Networks Lecture 12: Generalized Random Graphs
6.207/14.15: Networks Lecture 12: Generalized Random Graphs 1 Outline Small-world model Growing random networks Power-law degree distributions: Rich-Get-Richer effects Models: Uniform attachment model
More informationUC Berkeley Department of Electrical Engineering and Computer Sciences. EECS 126: Probability and Random Processes
UC Berkeley Department of Electrical Engineering and Computer Sciences EECS 26: Probability and Random Processes Problem Set Spring 209 Self-Graded Scores Due:.59 PM, Monday, February 4, 209 Submit your
More informationarxiv:physics/ v1 [physics.soc-ph] 14 Dec 2006
Europhysics Letters PREPRINT Growing network with j-redirection arxiv:physics/0612148v1 [physics.soc-ph] 14 Dec 2006 R. Lambiotte 1 and M. Ausloos 1 1 SUPRATECS, Université de Liège, B5 Sart-Tilman, B-4000
More informationCHAPTER 3 THE COMMON FACTOR MODEL IN THE POPULATION. From Exploratory Factor Analysis Ledyard R Tucker and Robert C. MacCallum
CHAPTER 3 THE COMMON FACTOR MODEL IN THE POPULATION From Exploratory Factor Analysis Ledyard R Tucker and Robert C. MacCallum 1997 19 CHAPTER 3 THE COMMON FACTOR MODEL IN THE POPULATION 3.0. Introduction
More informationAging and scaling of aftershocks
Aging and scaling of aftershocks Sumiyoshi Abe 1 and Norikazu Suzuki 2 1 Institute of Physics, University of Tsukuba, Ibaraki 305-8571, Japan 2 College of Science and Technology, Nihon University, Chiba
More informationEvolution of a social network: The role of cultural diversity
PHYSICAL REVIEW E 73, 016135 2006 Evolution of a social network: The role of cultural diversity A. Grabowski 1, * and R. A. Kosiński 1,2, 1 Central Institute for Labour Protection National Research Institute,
More informationarxiv:cond-mat/ v2 6 Aug 2002
Percolation in Directed Scale-Free Networs N. Schwartz, R. Cohen, D. ben-avraham, A.-L. Barabási and S. Havlin Minerva Center and Department of Physics, Bar-Ilan University, Ramat-Gan, Israel Department
More informationarxiv:physics/ v1 9 Jun 2006
Weighted Networ of Chinese Nature Science Basic Research Jian-Guo Liu, Zhao-Guo Xuan, Yan-Zhong Dang, Qiang Guo 2, and Zhong-Tuo Wang Institute of System Engineering, Dalian University of Technology, Dalian
More informationAbsence of depletion zone effects for the trapping reaction in complex networks
Absence of depletion zone effects for the trapping reaction in complex networks Aristotelis Kittas* and Panos Argyrakis Department of Physics, Aristotle University of Thessaloniki, 54124 Thessaloniki,
More informationFractal dimensions ofpercolating networks
Available online at www.sciencedirect.com Physica A 336 (2004) 6 13 www.elsevier.com/locate/physa Fractal dimensions ofpercolating networks Reuven Cohen a;b;, Shlomo Havlin b a Department of Computer Science
More informationCOS 511: Theoretical Machine Learning. Lecturer: Rob Schapire Lecture # 12 Scribe: Indraneel Mukherjee March 12, 2008
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture # 12 Scribe: Indraneel Mukherjee March 12, 2008 In the previous lecture, e ere introduced to the SVM algorithm and its basic motivation
More informationarxiv:cond-mat/ v1 28 Feb 2005
How to calculate the main characteristics of random uncorrelated networks Agata Fronczak, Piotr Fronczak and Janusz A. Hołyst arxiv:cond-mat/0502663 v1 28 Feb 2005 Faculty of Physics and Center of Excellence
More informationEötvös Loránd University, Budapest. 13 May 2005
A NEW CLASS OF SCALE FREE RANDOM GRAPHS Zsolt Katona and Tamás F Móri Eötvös Loránd University, Budapest 13 May 005 Consider the following modification of the Barabási Albert random graph At every step
More informationarxiv:physics/ v2 [physics.soc-ph] 9 Feb 2007
Europhysics Letters PREPRINT Growing network with j-redirection arxiv:physics/0612148v2 [physics.soc-ph] 9 Feb 2007 R. Lambiotte 1 and M. Ausloos 1 1 GRAPES, Université de Liège, B5 Sart-Tilman, B-4000
More informationArtificial Neural Networks. Part 2
Artificial Neural Netorks Part Artificial Neuron Model Folloing simplified model of real neurons is also knon as a Threshold Logic Unit x McCullouch-Pitts neuron (943) x x n n Body of neuron f out Biological
More informationarxiv: v3 [physics.soc-ph] 9 May 2014
arxiv:1309.5680v3 [physics.soc-ph] 9 May 2014 Modeling nonuniversal citation distributions: the role of scientific journals Zheng Yao 1, Xiao-Long Peng 1, Li-Jie Zhang 3,2 and Xin-Jian Xu 1,2 1 Department
More informationOn Resolution Limit of the Modularity in Community Detection
The Ninth International Symposium on Operations Research and Its Applications (ISORA 10) Chengdu-Jiuzhaigou, China, August 19 23, 2010 Copyright 2010 ORSC & APORC, pp. 492 499 On Resolution imit of the
More informationA Generalization of a result of Catlin: 2-factors in line graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 72(2) (2018), Pages 164 184 A Generalization of a result of Catlin: 2-factors in line graphs Ronald J. Gould Emory University Atlanta, Georgia U.S.A. rg@mathcs.emory.edu
More informationThe Critical Point of k-clique Percolation in the Erd ós Rényi Graph
Journal of Statistical Physics, Vol. 128, Nos. 1/2, July 2007 ( C 2007 ) DOI: 10.1007/s10955-006-9184-x The Critical Point of k-clique Percolation in the Erd ós Rényi Graph Gergely Palla, 1,2 Imre Derényi
More informationAdventures in random graphs: Models, structures and algorithms
BCAM January 2011 1 Adventures in random graphs: Models, structures and algorithms Armand M. Makowski ECE & ISR/HyNet University of Maryland at College Park armand@isr.umd.edu BCAM January 2011 2 Complex
More informationLong run input use-input price relations and the cost function Hessian. Ian Steedman Manchester Metropolitan University
Long run input use-input price relations and the cost function Hessian Ian Steedman Manchester Metropolitan University Abstract By definition, to compare alternative long run equilibria is to compare alternative
More informationNetworks as a tool for Complex systems
Complex Networs Networ is a structure of N nodes and 2M lins (or M edges) Called also graph in Mathematics Many examples of networs Internet: nodes represent computers lins the connecting cables Social
More informationRing structures and mean first passage time in networks
PHYSICAL REVIEW E 73, 026103 2006 Ring structures and mean first passage time in networks Andrea Baronchelli and Vittorio Loreto INFM and Dipartimento di Fisica, Università di Roma La Sapienza and INFM
More informationRate Equation Approach to Growing Networks
Rate Equation Approach to Growing Networks Sidney Redner, Boston University Motivation: Citation distribution Basic Model for Citations: Barabási-Albert network Rate Equation Analysis: Degree and related
More informationRandomized Smoothing Networks
Randomized Smoothing Netorks Maurice Herlihy Computer Science Dept., Bron University, Providence, RI, USA Srikanta Tirthapura Dept. of Electrical and Computer Engg., Ioa State University, Ames, IA, USA
More informationarxiv:physics/ v1 [physics.soc-ph] 11 Mar 2005
arxiv:physics/0503099v1 [physics.soc-ph] 11 Mar 2005 Public transport systems in Poland: from Bia lystok to Zielona Góra by bus and tram using universal statistics of complex networks Julian Sienkiewicz
More informationCS224W: Analysis of Networks Jure Leskovec, Stanford University
CS224W: Analysis of Networks Jure Leskovec, Stanford University http://cs224w.stanford.edu 10/30/17 Jure Leskovec, Stanford CS224W: Social and Information Network Analysis, http://cs224w.stanford.edu 2
More informationarxiv:cond-mat/ v1 [cond-mat.stat-mech] 4 Apr 2006
Exact solutions for models of evolving networks with addition and deletion of nodes arxiv:cond-mat/6469v [cond-mat.stat-mech] 4 Apr 26 Cristopher Moore,,2, 3 Gourab Ghoshal, 4, 5 and M. E. J. Newman 3,
More informationSpatial and Temporal Behaviors in a Modified Evolution Model Based on Small World Network
Commun. Theor. Phys. (Beijing, China) 42 (2004) pp. 242 246 c International Academic Publishers Vol. 42, No. 2, August 15, 2004 Spatial and Temporal Behaviors in a Modified Evolution Model Based on Small
More informationGrowing a Network on a Given Substrate
Growing a Network on a Given Substrate 1 Babak Fotouhi and Michael G. Rabbat Department of Electrical and Computer Engineering McGill University, Montréal, Québec, Canada Email: babak.fotouhi@mail.mcgill.ca,
More informationLecture VI Introduction to complex networks. Santo Fortunato
Lecture VI Introduction to complex networks Santo Fortunato Plan of the course I. Networks: definitions, characteristics, basic concepts in graph theory II. III. IV. Real world networks: basic properties
More informationComparative analysis of transport communication networks and q-type statistics
Comparative analysis of transport communication networs and -type statistics B. R. Gadjiev and T. B. Progulova International University for Nature, Society and Man, 9 Universitetsaya Street, 498 Dubna,
More informationMinimize Cost of Materials
Question 1: Ho do you find the optimal dimensions of a product? The size and shape of a product influences its functionality as ell as the cost to construct the product. If the dimensions of a product
More informationUniversality of Competitive Networks in Complex Networks
J Syst Sci Complex (2015) 28: 546 558 Universality of Competitive Networks in Complex Networks GUO Jinli FAN Chao JI Yali DOI: 10.1007/s11424-015-3045-0 Received: 27 February 2013 / Revised: 18 December
More informationEnhancing Generalization Capability of SVM Classifiers with Feature Weight Adjustment
Enhancing Generalization Capability of SVM Classifiers ith Feature Weight Adjustment Xizhao Wang and Qiang He College of Mathematics and Computer Science, Hebei University, Baoding 07002, Hebei, China
More informationBivariate Uniqueness in the Logistic Recursive Distributional Equation
Bivariate Uniqueness in the Logistic Recursive Distributional Equation Antar Bandyopadhyay Technical Report # 629 University of California Department of Statistics 367 Evans Hall # 3860 Berkeley CA 94720-3860
More informationarxiv:physics/ v3 [physics.soc-ph] 21 Nov 2005
Correlations in Bipartite Collaboration Networs Matti Peltomäi and Mio Alava Laboratory of Physics, Helsini University of Technology, P.O.Box, 0205 HUT, Finland (Dated: September 7, 208 arxiv:physics/0508027v3
More informationSpectra of adjacency matrices of random geometric graphs
Spectra of adjacency matrices of random geometric graphs Paul Blackwell, Mark Edmondson-Jones and Jonathan Jordan University of Sheffield 22nd December 2006 Abstract We investigate the spectral properties
More informationScale-free network of earthquakes
Scale-free network of earthquakes Sumiyoshi Abe 1 and Norikazu Suzuki 2 1 Institute of Physics, University of Tsukuba, Ibaraki 305-8571, Japan 2 College of Science and Technology, Nihon University, Chiba
More informationk-protected VERTICES IN BINARY SEARCH TREES
k-protected VERTICES IN BINARY SEARCH TREES MIKLÓS BÓNA Abstract. We show that for every k, the probability that a randomly selected vertex of a random binary search tree on n nodes is at distance k from
More informationREPRESENTATIONS FOR A SPECIAL SEQUENCE
REPRESENTATIONS FOR A SPECIAL SEQUENCE L. CARLITZ* RICHARD SCOVILLE Dyke University, Durham,!\!orth Carolina VERNERE.HOGGATTJR. San Jose State University, San Jose, California Consider the sequence defined
More informationCh. 2 Math Preliminaries for Lossless Compression. Section 2.4 Coding
Ch. 2 Math Preliminaries for Lossless Compression Section 2.4 Coding Some General Considerations Definition: An Instantaneous Code maps each symbol into a codeord Notation: a i φ (a i ) Ex. : a 0 For Ex.
More informationCS224W: Social and Information Network Analysis
CS224W: Social and Information Network Analysis Reaction Paper Adithya Rao, Gautam Kumar Parai, Sandeep Sripada Keywords: Self-similar networks, fractality, scale invariance, modularity, Kronecker graphs.
More information1 Mechanistic and generative models of network structure
1 Mechanistic and generative models of network structure There are many models of network structure, and these largely can be divided into two classes: mechanistic models and generative or probabilistic
More informationN-bit Parity Neural Networks with minimum number of threshold neurons
Open Eng. 2016; 6:309 313 Research Article Open Access Marat Z. Arslanov*, Zhazira E. Amirgalieva, and Chingiz A. Kenshimov N-bit Parity Neural Netorks ith minimum number of threshold neurons DOI 10.1515/eng-2016-0037
More informationSocial Networks- Stanley Milgram (1967)
Complex Networs Networ is a structure of N nodes and 2M lins (or M edges) Called also graph in Mathematics Many examples of networs Internet: nodes represent computers lins the connecting cables Social
More informationOscillations of complex networks
Oscillations of complex networks Xingang Wang, 1,2,3 Ying-Cheng Lai, 4 and Choy Heng Lai 1,2 1 Department of Physics, National University of Singapore, 117542, Singapore 2 Beijing-Hong Kong-Singapore Joint
More informationCluster Distribution in Mean-Field Percolation: Scaling and. Universality arxiv:cond-mat/ v1 [cond-mat.stat-mech] 6 Jun 1997.
Cluster Distribution in Mean-Field Percolation: Scaling and Universality arxiv:cond-mat/9706064v1 [cond-mat.stat-mech] 6 Jun 1997 Joseph Rudnick and Paisan Nakmahachalasint Department of Physics, UCLA,
More informationHerd Behavior and Phase Transition in Financial Market
Herd Behavior and Phase Transition in Financial Market Minghao Guo December 13, 2009 Abstract In this paper, I brief reviewed the herd behavior in financial market. Benerjee model and EZ model are introduced.
More informationEffciency of Local Majority-Rule Dynamics on Scale-Free Networks
AAPPS Bulletin June 2006 11 Effciency of Local Majority-Rule Dynamics on Scale-Free Networks Haijun Zhou Dynamic processes occurring on a network may be greatly influenced by the particular structure and
More informationLecture 3a: The Origin of Variational Bayes
CSC535: 013 Advanced Machine Learning Lecture 3a: The Origin of Variational Bayes Geoffrey Hinton The origin of variational Bayes In variational Bayes, e approximate the true posterior across parameters
More informationarxiv: v2 [cond-mat.stat-mech] 24 Nov 2009
Construction and Analysis of Random Networks with Explosive Percolation APS/123-QED Eric J. Friedman 1 and Adam S. Landsberg 2 1 School of ORIE and Center for Applied Mathematics, Cornell University, Ithaca,
More informationEpidemic dynamics and endemic states in complex networks
PHYSICAL REVIEW E, VOLUME 63, 066117 Epidemic dynamics and endemic states in complex networks Romualdo Pastor-Satorras 1 and Alessandro Vespignani 2 1 Departmento de Física i Enginyeria Nuclear, Universitat
More informationFrom time series to superstatistics
From time series to superstatistics Christian Beck School of Mathematical Sciences, Queen Mary, University of London, Mile End Road, London E 4NS, United Kingdom Ezechiel G. D. Cohen The Rockefeller University,
More informationEVOLUTION OF COMPLEX FOOD WEB STRUCTURE BASED ON MASS EXTINCTION
EVOLUTION OF COMPLEX FOOD WEB STRUCTURE BASED ON MASS EXTINCTION Kenichi Nakazato Nagoya University Graduate School of Human Informatics nakazato@create.human.nagoya-u.ac.jp Takaya Arita Nagoya University
More informationMini course on Complex Networks
Mini course on Complex Networks Massimo Ostilli 1 1 UFSC, Florianopolis, Brazil September 2017 Dep. de Fisica Organization of The Mini Course Day 1: Basic Topology of Equilibrium Networks Day 2: Percolation
More informationEnumeration of spanning trees in a pseudofractal scale-free web. and Shuigeng Zhou
epl draft Enumeration of spanning trees in a pseudofractal scale-free web Zhongzhi Zhang 1,2 (a), Hongxiao Liu 1,2, Bin Wu 1,2 1,2 (b) and Shuigeng Zhou 1 School of Computer Science, Fudan University,
More informationWeighted networks of scientific communication: the measurement and topological role of weight
Physica A 350 (2005) 643 656 www.elsevier.com/locate/physa Weighted networks of scientific communication: the measurement and topological role of weight Menghui Li a, Ying Fan a, Jiawei Chen a, Liang Gao
More informationExplosive percolation in graphs
Home Search Collections Journals About Contact us My IOPscience Explosive percolation in graphs This article has been downloaded from IOPscience. Please scroll down to see the full text article. 2011 J.
More informationShannon Entropy and Degree Correlations in Complex Networks
Shannon Entropy and Degree Correlations in Complex etworks SAMUEL JOHSO, JOAQUÍ J. TORRES, J. MARRO, and MIGUEL A. MUÑOZ Instituto Carlos I de Física Teórica y Computacional, Departamento de Electromagnetismo
More informationLecture 10. Under Attack!
Lecture 10 Under Attack! Science of Complex Systems Tuesday Wednesday Thursday 11.15 am 12.15 pm 11.15 am 12.15 pm Feb. 26 Feb. 27 Feb. 28 Mar.4 Mar.5 Mar.6 Mar.11 Mar.12 Mar.13 Mar.18 Mar.19 Mar.20 Mar.25
More informationNetworks: Lectures 9 & 10 Random graphs
Networks: Lectures 9 & 10 Random graphs Heather A Harrington Mathematical Institute University of Oxford HT 2017 What you re in for Week 1: Introduction and basic concepts Week 2: Small worlds Week 3:
More informationModeling Dynamic Evolution of Online Friendship Network
Commun. Theor. Phys. 58 (2012) 599 603 Vol. 58, No. 4, October 15, 2012 Modeling Dynamic Evolution of Online Friendship Network WU Lian-Ren ( ) 1,2, and YAN Qiang ( Ö) 1 1 School of Economics and Management,
More informationScale-free random graphs and Potts model
PRAMAA c Indian Academy of Sciences Vol. 64, o. 6 journal of June 25 physics pp. 49 59 D-S LEE,2, -I GOH, B AHG and D IM School of Physics and Center for Theoretical Physics, Seoul ational University,
More informationComplex Systems. Shlomo Havlin. Content:
Complex Systems Content: Shlomo Havlin 1. Fractals: Fractals in Nature, mathematical fractals, selfsimilarity, scaling laws, relation to chaos, multifractals. 2. Percolation: phase transition, critical
More informationarxiv:cond-mat/ v1 2 Jan 2003
Topology of the World Trade Web M a Ángeles Serrano and Marián Boguñá Departament de Física Fonamental, Universitat de Barcelona, Av. Diagonal 647, 08028 Barcelona, Spain (Dated: July 9, 2004) arxiv:cond-mat/0301015
More informationHyperbolic metric spaces and their applications to large complex real world networks II
Hyperbolic metric spaces Hyperbolic metric spaces and their applications to large complex real world networks II Gabriel H. Tucci Bell Laboratories Alcatel-Lucent May 17, 2010 Tucci Hyperbolic metric spaces
More informationGroup-invariant solutions of nonlinear elastodynamic problems of plates and shells *
Group-invariant solutions of nonlinear elastodynamic problems of plates and shells * V. A. Dzhupanov, V. M. Vassilev, P. A. Dzhondzhorov Institute of mechanics, Bulgarian Academy of Sciences, Acad. G.
More informationAlgebra II Solutions
202 High School Math Contest 6 Algebra II Eam 2 Lenoir-Rhyne University Donald and Helen Schort School of Mathematics and Computing Sciences Algebra II Solutions This eam has been prepared by the folloing
More informationDirected Scale-Free Graphs
Directed Scale-Free Graphs Béla Bollobás Christian Borgs Jennifer Chayes Oliver Riordan Abstract We introduce a model for directed scale-free graphs that grow with preferential attachment depending in
More informationarxiv:physics/ v2 [physics.soc-ph] 19 Feb 2007
Betweenness Centrality of Fractal and Non-Fractal Scale-Free Model Networks and Tests on Real Networks Maksim Kitsak, 1 Shlomo Havlin, 1,2 Gerald Paul, 1 Massimo arxiv:physics/0702001v2 [physics.soc-ph]
More informationBusiness Cycles: The Classical Approach
San Francisco State University ECON 302 Business Cycles: The Classical Approach Introduction Michael Bar Recall from the introduction that the output per capita in the U.S. is groing steady, but there
More informationChapter 11 - Sequences and Series
Calculus and Analytic Geometry II Chapter - Sequences and Series. Sequences Definition. A sequence is a list of numbers written in a definite order, We call a n the general term of the sequence. {a, a
More informationarxiv:cond-mat/ v1 [cond-mat.stat-mech] 24 Mar 2007
Addition-Deletion Networks arxiv:cond-mat/0703636v1 [cond-mat.stat-mech] 24 Mar 2007 E. Ben-Naim 1, and P. L. Krapivsky 2, 1 Theoretical Division and Center for Nonlinear Studies, Los Alamos National Laboratory,
More informationReliability and Efficiency of Generalized Rumor Spreading Model on Complex Social Networks
Commun. Theor. Phys. 60 (2013) 139 144 Vol. 60, No. 1, July 15, 2013 Reliability and Efficiency of Generalized Rumor Spreading Model on Complex Social Networks Yaghoob Naimi 1, and Mohammad Naimi 2 1 Department
More informationLogic Effort Revisited
Logic Effort Revisited Mark This note ill take another look at logical effort, first revieing the asic idea ehind logical effort, and then looking at some of the more sutle issues in sizing transistors..0
More information