Spherical model on a spider-web graph

Non-perturbative corrections to mean-field critical behavior: Spherical model on a spider-web graph

Ajit C Balram, Deepak Dhar Department of Physics, Indian Institute of Science Education and Research,
Sai Trinity Building, Garware Circle, Sutarwadi, Pashan, Pune 411 021, India
Department of Theoretical Physics, Tata Institute of Fundamental Research,
1 Homi Bhabha Road, Mumbai 400 005, India
ddhar@theory.tifr.res.in
Abstract

We consider the spherical model on a spider-web graph. This graph is effectively infinite-dimensional, similar to the Bethe lattice, but has loops. We show that these lead to non-trivial corrections to the simple mean-field behavior. We first determine all normal modes of the coupled springs problem on this graph, using its large symmetry group. In the thermodynamic limit, the spectrum is a set of -functions, and all the modes are localized. The fractional number of modes with frequency less than varies as for tending to zero, where is a constant. For an unbiased random walk on the vertices of this graph, this implies that the probability of return to the origin at time varies as , for large , where is a constant. For the spherical model, we show that while the critical exponents take the values expected from the mean-field theory, the free-energy per site at temperature , near and above the critical temperature , also has an essential singularity of the type .

pacs:
63.70.+h,05.50.+q,05.40.Fb
: J. Phys. A: Math. Gen.

1 Introduction

It is well-known that in systems having dimension greater than the upper critical dimension , fluctuations in thermal equilibrium near critical phase transitions are well described by the mean-field theory [1]. For simple Ising-like spin models, the value of upper critical dimension is known to be . In this paper, we give an example of a lattice, whose effective dimension is infinite, and the exact solution of the spherical model on the lattice shows that while the critical exponents are correctly given by the mean-field theory, (e.g. the specific heat has a discontinuity), the free-energy near the transition also shows an essential singularity, with the singular part varying as , for temperatures near and greater than the critical temperature . While it is known that higher derivatives of the free energy do show logarithmic singularities in the spherical model for even dimensions [2], this seems to be the first case where an essential singularity is encountered in the sub-leading singular part of the free energy in an infinite dimensional model.

The lattice we study is the spider-web lattice, also known as spider-web graph or the spider-web network in literature. These graphs were introduced by Ikeno in 1959, for efficient design of crossbar exchanges for telephone switching networks [3]. The name spider-webs to describe them seems to have been first used by Feiner and Kappel in 1970 [4]. With the advent of digital switching and mobile communication networks, crossbar exchanges have become obsolete, and their optimal design is no longer of technological interest. But the spider-web graphs are very interesting structures for statistical physics.

A - node spider network graph consists of -levels each of which has vertices. Each vertex in the -th level is connected to two vertices each in the th levels. These are finite graphs where all vertices are equivalent. In the thermodynamic limit when the number of vertices in the graph tends to infinity, the number of sites within a distance of a given site increases exponentially with , and the effective dimension of these graphs is infinite. These are thus similar to the Bethe lattice, which has been studied a lot in statistical physics. However, for the Bethe lattice, realized as the limit of tree graphs, separating the bulk properties from the surface properties requires care as most of its sites are near the surface. One can realize a Bethe lattice without surface effects as the limit of a random graph with uniform coordination number, but this involves averaging over disorder, which may be quenched [5], or annealed [6]. Spider-web graphs avoid the difficulties associated with such averagings. They also have additional symmetries, in addition to translational invariance, which makes the study of statistical physics models on these graphs analytically more tractable.

Given its origins, it is not surprising that most of the earlier studies dealt with the percolation properties of these networks [3]. Takagi [7] showed that in a certain class of graphs, the spider-web network has the highest linking probability. But, Chung and Hwang [8] showed that, outside this class, there are other graphs that are better. For subsequent work on the percolation properties on these networks, see [9, 10, 11, 12]. Other models on these graphs have not been studied much so far. There is large amount work dealing with spectra of different graphs. Some basic references may be found in [13].

