Related papers: Directed and multi-directed animals on the king's …
We consider a directed percolation process on an ${\cal M}$ x ${\cal N}$ rectangular lattice whose vertical edges are directed upward with an occupation probability y and horizontal edges directed toward the right with occupation…
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is extended to the setting of general planar directed…
Directed graphs provide more subtle and precise modelling tools for optimization in road networks than simple graphs. In particular, they are more suitable in the context of alternative fuel vehicles and new automotive technologies, like…
Mixed graphs have both directed and undirected edges. A mixed cage is a regular mixed graph of given girth with minimum possible order. In this paper mixed cages are studied. Upper bounds are obtained by general construction methods and…
The nearest lattice point problem in $\mathbb{R}^n$ is formulated in a distributed network with $n$ nodes. The objective is to minimize the probability that an incorrect lattice point is found, subject to a constraint on inter-node…
We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…
Lattice animals provide a discretized model for the theta transition displayed by branched polymers in solvent. Exact graph enumeration studies have given some indications that the phase diagram of such lattice animals may contain two…
Directed acyclic graphs are a fundamental class of networks that includes citation networks, food webs, and family trees, among others. Here we define a random graph model for directed acyclic graphs and give solutions for a number of the…
Directed graphs naturally model systems with asymmetric, ordered relationships, essential to applications in biology, transportation, social networks, and visual understanding. Generating such graphs enables tasks such as simulation, data…
In this article we present an example of a random oriented tree model on d-dimensional lattice, that is a forest in d=3 with positive probability. This is in contrast with the other random tree models in the literature which are a forest…
Many real-world networks are intrinsically directed. Such networks include activation of genes, hyperlinks on the internet, and the network of followers on Twitter among many others. The challenge, however, is to create a network model that…
We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random…
We study random graph models for directed acyclic graphs, an important class of networks that includes citation networks, food webs, and feed-forward neural networks among others. We propose two specific models, roughly analogous to the…
Tree-child networks are a recently-described class of directed acyclic graphs that have risen to prominence in phylogenetics (the study of evolutionary trees and networks). Although these networks have a number of attractive mathematical…
Based on Taylor's hereditarily directed plump ordinals, we define the directed plump ordering on W-types in Martin-L\"of type theory. This ordering is similar to the plump ordering but comes equipped with non-empty finite joins in addition…
We define here a \textit{directed edge reinforced random walk} on a connected locally finite graph. As the name suggests, this walk keeps track of its past, and gives a bias towards directed edges previously crossed proportional to the…
We study the effective conductivity $\sigma_e$ for a random wire problem on the $d$-dimensional cubic lattice ${\mathbb Z}^d, d \geq 2$ in the case when random conductivities on bonds are independent identically distributed random…
An instance of the maximum mixed graph orientation problem consists of a mixed graph and a collection of source-target vertex pairs. The objective is to orient the undirected edges of the graph so as to maximize the number of pairs that…
We study directed random graphs (random graphs whose edges are directed), and present new results on the so-called strong components of those graphs. We provide analytic and simulation results on two special classes of strong component,…
We seek shifted lattice rules that are good for high dimensional integration over the unit cube in the setting of an unanchored weighted Sobolev space of functions with square-integrable mixed first derivatives. Many existing studies rely…