PSParongama Sen
Parongama Sen
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Parongama Sen has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Subhrangshu Sekhar Manna
Satyendra Nath Bose National Centre for Basic Sciences Block-JD Sector-III Salt Lake Kolkata-700098 India
4 shared publications Turbasu Biswas
Department of Physics, Presidency College, College Street, Calcutta 700073, India
2 shared publicationsKinjal Banerjee
Department of Physics Presidency College College Street 700073 Calcutta India
1 shared publication- Kinjal Banerjee
Department of Physics, Birla Institute of Technology and Science, Pilani, K K Birla Goa Campus, Zuarinagar, Sancoale, Goa 403726, India
1 shared publication Moumita Saharay
Department of Physics University of Calcutta 92 A.P. C. Road 700009 Calcutta India
1 shared publication- Pratap Kumar Das
Department of Physics University of Calcutta 92 Acharya Prafulla Chandra Road 700009 Kolkata India
1 shared publication
Latest Publications
- Open Access
Zero temperature dynamics of Ising model on a densely connected small world network
The zero temperature quenching dynamics of the ferromagnetic Ising model on a densely connected small world network is studied where long range bonds are added randomly with a finite probability $p$. We find that in contrast to the sparsely connected networks and random graph, there is no freezing and an initial random configuration of the spins reaches the equilibrium configuration within a very few Monte Carlo time steps in the thermodynamic limit for any $p \ne 0$. The residual energy and the number of spins flipped at any time shows an exponential relaxation to equilibrium. The persistence probability is also studied and it shows a saturation within a few time steps, the saturation value being 0.5 in the thermodynamic limit. These results are explained in the light of the topological properties of the network which is highly clustered and has a novel small world behaviour.Open AccessZero temperature dynamics of Ising model on a densely connected small world network
The zero temperature quenching dynamics of the ferromagnetic Ising model on a densely connected small world network is studied where long range bonds are added randomly with a finite probability $p$. We find that in contrast to the sparsely connected networks and random graph, there is no freezing and an initial random configuration of the spins reaches the equilibrium configuration within a very few Monte Carlo time steps in the thermodynamic limit for any $p \ne 0$. The residual energy and the number of spins flipped at any time shows an exponential relaxation to equilibrium. The persistence probability is also studied and it shows a saturation within a few time steps, the saturation value being 0.5 in the thermodynamic limit. These results are explained in the light of the topological properties of the network which is highly clustered and has a novel small world behaviour. - Open Access
Persistence and dynamics in ANNNI chain
We investigate both the local and global persistence behaviour in ANNNI (axial next-nearest neighour Ising) model. We find that when the ratio $\kappa $ of the second neighbour interaction to the first neighbour interaction is less than 1, $P(t)$, the probability of a spin to remain in its original state upto time $t$ shows a stretched exponential decay. For $\kappa > 1$, $P(t)$ has a algebraic decay but the exponent is different from that of the nearest neighbour Ising model. The global persistence behaviour shows similar features. We also conduct some deeper investigations in the dynamics of the ANNNI model and conclude that it has a different dynamical behaviour compared to the nearest neighbour Ising model.Open AccessPersistence and dynamics in ANNNI chain
We investigate both the local and global persistence behaviour in ANNNI (axial next-nearest neighour Ising) model. We find that when the ratio $\kappa $ of the second neighbour interaction to the first neighbour interaction is less than 1, $P(t)$, the probability of a spin to remain in its original state upto time $t$ shows a stretched exponential decay. For $\kappa > 1$, $P(t)$ has a algebraic decay but the exponent is different from that of the nearest neighbour Ising model. The global persistence behaviour shows similar features. We also conduct some deeper investigations in the dynamics of the ANNNI model and conclude that it has a different dynamical behaviour compared to the nearest neighbour Ising model. - 26 April 2004
- Published by American Physical Society (APS) in Physical Review E
- Vol. 69 (4) , 046107
Accelerated growth in outgoing links in evolving networks: Deterministic versus stochastic picture
In several real-world networks such as the Internet, World Wide Web, etc., the number of links grow in time in a nonlinear fashion. We consider growing networks in which the number of outgoing links is a nonlinear function of time but new links between older nodes are forbidden. The attachments are made using a preferential attachment scheme. In the deterministic picture, the number of outgoing links at any time is taken as where is the number of nodes present at that time. The continuum theory predicts a power-law decay of the degree distribution: , while the degree of the node introduced at time is given by when the network is evolved till time . Numerical results show a growth in the degree distribution for small values at any nonzero . In the stochastic picture, is a random variable. As long as is independent of time, the network shows a behavior similar to the Barabási-Albert (BA) model. Different results are obtained when is time dependent, e.g., when follows a distribution . The behavior of changes significantly as is varied: for , the network has a scale-free distribution belonging to the BA class as predicted by the mean field theory; for smaller values of it shows different behavior. Characteristic features of the clustering coefficients in both models have also been discussed.- 26 April 2004
- Published by American Physical Society (APS) in Physical Review E
- Vol. 69 (4) , 046107
Accelerated growth in outgoing links in evolving networks: Deterministic versus stochastic picture
In several real-world networks such as the Internet, World Wide Web, etc., the number of links grow in time in a nonlinear fashion. We consider growing networks in which the number of outgoing links is a nonlinear function of time but new links between older nodes are forbidden. The attachments are made using a preferential attachment scheme. In the deterministic picture, the number of outgoing links at any time is taken as where is the number of nodes present at that time. The continuum theory predicts a power-law decay of the degree distribution: , while the degree of the node introduced at time is given by when the network is evolved till time . Numerical results show a growth in the degree distribution for small values at any nonzero . In the stochastic picture, is a random variable. As long as is independent of time, the network shows a behavior similar to the Barabási-Albert (BA) model. Different results are obtained when is time dependent, e.g., when follows a distribution . The behavior of changes significantly as is varied: for , the network has a scale-free distribution belonging to the BA class as predicted by the mean field theory; for smaller values of it shows different behavior. Characteristic features of the clustering coefficients in both models have also been discussed.- Open Access
Accelerated growth in outgoing links in evolving networks: deterministic vs. stochastic picture
In several real-world networks like the Internet, WWW etc., the number of links grow in time in a non-linear fashion. We consider growing networks in which the number of outgoing links is a non-linear function of time but new links between older nodes are forbidden. The attachments are made using a preferential attachment scheme. In the deterministic picture, the number of outgoing links $m(t)$ at any time $t$ is taken as $N(t)^\theta$ where $N(t)$ is the number of nodes present at that time. The continuum theory predicts a power law decay of the degree distribution: $P(k) \propto k^{-1-\frac{2} {1-\theta}}$, while the degree of the node introduced at time $t_i$ is given by $k(t_i,t) = t_i^{\theta}[ \frac {t}{t_i}]^{\frac {1+\theta}{2}}$ when the network is evolved till time $t$. Numerical results show a growth in the degree distribution for small $k$ values at any non-zero $\theta$. In the stochastic picture, $m(t)$ is a random variable. As long as $$ is independent of time, the network shows a behaviour similar to the Barab\'asi-Albert (BA) model. Different results are obtained when $$ is time-dependent, e.g., when $m(t)$ follows a distribution $P(m) \propto m^{-\lambda}$. The behaviour of $P(k)$ changes significantly as $\lambda$ is varied: for $\lambda > 3$, the network has a scale-free distribution belonging to the BA class as predicted by the mean field theory, for smaller values of $\lambda$ it shows different behaviour. Characteristic features of the clustering coefficients in both models have also been discussed.Open AccessAccelerated growth in outgoing links in evolving networks: deterministic vs. stochastic picture
In several real-world networks like the Internet, WWW etc., the number of links grow in time in a non-linear fashion. We consider growing networks in which the number of outgoing links is a non-linear function of time but new links between older nodes are forbidden. The attachments are made using a preferential attachment scheme. In the deterministic picture, the number of outgoing links $m(t)$ at any time $t$ is taken as $N(t)^\theta$ where $N(t)$ is the number of nodes present at that time. The continuum theory predicts a power law decay of the degree distribution: $P(k) \propto k^{-1-\frac{2} {1-\theta}}$, while the degree of the node introduced at time $t_i$ is given by $k(t_i,t) = t_i^{\theta}[ \frac {t}{t_i}]^{\frac {1+\theta}{2}}$ when the network is evolved till time $t$. Numerical results show a growth in the degree distribution for small $k$ values at any non-zero $\theta$. In the stochastic picture, $m(t)$ is a random variable. As long as $$ is independent of time, the network shows a behaviour similar to the Barab\'asi-Albert (BA) model. Different results are obtained when $$ is time-dependent, e.g., when $m(t)$ follows a distribution $P(m) \propto m^{-\lambda}$. The behaviour of $P(k)$ changes significantly as $\lambda$ is varied: for $\lambda > 3$, the network has a scale-free distribution belonging to the BA class as predicted by the mean field theory, for smaller values of $\lambda$ it shows different behaviour. Characteristic features of the clustering coefficients in both models have also been discussed. - 11 August 2003
- Published by American Physical Society (APS) in Physical Review E
- Vol. 68 (2) , 026104
Clustering properties of a generalized critical Euclidean network
Many real-world networks exhibit a scale-free feature, have a small diameter, and a high clustering tendency. We study the properties of a growing network, which has all these features, in which an incoming node is connected to its predecessor of degree with a link of length using a probability proportional to For the network is scale-free at with the degree distribution and as in the Barabási-Albert model We find a phase boundary in the plane along which the network is scale-free. Interestingly, we find a scale-free behavior even for for where the existence of a different universality class is indicated from the behavior of the degree distribution and the clustering coefficients. The network has a small diameter in the entire scale-free region. The clustering coefficients emulate the behavior of most real networks for increasing negative values of on the phase boundary.- 11 August 2003
- Published by American Physical Society (APS) in Physical Review E
- Vol. 68 (2) , 026104
Clustering properties of a generalized critical Euclidean network
Many real-world networks exhibit a scale-free feature, have a small diameter, and a high clustering tendency. We study the properties of a growing network, which has all these features, in which an incoming node is connected to its predecessor of degree with a link of length using a probability proportional to For the network is scale-free at with the degree distribution and as in the Barabási-Albert model We find a phase boundary in the plane along which the network is scale-free. Interestingly, we find a scale-free behavior even for for where the existence of a different universality class is indicated from the behavior of the degree distribution and the clustering coefficients. The network has a small diameter in the entire scale-free region. The clustering coefficients emulate the behavior of most real networks for increasing negative values of on the phase boundary.- Open Access
Clustering properties of a generalised critical Euclidean network
Many real-world networks exhibit scale-free feature, have a small diameter and a high clustering tendency. We have studied the properties of a growing network, which has all these features, in which an incoming node is connected to its $i$th predecessor of degree $k_i$ with a link of length $\ell$ using a probability proportional to $k^\beta_i \ell^{\alpha}$. For $\alpha > -0.5$, the network is scale free at $\beta = 1$ with the degree distribution $P(k) \propto k^{-\gamma}$ and $\gamma = 3.0$ as in the Barab\'asi-Albert model ($\alpha =0, \beta =1$). We find a phase boundary in the $\alpha-\beta$ plane along which the network is scale-free. Interestingly, we find scale-free behaviour even for $\beta > 1$ for $\alpha < -0.5$ where the existence of a new universality class is indicated from the behaviour of the degree distribution and the clustering coefficients. The network has a small diameter in the entire scale-free region. The clustering coefficients emulate the behaviour of most real networks for increasing negative values of $\alpha$ on the phase boundary.Open AccessClustering properties of a generalised critical Euclidean network
Many real-world networks exhibit scale-free feature, have a small diameter and a high clustering tendency. We have studied the properties of a growing network, which has all these features, in which an incoming node is connected to its $i$th predecessor of degree $k_i$ with a link of length $\ell$ using a probability proportional to $k^\beta_i \ell^{\alpha}$. For $\alpha > -0.5$, the network is scale free at $\beta = 1$ with the degree distribution $P(k) \propto k^{-\gamma}$ and $\gamma = 3.0$ as in the Barab\'asi-Albert model ($\alpha =0, \beta =1$). We find a phase boundary in the $\alpha-\beta$ plane along which the network is scale-free. Interestingly, we find scale-free behaviour even for $\beta > 1$ for $\alpha < -0.5$ where the existence of a new universality class is indicated from the behaviour of the degree distribution and the clustering coefficients. The network has a small diameter in the entire scale-free region. The clustering coefficients emulate the behaviour of most real networks for increasing negative values of $\alpha$ on the phase boundary. - Open Access
- 12 December 2002
- Published by American Physical Society (APS) in Physical Review E
- Vol. 66 (6) , 066114
Modulated scale-free network in Euclidean space
A random network is grown by introducing at unit rate randomly selected nodes on the Euclidean space. A node is randomly connected to its predecessor of degree with a directed link of length using a probability proportional to Our numerical study indicates that the network is scale free for all values of and the degree distribution decays stretched exponentially for the other values of The link length distribution follows a power law: where is calculated exactly for the whole range of values of- 12 December 2002
- Published by American Physical Society (APS) in Physical Review E
- Vol. 66 (6) , 066114
Open AccessModulated scale-free network in Euclidean space
A random network is grown by introducing at unit rate randomly selected nodes on the Euclidean space. A node is randomly connected to its predecessor of degree with a directed link of length using a probability proportional to Our numerical study indicates that the network is scale free for all values of and the degree distribution decays stretched exponentially for the other values of The link length distribution follows a power law: where is calculated exactly for the whole range of values of - Open Access
Modulated Scale-free Network in the Euclidean Space
A random network is grown by introducing at unit rate randomly selected nodes on the Euclidean space. A node is randomly connected to its $i$-th predecessor of degree $k_i$ with a directed link of length $\ell$ using a probability proportional to $k_i \ell^{\alpha}$. Our numerical study indicates that the network is Scale-free for all values of $\alpha > \alpha_c $ and the degree distribution decays stretched exponentially for the other values of $\alpha$. The link length distribution follows a power law: $D(\ell) \sim \ell^{\delta}$ where $\delta$ is calculated exactly for the whole range of values of $\alpha$.Open AccessModulated Scale-free Network in the Euclidean Space
A random network is grown by introducing at unit rate randomly selected nodes on the Euclidean space. A node is randomly connected to its $i$-th predecessor of degree $k_i$ with a directed link of length $\ell$ using a probability proportional to $k_i \ell^{\alpha}$. Our numerical study indicates that the network is Scale-free for all values of $\alpha > \alpha_c $ and the degree distribution decays stretched exponentially for the other values of $\alpha$. The link length distribution follows a power law: $D(\ell) \sim \ell^{\delta}$ where $\delta$ is calculated exactly for the whole range of values of $\alpha$. - 20 September 2002
- Published by American Physical Society (APS) in Physical Review E
- Vol. 66 (3) , 037102
Phase transitions in a network with a range-dependent connection probability
We consider a one-dimensional network in which the nodes at Euclidean distance l can have long range connections with a probabilty in addition to nearest neighbor connections. This system has been shown to exhibit small-world behavior for above which its behavior is like a regular lattice. From the study of the clustering coefficients, we show that there is a transition to a random network at The finite size scaling analysis of the clustering coefficients obtained from numerical simulations indicates that a continuous phase transition occurs at this point. Using these results, we find that the two transitions occurring in this network can be detected in any dimension by the behavior of a single quantity, the average bond length. The phase transitions in all dimensions are nontrivial in nature.- 20 September 2002
- Published by American Physical Society (APS) in Physical Review E
- Vol. 66 (3) , 037102
Phase transitions in a network with a range-dependent connection probability
We consider a one-dimensional network in which the nodes at Euclidean distance l can have long range connections with a probabilty in addition to nearest neighbor connections. This system has been shown to exhibit small-world behavior for above which its behavior is like a regular lattice. From the study of the clustering coefficients, we show that there is a transition to a random network at The finite size scaling analysis of the clustering coefficients obtained from numerical simulations indicates that a continuous phase transition occurs at this point. Using these results, we find that the two transitions occurring in this network can be detected in any dimension by the behavior of a single quantity, the average bond length. The phase transitions in all dimensions are nontrivial in nature.- Open Access
Phase transitions in a network with range dependent connection probability
We consider a one-dimensional network in which the nodes at Euclidean distance $l$ can have long range connections with a probabilty $P(l) \sim l^{-\delta}$ in addition to nearest neighbour connections. This system has been shown to exhibit small world behaviour for $\delta < 2$ above which its behaviour is like a regular lattice. From the study of the clustering coefficients, we show that there is a transition to a random network at $\delta = 1$. The finite size scaling analysis of the clustering coefficients obtained from numerical simulations indicate that a continuous phase transition occurs at this point. Using these results, we find that the two transitions occurring in this network can be detected in any dimension by the behaviour of a single quantity, the average bond length. The phase transitions in all dimensions are non-trivial in nature.Open AccessPhase transitions in a network with range dependent connection probability
We consider a one-dimensional network in which the nodes at Euclidean distance $l$ can have long range connections with a probabilty $P(l) \sim l^{-\delta}$ in addition to nearest neighbour connections. This system has been shown to exhibit small world behaviour for $\delta < 2$ above which its behaviour is like a regular lattice. From the study of the clustering coefficients, we show that there is a transition to a random network at $\delta = 1$. The finite size scaling analysis of the clustering coefficients obtained from numerical simulations indicate that a continuous phase transition occurs at this point. Using these results, we find that the two transitions occurring in this network can be detected in any dimension by the behaviour of a single quantity, the average bond length. The phase transitions in all dimensions are non-trivial in nature.