In this paper, we study the spherical model on the spider-web graph. We start by determining the normal modes of vibration of masses coupled by nearest -neighbor harmonic springs on this network. We obtain the entire spectrum for finite values of and , and also describe the qualitative features of the spectrum in the thermodynamic limit of , with finite. In the double limit of both , almost all the eigenmodes of the springs problem are localized on this network. We study the return to origin for the related problem of a random walker on this network. We show that the probability that a random walker returns to origin after steps varies as . This should be compared with a power-law decay on -dimensional hypercubic lattices, and an exponential decay on the Bethe lattice. We use the knowledge of normal modes of the springs model on this lattice to determine the critical behavior of the spherical model on this graph, and show that the free energy shows an essential singularity at the transition point.

The plan of this paper is as follows. In section II, we define spider-web graphs, and then define the springs Hamiltonian, the random walk problem and the spherical model on these graphs. In section III, we discuss the decomposition of the Hilbert space of the displacement field in the springs problem into subspaces, called sectors, using the symmetries of the spider-web graphs. In Section IV, we determine the frequencies of all the normal modes of the springs Hamiltonian, and also determine the eigenmodes. In Section V, we use this spectrum to determine the exact generating function for returns to origin of a walker doing a random walk on the vertices of the spider web graph. In section VI, we show that the singular nature of density of states of the springs model for small frequencies implies that free energy of the spherical model shows a discontinuity in specific heat, as expected from the standard mean-field theory, but also an essential singularity.

2 Definition of the model

A spider-web network is a graph consisting of vertices, divided into levels, each level with vertices, with and being positive integers. We label the levels by integers to , and vertices within a level are labeled by -digit integers , base , with . In the following we discuss only the case . Generalization to other values of is straight-forward.

On a binary string of length , we define an operation of adding a zero from the right, making space for it by shifting all bits by one space to the left. The left-most (first) bit of the original string is lost. So, for example, for , action of on the binary string yields a string , and we write . The operator adds a to the right. We similarly define operators and , which correspond to adding and respectively at the left end, and shifting the bits one space to the right. In this case, the rightmost bit is lost. Clearly, , and . Also, and .

Now consider a vertex labeled by a binary integer in the level . We denote this vertex by . The spider-web graph is defined by connecting this vertex to the two vertices and in the level . We assume periodic boundary conditions, and the vertices in the level are connected to level . It is convenient to assume that the index is defined only modulo , so that is the same as . We will take these connecting edges to be undirected. Then, each vertex is also connected to the vertices and . We will assume that , as otherwise the graph is not fully connected. Fig. 1 shows a graph with .

Given this structure of connections, it is easy to see that there is unique directed path of length from any vertex to any of the vertices in the level . If the binary label of the target vertex is , one just starts at the vertex , and takes steps to the next level using edges corresponding to respectively.

In the context of crossbar exchanges, we think of each node of the graph as crossbar, with two input lines, and two output lines. It is natural to work with open boundary conditions, with no direct connections between level and level . Then there are input lines coming into level , and there is an equal number of lines coming out of level . The total numer of crosspoints used is per vertex of graph. Then, using only levels, we can connect any of input lines into the level , we can connect to any of the lines of the crossbars in the level . Also, there is a simple algorithm to determine the path from the input node to the output node. This is much less than the number , which would have been required, if a single stage crossbar was used. If , we get multiple possible paths from the input to output. This was the original reason for interest in these networks.

For studies in statistical physics, one is usually interested in the thermodynamical limit, where the effect of boundaries can be ignored. We note that here, local properties of the network do not depend on or , for distances up to . For example, the number of sites that are within a distance of any site is the same for all sites, and is independent of and , so long as . Thus, for systems with interactions of finite range, say for a nearest-neighbor Ising model defined on this graph, the thermodynamical limit will be well-defined. As another example, if there is a random walker that moves on the vertices of this graph, taking a step at random along one of the four edges at the current position, the probability of return to starting point after steps is well defined, and independent of and , so long as .

We consider a unit mass attached to each vertex of the spider-web network, coupled to its four neighbors by harmonic springs of unit spring constant. We denote a scalar variable for each vertex of the graph. Let the corresponding momentum variable be denoted by . Then, the classical -mechanical springs Hamiltonian is given by

(1)

where is the matrix of coupling constants defined by

(2)

Clearly, the matrix can be expressed in terms of the adjacency matrix of the graph. As is well-known, the problem of determining the eigenmodes of the set of coupled oscillators reduces to diagonalizing the interaction matrix , equivalently finding the spectrum of the discrete Laplacian of the graph. Let be a normal mode of this system with frequency . Then, is a solution of the eigenvalue equation

