Benjamin Schweinhart

Benjamin Schweinhart

Auto-generated profile, based on publicly available information

Benjamin Schweinhart

Department of Mathematical Sciences, George Mason University, Fairfax, USA

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 November 2019 in Discrete & Computational Geometry
Verified
Journal Article
Closed access
PDF file
BSBenjamin Schweinhart
Benjamin Schweinhart

7 February 2023 in Discrete & Computational Geometry
Verified
Journal Article
Open access
PDF file
FMFedor Manin
Fedor Manin
ÉRÉrika Roldán
Érika Roldán
BSBenjamin Schweinhart
Benjamin Schweinhart
The Eden cell growth model is a simple discrete stochastic process which produces a “blob” (aggregation of cells) in $$\mathbb {R}^d$$Rd : start with one cube in the regular grid, and at each time step add a neighboring cube uniformly at random. This process has been used as a model for the growth of aggregations, tumors, and bacterial colonies and the healing of wounds, among other natural processes. Here, we study the topology and local geometry of the resulting structure, establishing asymptotic bounds for Betti numbers. Our main result is that the Betti numbers at timetgrow at a rate between $$t^{(d-1)/d}$$t(d-1)/d and $$P_d(t)$$Pd(t) , where $$P_d(t)$$Pd(t) is the size of the site perimeter. Assuming a widely believed conjecture, this establishes the rate of growth of the Betti numbers in every dimension. We also present the results of computational experiments on finer aspects of the geometry and topology, such as persistent homology and the distribution of shapes of holes.

30 May 2025 in Communications in Mathematical Physics
Verified
Journal Article
Open access
PDF file
PDPaul Duncan
Paul Duncan
BSBenjamin Schweinhart
Benjamin Schweinhart
The i-dimensional plaquette random-cluster model on a finite cubical complex is the random complex of i-plaquettes with each configuration having probability proportional to $$p^{\#\text { of plaquettes}}\left( 1-p \right) ^{\#\text { of complementary plaquettes}}q^{\textbf{b}_{i-1}},$$ p # of plaquettes 1 - p # of complementary plaquettes q b i - 1 , where $$q\ge 1$$ q ≥ 1 is a real parameter and $$\textbf{b}_{i-1}$$ b i - 1 denotes the rank of the $$(i-1)$$ ( i - 1 ) -homology group with coefficients in a specified coefficient field. When q is prime and the coefficient field is $$\mathbb {F}_q$$ F q , this model is coupled with the $$(i-1)$$ ( i - 1 ) -dimensional q-state Potts lattice gauge theory. We prove that the probability that an $$(i-1)$$ ( i - 1 ) -cycle in $$\mathbb {Z}^d$$ Z d is null-homologous in the plaquette random-cluster model equals the expectation of the corresponding generalized Wilson loop variable. This provides the first rigorous justification for a claim of Aizenman, Chayes, Chayes, Frölich, and Russo that there is an exact relationship between Wilson loop variables and the event that a loop is bounded by a surface in an interacting system of plaquettes. We also prove that the i-dimensional plaquette random-cluster model on the 2i-dimensional torus exhibits a sharp phase transition at the self-dual point $$p_{\textrm{sd}} :=\frac{\sqrt{q}}{1+\sqrt{q}}$$ p sd : = q 1 + q in the sense of homological percolation. This implies a qualitative change in the generalized Swendsen–Wang dynamics from local to non-local behavior.

4 June 2025 in Communications in Mathematical Physics
Verified
Journal Article
Open access
PDF file
PDPaul Duncan
Paul Duncan
BSBenjamin Schweinhart
Benjamin Schweinhart
In 1983, Aizenman, Chayes, Chayes, Fröhlich, and Russo [1] proved that 2-dimensional Bernoulli plaquette percolation in $$\mathbb {Z}^3$$ Z 3 exhibits a sharp phase transition for the event that a large rectangular loop is “bounded by a surface of plaquettes.” We extend this result both to $$(d-1)$$ ( d - 1 ) -dimensional plaquette percolation in $$\mathbb {Z}^d,$$ Z d , and to a dependent model of plaquette percolation called the plaquette random-cluster model. As a consequence, we obtain a sharp phase transition for Wilson loop expectations in $$(d-2)$$ ( d - 2 ) -dimensional q-state Potts hyperlattice gauge theory on $$\mathbb {Z}^d$$ Z d dual to that of the Potts model. Our proof is unconditional for Ising lattice gauge theory, but relies on a regularity conjecture for the random-cluster model in slabs when $$q>2.$$ q > 2 . We also further develop the general theory of the i-plaquette random cluster model and its relationship with $$(i-1)$$ ( i - 1 ) -dimensional Potts lattice gauge theory.

18 June 2025 in Acta Materialia
Verified
Journal Article
Open access
DMDylan Miley
Dylan Miley
ESEthan Suwandi
Ethan Suwandi
BSBenjamin Schweinhart
Benjamin Schweinhart
JMJeremy K. Mason
Jeremy K. Mason

19 May 2020 in Physical Review E
Verified
Journal Article
Closed access
PDF file
BSB. Schweinhart
B. Schweinhart
DRD. Rodney
D. Rodney
JMJ. K. Mason
J. K. Mason
Whereas knowledge of a crystalline material's unit cell is fundamental to understanding the material's properties and behavior, there are no obvious analogs to unit cells for disordered materials despite the frequent existence of considerable medium-range order. This article views a material's structure as a collection of local atomic environments that are sampled from some underlying probability distribution of such environments, with the advantage of offering a unified description of both ordered and disordered materials. Crystalline materials can then be regarded as special cases where the underlying probability distribution is highly concentrated around the traditional unit cell. The H1 barcode is proposed as a descriptor of local atomic environments suitable for disordered bond networks and is applied with three other descriptors to molecular dynamics simulations of silica glasses. Each descriptor reliably distinguishes the structure of glasses produced at different cooling rates, with the H1 barcode and coordination profile providing the best separation. The approach is generally applicable to any system that can be represented as a sparse graph.