Learn More
Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications ranging from epidemics, through social networks to Internet modeling. Existing graph sampling methods are either link-swap based (Markov-Chain Monte Carlo algorithms) or stub-matching(More)
The interactions between the components of complex networks are often directed. Proper modeling of such systems frequently requires the construction of ensembles of digraphs with a given sequence of in-and out-degrees. As the number of simple labeled graphs with a given degree sequence is typically very large even for short sequences, sampling methods are(More)
Degree-based graph construction is an ubiquitous problem in network modeling [1, 2], ranging from social sciences to chemical compounds and biochemical reaction networks in the cell. This problem includes existence, enumeration, exhaustive construction and sampling questions with aspects that are still open today. Here we give necessary and sufficient(More)
Water-soluble, polyelectrolyte-grafted multiwalled carbon nanotubes (MWCNTs), MWCNT-g-PSSNa, were synthesized using a "grafting to" route. MWCNT-g-PSSNa thin films fabricated by an electrostatic spray (e-spray) technique were used as the counter electrode (CE) for dye-sensitized solar cells (DSSCs). The e-sprayed MWCNT-g-PSSNa thin-film-based CEs (MWCNT-CE)(More)
This paper develops and studies techniques for recovery from transmission errors that occur in facsimile images compressed with the Group 3, Extended 2 Dimensional MMR coding. When an error occurs in an MMR coded bitstream, the bitstream cannot be decoded after the error point, and the decoded image will have nothing after the error position. To prevent(More)
We compare the informational architecture of biological and random networks to identify informational features that may distinguish biological networks from random. The study presented here focuses on the Boolean network model for regulation of the cell cycle of the fission yeast Schizosaccharomyces pombe. We compare calculated values of local and global(More)
We give a necessary and sufficient condition for a sequence of nonnegative integers to be realized as a simple graph's degree sequence such that a given (but otherwise arbitrary) set of possible connections from a node are avoided. We then use this result to present a procedure that builds all simple graphs realizing a given degree sequence. whose degree(More)