(3)
Figure 1: spider network with periodic boundary conditions, the vertices in the column are identified with those of . A vertex with -bit label in the level is connected to the vertices with labels , and in the level .

We will denote by , the fractional number of modes of an eigenvalue less than or equal to . Hence, . This is called the cumulative spectral density. The spectral density is defined as . In the limit , with finite, we will show that has both a discrete part, and a continuous part. The fraction of modes that give the continuous part is . Therefore, in the limit , we get only a discrete spectrum.

It is well-known that the diagonalization of the springs Hamiltonian is also related to problem of random walks. Consider a continuous-time random walk on the vertices of this graph, where the walker can jump to any one of the neighboring vertices with rate . Thus, in a short time , it can jump to any of the four neighbors with probability , and stay at the same vertex with probability . Suppose the walker starts at vertex . Then, we denote the probability that the walker is at vertex at time , by . We define a vector , whose -th component is . Then the evolution of satisfies the Markov equation

(4)

Then, the probability of being at vertex at time is given by

(5)

The probability of being at the starting point at time is given by . From the translational symmetry of the graph, this does not depend on . We define the Laplace -transform of return probabilities by

(6)

Then it easy to see that

(7)

We use this determination of the normal modes to solve the spherical model on this graph. In the spherical model, we assign a scalar variable to each vertex of the graph. These variables are subjected to a single constraint, known as the spherical constraint

(8)

where is the total number of sites in the graph. The spherical model can be obtained as the large limit of an -vector model on the same graph [2], where we assign an -vector spin to each site , with a constraint , at each vertex . The hamiltonian of the spherical model is given by

(9)

3 Symmetries and sector decomposition

As noted before, the problem of determination of the normal modes of the springs hamiltonian reduces to that of diagonalizing the matrix . This is an matrix, where is the number of vertices in the graph, . The matrix may be viewed as the discrete laplacian operator, acting on the vector space of square-integrable real functions defined on the vertices of the graph. Using the symmetries of the problem, we can block-diagonalize the matrix . We will call the subspaces corresponding to different blocks as sectors.

The spider-web network has a high degree of symmetry. Firstly, all vertices are equivalent. We define a translation operator which takes a vertex to . Clearly, is a symmetry of the graph, and we have

(10)

where is the identity operator.

There are additional symmetries. Consider any integer lying between and . Define as the integer obtained from by flipping the -th bit of its binary representation, reading from left to right. If the bit is , it is replaced by , and vice versa. We define the operators , for to . The operator takes the site to another site , for all . Sites in levels where is outside the range to are left unchanged. Clearly, we have . Also, we see that this mapping preserves the adjacency strucure of the network: if vertices and are nearest neighbors, so are and . Hence we have

(11)

Acting on the space of wavefunctions, the action of the operators is given by

(12)

Now, clearly, the operators and to commute with :

(13)

Also, different commute with each other:

(14)

We define shift-operator , which acts on the set of vertices of the graph, and for all sites , . Operators are defined similarly. Then clearly, we have

(15)

We can think of and as the generators a semigroup. These can be written as matrices.

If we first apply , and then on any vertex , where and take values or , the result is independent of . This implies that . More generally, we have

(16)

Similarly, it is easily seen that for all allowed values of the subcscipts

(17)

One can write similar equations involving longer products of the type etc.. This is interesting for an purely algebraic characterization of the spider-web graphs, but it is not needed for our discussion here.

We can find eigenvectors that are simultaneous eigenvectors of and , for all .

Now, we denote the eigenvalues of by . These are . Consider an eigenfunction , with

(18)

The Hilbert space of all functions breaks into disjoint sectors, each corresponding to a subspace spanned by basis vectors that are eigenvectors corresponding to a specified set . For , the number of sectors can be substantially greater than the , which is the total dimension of the Hilbert space. It follows that for , a large number of sectors must be null.

It is easy to see that if is an eigenfunction of with eigenvalue , then must be zero, whenever . If more than one of the ’s are negative, the corresponding eigenfunction can be nonzero only on the intersection of the corresponding intervals. This severely constrains the allowed values of for a non-null sector. In particular, this implies that any sector with , and distance between and greater than must be null.

Only in the sector with all , the sector decomposition does not break translational invariance, (the sector with all is zero-dimensional for ). In this case, we can break the sector further into one-dimensional subsectors using the eigenvalues of .

