Sayantan Mitra - Academia.edu (original) (raw)
Uploads
Papers by Sayantan Mitra
Physical Review E
Site percolation in a distorted simple cubic lattice is characterized numerically employing the N... more Site percolation in a distorted simple cubic lattice is characterized numerically employing the Newman-Ziff algorithm. Distortion is administered in the lattice by systematically and randomly dislocating its sites from their regular positions. The amount of distortion is tunable by a parameter called the distortion parameter. In this model, two occupied neighboring sites are considered connected only if the distance between them is less than a predefined value called the connection threshold. It is observed that the percolation threshold always increases with distortion if the connection threshold is equal to or greater than the lattice constant of the regular lattice. On the other hand, if the connection threshold is less than the lattice constant, the percolation threshold first decreases, then increases steadily as distortion is increased. It is shown that the variation of the percolation threshold can be well explained by the change in the fraction of occupied bonds with distortion. The values of the relevant critical exponents of the transition strongly indicate that percolation in regular and distorted simple cubic lattices belong to the same universality class. It is also demonstrated that this model is intrinsically distinct from the site-bond percolation model.
Physical Review E, 2019
This paper presents a Monte-Carlo study of percolation in a distorted square lattice, in which, t... more This paper presents a Monte-Carlo study of percolation in a distorted square lattice, in which, the adjacent sites are not equidistant. Starting with an undistorted lattice, the position of the lattice sites are shifted through a tunable parameter α to create a distorted empty lattice. In this model, two neighboring sites are considered to be connected to each other in order to belong to the same cluster, if both of them are occupied as per the criterion of usual percolation and the distance between them is less than or equal to a certain value, called connection threshold d. While spanning becomes difficult in distorted lattices as is manifested by the increment of the percolation threshold pc with α, an increased connection threshold d makes it easier for the system to percolate. The scaling behavior of the order parameter through relevant critical exponents and the fractal dimension d f of the percolating cluster at pc indicate that this new type of percolation may belong to the same universality class as ordinary percolation. This model can be very useful in various realistic applications since it is almost impossible to find a natural system that is perfectly ordered.
In this work, a novel model of the random geometric graph (RGG), namely the isotropic random geom... more In this work, a novel model of the random geometric graph (RGG), namely the isotropic random geometric graph (IRGG) has been developed and its topological properties in two dimensions have been studied in details. The defining characteristics of RGG and IRGG are the same — two nodes are connected by an edge if their distance is less than a fixed value, called the connection radius. However, IRGGs have two major differences from regular RGGs. Firstly, the shape of their boundaries — which is circular. It brings very little changes in final results but gives a significant advantage in analytical calculations of the network properties. Secondly, it opens up the possibility of an empty concentric region inside the network. The empty region contains no nodes but allows the communicating edges between the nodes to pass through it. This second difference causes significant alterations in physically relevant network properties such as average degree, connectivity, clustering coefficient and...
Physical Review E
Site percolation in a distorted simple cubic lattice is characterized numerically employing the N... more Site percolation in a distorted simple cubic lattice is characterized numerically employing the Newman-Ziff algorithm. Distortion is administered in the lattice by systematically and randomly dislocating its sites from their regular positions. The amount of distortion is tunable by a parameter called the distortion parameter. In this model, two occupied neighboring sites are considered connected only if the distance between them is less than a predefined value called the connection threshold. It is observed that the percolation threshold always increases with distortion if the connection threshold is equal to or greater than the lattice constant of the regular lattice. On the other hand, if the connection threshold is less than the lattice constant, the percolation threshold first decreases, then increases steadily as distortion is increased. It is shown that the variation of the percolation threshold can be well explained by the change in the fraction of occupied bonds with distortion. The values of the relevant critical exponents of the transition strongly indicate that percolation in regular and distorted simple cubic lattices belong to the same universality class. It is also demonstrated that this model is intrinsically distinct from the site-bond percolation model.
Physical Review E, 2019
This paper presents a Monte-Carlo study of percolation in a distorted square lattice, in which, t... more This paper presents a Monte-Carlo study of percolation in a distorted square lattice, in which, the adjacent sites are not equidistant. Starting with an undistorted lattice, the position of the lattice sites are shifted through a tunable parameter α to create a distorted empty lattice. In this model, two neighboring sites are considered to be connected to each other in order to belong to the same cluster, if both of them are occupied as per the criterion of usual percolation and the distance between them is less than or equal to a certain value, called connection threshold d. While spanning becomes difficult in distorted lattices as is manifested by the increment of the percolation threshold pc with α, an increased connection threshold d makes it easier for the system to percolate. The scaling behavior of the order parameter through relevant critical exponents and the fractal dimension d f of the percolating cluster at pc indicate that this new type of percolation may belong to the same universality class as ordinary percolation. This model can be very useful in various realistic applications since it is almost impossible to find a natural system that is perfectly ordered.
In this work, a novel model of the random geometric graph (RGG), namely the isotropic random geom... more In this work, a novel model of the random geometric graph (RGG), namely the isotropic random geometric graph (IRGG) has been developed and its topological properties in two dimensions have been studied in details. The defining characteristics of RGG and IRGG are the same — two nodes are connected by an edge if their distance is less than a fixed value, called the connection radius. However, IRGGs have two major differences from regular RGGs. Firstly, the shape of their boundaries — which is circular. It brings very little changes in final results but gives a significant advantage in analytical calculations of the network properties. Secondly, it opens up the possibility of an empty concentric region inside the network. The empty region contains no nodes but allows the communicating edges between the nodes to pass through it. This second difference causes significant alterations in physically relevant network properties such as average degree, connectivity, clustering coefficient and...