Related papers: Duality between star and plus connected components…
We examine the effects of introducing a wall or edge into a directed percolation process. Scaling ansatzes are presented for the density and survival probability of a cluster in these geometries, and we make the connection to surface…
The travel times of light signals between two antipodal points on the surface of a compact star are calculated for two different trajectories: a straight line that passes through the center of the star and a semi-circular trajectory that…
We extend to infinite graphs the matroidal characterization of finite graph duality, that two graphs are dual iff they have complementary spanning trees in some common edge set. The naive infinite analogue of this fails. The key in an…
Michelson phase and Hanbury Brown-Twiss intensity stellar interferometry require expressions for the first- and second-order correlation functions, respectively, of the fields radiated by stars in terms of their diameters and measured…
A tree containing exactly two non-pendant vertices is called a double-star. A double-star with degree sequence $(k_1+ 1, k_2+ 1, 1, \ldots, 1)$ is denoted by $S_{k_1, k_2}$. We study the edge-decomposition of regular graphs into…
Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…
Corner percolation is a dependent bond percolation model on Z^2 introduced by B\'alint T\'oth, in which each vertex has exactly two incident edges, perpendicular to each other. G\'abor Pete has proven in 2008 that under the maximal entropy…
Triggered di-hadron correlation studies using central Au+Au collisions at $\sqrt{S_{NN}}$ = 200 GeV in STAR revealed a novel ridge-like structure in two dimensions ($\Delta\eta$,$\Delta\phi$) for high $p_{T}$ particles. A similar structure…
In this paper, we introduce the graph $G(S)$ of a bounded semilattice $S$, which is a generalization of the intersection graph of the substructures of an algebraic structure. We prove some general theorems about these graphs; as an example,…
A biclique of a graph $G$ is an induced complete bipartite subgraph of $G$ such that neither part is empty. A star is a biclique of $G$ such that one part has exactly one vertex. The star graph of $G$ is the intersection graph of the…
There are several notions of duality between lines and points. In this note, it is shown that all these can be studied in a unified way. Most interesting properties are independent of specific choices. It is also shown that either dual…
According to Aistleitner and Weimar, there exist two-dimensional (double) infinite matrices whose star-discrepancy $D_N^{*s}$ of the first $N$ rows and $s$ columns, interpreted as $N$ points in $[0,1]^s$, satisfies an inequality of the form…
We propose a continuum model of percolation in two dimensions for overlapping disks with spin. In this model the existence of bonds is determined by the distance between the centers of the disks, and by the scalar product of the (randomly)…
We prove the existence of non-trivial phase transitions for the intersection of two independent random interlacements and the complement of the intersection. Some asymptotic results about the phase curves are also obtained. Moreover, we…
Extending the well-known star-comb lemma for infinite graphs, we characterise the graphs that do not contain an infinite comb or an infinite star, respectively, attached to a given set of vertices. We offer several characterisations: in…
Suspensions of hard core spherical particles of diameter $D$ with inter-core connectivity range $\delta$ can be described in terms of random geometric graphs, where nodes represent the sphere centers and edges are assigned to any two…
We give a generalization of the duality of a zero-dimensional complete intersection to the case of one-dimensional almost complete intersections, which results in a {\em Gorenstein module} $M=I/J$. In the real case the resulting pairing has…
The cycle double cover conjecture is a long standing problem in graph theory, which links local properties, the valency of a vertex and no bridges, and a global property of the graph, being covered by a particular set of cycles. We prove…
We propose an evolutionary path for prestellar cores on the radius-mass diagram, which is analogous to stellar evolutionary paths on the Hertzsprung-Russell Diagram. Using James Clerk Maxwell Telescope (JCMT) observations of L1688 in the…
We solve the weak percolation problem for multiplex networks with overlapping edges. In weak percolation, a vertex belongs to a connected component if at least one of its neighbors in each of the layers is in this component. This is a…