It is straight forward to work out the sector decomposition and the spectrum, for small values of explicitly.

3.1 The case

For , the graph is shown in Fig. 2. There is one sector with all . This must have . Thus there are linearly independent variables in this sector, and dimensionality of this sector is . These are further divided into one-dimensional subsectors using the eigenvalues of .

Then, there are sectors with exactly one , and rest positive. In the sector with , we must have , and for . So, each of these sectors is one-dimensional. The corresponding eigenfunction is fully localized within one level, and is shown in Fig. 2. All sectors with more than one negative are empty. The total dimension of the space is thus = , equal to total number of modes in the problem.

Figure 2: Figure shows a part of the network, with a localized eigenfunction corresponding to exactly one of the ’s negative.

3.2 The case

For , the sector with all ’s positive has dimension . It is divided into one-dimensional subsectors using the eigenvalues of .

There are sectors where only one is negative. Consider the sector with , and all other ’s positive. In this case, let the eigenfunction be . We have . If is not equal to or , we have . This implies that must be zero, for . Hence the only non-zero elements are , and , . Using the symmetries of and we also have and . Thus there are only two independent elements and hence this sector is of dimension .

The number of sectors with exactly one negative is clearly . Each of these is two dimensional.

Now consider the sectors with exactly two of the ’s negative. Say, we have , and the rest of the are positive. Clearly, we can assume . Using the result proved above, if , then the sector is empty.

Hence, the non-trivial cases with two of the f’s negative are only with , for some . Clearly, there are choices of . Say . then the corresponding eigenfunctions can be non-zero only for sites in the level . The values of for different can be related to each other using the the symmetries of and . Thus this sector is one-dimensional.

If at least three of the ’s are negative, then one can find a pair of values , with , and the sector must be empty.

Thus, we find that for , the only non-empty sectors are those with total number of negative eigenvalues of at most . The total number of sectors , which is equal to the number of different vertices in the graph.

3.3 Higher N

It is straightforward to extend the treatment given above to higher . We will assume , for convenience.

Given all the eigenvalues , we can relate the value of the eigenfunction for any to the value at the vertex by applying the operators . Clearly, it differs from by at most a sign, and . The dimension of the sector is the number of nonzero ’s that are allowed.

Consider first the sector with all . The corresponding eigenfunction must be of the form , independent of . There are possible choices of . Hence this sector is -dimensional. In this sector, is a good symmetry, and we can use the the eigenvalues of , with to , to further divide this sector into one-dimensional sectors.

Now consider the sectors with exactly one negative. Say . Then the only nonzero values of are for . This sector is of dimension . There are such sectors.

For more than one negative ’s, if the largest distance between two negative ’s is , then . The number of non-zero ’s can be only . Hence this is the dimension of each such sector. There are ’s between the outermost two negative ’s in this band, which can be , and so the number of sectors with a given position of leftmost and rightmost negative ’s is . also the left most negative has possible positions. Hence the number of sectors with a given value of is , and the dimension of each sector is .

As a check, this gives the dimension of the full Hilbert space of eigenfunctions as

(19)

4 Spectrum of normal modes of the springs hamiltonian

The problem of diagonalization of is considerably simplified using its block-diagonalization induced by the symmetries . It is instructive to consider the cases of small first.

4.1 The spectrum for =1

In this case, is fully diagonalized using the symmetries alone. There are eigenstates, and the nontrivial sectors are all one-dimensional. We can thus write down the eigenvectors by use of symmetries alone, and then determine their eigenvalues.

There are states in the sector with all . These are further labeled by eigenvalues of . The vector corresponding to the eigenvalue of is given by

(20)

with , and taking integer values to . The corresponding eigenvalue of is easily seen to be

(21)

Other non-null sectors have exactly one , and rest positive. The eigenvector corresponding to the is easily written down

(22)

This mode is fully localized on the sites in the level . The corresponding eigenvalue of is seen to be .

In the limit , we see that the localized modes are degenerate, and give a - function peak in the spectrum at . The total weight of this peak is . The remaining modes are seen to be extended, and give rise to a continuous spectrum. Adding the delta-function peak to the continuous part given by (21), the total density of states is given by

(23)

4.2 The spectrum for

For the sector with for all , again we have modes. These are given by

(24)

and the corresponding values , and the eigenvalue of is as given by (21).

Now consider the sector with only one negative , say , and the rest of ’s are all positive. This sector is two-dimensional. From the symmetries alone, we see that the corresponding eigenfunction is non-zero only for and . Using , we get

(25)

The eigenvalue equation relating and is easily seen to simplify to

(26)

This is a coupled set of two linear equations. It is easily seen that allowed solutions are , and the corresponding values of are and . The eigenmode corresponding to is shown in Fig. 3.

Figure 3: Figure shows a part of the network, with a localized eigenfunction corresponding to exactly one of the ’s negative.

For the sector with , there is only one eigenvector, which is fully localized in the level . The corresponding eigenvalue is , and the eigenvector is given by

(27)

In the limit , the density of states is seen to be

(28)

4.3 The spectrum for higher

The treatment given above is easily extended to higher . Firstly, given the set of values , the corresponding eigenfunction is of the form , and the sign is easily determined in terms of and the binary representation of . We choose the convention that the sign is positive for .

Figure 4: An eigenmode in the network with with eigenvalue . The amplitude, shown in red, is nonzero only at four sites

A nontrivial eigenfunction is possible, only if the indices corresponding to negative ’s occur in a narrow band of width at most . If the width of the band is , the number of non-zero is .

Consider, for simplicity, the sector in which the non-zero ’s are for . It is easily seen that the eigenvalue equation (3) in terms of the function becomes

This equation is easily solved. The eigenvalues are

(30)

and the corresponding eigenfunction is

As a simple example, if , and all , for , then the eigenfunction is non-zero only for , and the eigenvalue is . There are such sectors, corresponding to different possible choices of for . All these different modes are localized in the level . It is then possible to construct linear combinations of these modes, which are still eigenfunctions of , but no longer eigenfunctions of . We find that these can be chosen so that each eigenfunction is highly localized, and nonzero only at four sites.

This mode is shown in Fig. 4. Let be a binary string of length . We consider the eigenfunction which is nonzero only at the four sites and , defined by

(32)

Clearly, this is an eigenfunction of with eigenvalue .

A similar construction works for all other localized eigenmodes. An eigenmode which extends over levels will have a degeneracy of , and one can choose a linear combination that localizes the mode maximally. Such a mode will have non-zero amplitude only at sites in each of the layers.

It is easily seen that the spectral density function for a general is:

(33)
Figure 5: The spectral density in the limit of large . Only the peaks with weight greater than have been shown.

In the limit of , the spectrum becomes purely discrete. This is very interesting, as the only other known example of a regular transitive infinite graph with a discrete spectrum of the laplacian is the Cayley graph of the lamplighter group, or its generalizations [14].

5 Returns to the origin

From the expression for , it is straightforward to determine how the probability of the random walker being found at the starting site at time varies with for large . Using (5), and the fact that the return probability does not depend on , it may be written as

(34)

For finite , with large, the network is effectively one-dimensional. The integral above is dominated by by the continuous spectral density for small . As for small , it is seen that varies as for large .

For large, the spectrum is purely discrete. In (30), For a given value of the localization width , the mode with lowest frequency corresponds to , and then for large , the frequency may be approximated by . Then, we can write

(35)

For large , the leading behavior of this summation can be determined by steepest descent. The term corresponding to , and we get

(36)

We note that this is qualitatively different from the behavior for the Bethe lattice, where this probability decays exponentially with time.

The function in the limit , using (7) and (33), is given by the formula

(37)

We note that can be written as

(38)

where

(39)

The summation over in the above equation can be done explicitly using the identity

(40)
(41)

where and and are Tchebychef polynomials of the first and second kind respectively [15].

6 Critical behavior of the spherical model

The calculation of equilibrium properties of the spherical model is quite standard [2]. We take care of the spherical constraint by using a Lagrage multiplier, and consider the Hamiltonian

(42)

where is temperature-dependent constant, whose value is determined by the condition

(43)

Here denotes equilibrium thermodynamical average using the Boltzmann factor corresponding to the Hamiltonian . Since is a purely quadratic hamiltonian, in terms of normal mode oordinates, it becomes uncoupled oscillators. Thus, we get

(44)

It is easy to see that is a monotonic non-decreaseing function of . As the temperature is decreased from very high values, at a particular temperature , in the thermodynamic limit becomes zero, and sticks to the value zero for all . The transition temperature is given by the equation

(45)

For , the spherical constraint Eq. (8), is satisfied by by a macroscopic occupation of the uniform mode. If the uniform magnetization is , it is easy to see that we have

(46)

For near , this implies that , and the magnetization exponent takes the classical value . The internal energy per mode is the classical value , by the equipartition theorem, and the specific heat takes a constant value for all .

For , with small and positive, it is easy to see that is a linear function of :

(47)

where C is a positive constant. The specific heat for is smaller than , and jumps discontinuously at , with the discontinuity proportional to the .

The free energy per site for is given by the equation

(48)

Using the fact that varies as for tending to zero, we see that for small positive , can be written as sum of a Taylor expandable regular part, and a singular part .

It would be interesting to extend this analysis to other models of phase transitions on this lattice. It seems reasonable to expect somewhat similar behavior. For example, in the -vector models with nearest -neighbor ferromagnet couplings, the high-temperature expansion for free energy involves sum over loop diagrams. The number of self-avoiding polygons of a given perimeter may be expected to have a behavior similar to number of random walks that return to origin. Note that these essential singularities can not be captured easily in a perturbative approach. Another interesting question is the effect of disorder on the localization properties of the normal modes of the springs Hamiltonian on this network. These seem to be interesting directions for further study.

ACB thanks Kishore Vaigyanik Protsahan Yojana for financial support, and TIFR for hospitality during his visit. DD would like to acknowledge the financial support from the Department of Science and Technology, Government of India, through a JC Bose Fellowship.

References

References

  • [1] See, for example, D. Chowdhury and D. Stauffer 2000 Principles of Equilibrium Statistical Mechanics (Wiley -VCH, Weinheim) pp. 453-455.
  • [2] G. S. Joyce 1972 in Phase Transitions and Critical Phenomena Eds. C. Domb and M. S. Green (Academic, London) Vol. 2 pp. 375-442.
  • [3] N. Ikeno A limit on crosspoint numbers IRE Trans. Inform. Theory Volume IT- Issue Summer pp. 187-196.
  • [4] A. Feiner and J.G. Kappel A method of deriving efficient switching network configurations, Proc. Nat. Electron. Conf. 818-823.
  • [5] C. F. Baillie, D.A. Johnston and J.P. Kownacki, , Ising spins on thin graphs, Nucl. Phys. B, pp 551-570.
  • [6] D. Dhar, R. Rajesh and J.F. Stilck Hard rigid rods on a Bethe-like lattice, Phys. Rev. E 011140.
  • [7] K. Takagi Design of multi-stage link systems by means of optimal channel graphs, Electron. Comm. Japan pp. 37-46.
  • [8] F. R. K. Chung and F. K. Hwang 1980 The Connection Pattern of Two Binary Trees, SIAM Journal on Algebraic and Discrete Methods, Volume , pp. 322-335.
  • [9] F. K. Hwang 1982 Computing the Blocking Probabilities of Spiderweb Channel Graphs, IEEE Transactions on Communications, Volume COM- No. pp. 1916-1918.
  • [10] N. Pippenger 1991 The blocking probability of spider-web networks Random Structure and Algorithms Volume Issue Summer pp. 121-149.
  • [11] N. Pippenger The asymptotic optimality of spider-web networks Discrete Applied Mathematics Volume July, .
  • [12] N. Pippenger The Linking Probability of Deep Spider-Web Networks SIAM Journal on Discrete Mathematics Volume no. pp. 143-159.
  • [13] F. R. K. Chung 1997 Spectral graph theory CBMS Regional Conf. Series Vol. 92 ( AMS, Providence).
  • [14] R. I. Grigorchuk and A. Zuk 2001 The lamplighter group as a group generated by 2-state automaton, and its spectrum Geometri. Dedicata 87 pp. 209-244. We thank the referee for this remark.
  • [15] M. Stone and P. Goldbart 2009 Mathematics for Physics: A Guided Tour for Graduate Students (Cambridge University Press, Cambridge) p. 73.
Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
""
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
   
Add comment
Cancel
Loading ...
116148
This is a comment super asjknd jkasnjk adsnkj
Upvote
Downvote
""
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters
Submit
Cancel

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test
Test description