Peter Mucha

Prof. Peter Mucha


Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
14 May 2010 in Science
Verified
Journal Article
Closed access
PDF file
PMPeter Mucha
Peter Mucha
TRThomas Richardson
Thomas Richardson
KMKevin Macon
Kevin Macon
MPMason A. Porter
Mason A. Porter
JOJukka-Pekka Onnela
Jukka-Pekka Onnela
Network Notation: Networks are often characterized by clusters of constituents that interact more closely with each other and have more connections to one another than they do with the rest of the components of the network. However, systematically identifying and studying such community structure in complicated networks is not easy, especially when the network interactions change over time or contain multiple types of connections, as seen in many biological regulatory networks or social networks.Muchaet al.(p.876) developed a mathematical method to allow detection of communities that may be critical functional units of such networks. Application to real-world tasks—like making sense of the voting record in the U.S. Senate—demonstrated the promise of the method.

25 March 2016 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
NSNatalie Stanley
Natalie Stanley
SSSaray Shai
Saray Shai
DTDane Taylor
Dane Taylor
PMPeter Mucha
Peter Mucha
Multilayer networks are a useful data structure for simultaneously capturing multiple types of relationships between a set of nodes. In such networks, each relational definition gives rise to a layer. While each layer provides its own set of information, community structure across layers can be collectively utilized to discover and quantify underlying relational patterns between nodes. To concisely extract information from a multilayer network, we propose to identify and combine sets of layers with meaningful similarities in community structure. In this paper, we describe the “strata multilayer stochastic block model” (sMLSBM), a probabilistic model for multilayer community structure. The central extension of the model is that there exist groups of layers, called “strata”, which are defined such that all layers in a given stratum have community structure described by a common stochastic block model (SBM). That is, layers in a stratum exhibit similar node-to-community assignments and SBM probability parameters. Fitting the sMLSBM to a multilayer network provides a joint clustering that yields node-to-community and layer-to-stratum assignments, which cooperatively aid one another during inference. We describe an algorithm for separating layers into their appropriate strata and an inference technique for estimating the SBM parameters for each stratum. We demonstrate our method using synthetic networks and a multilayer network inferred from data collected in the Human Microbiome Project.

1 November 2007 in The American Mathematical Monthly
Verified
Journal Article
Closed access
TCThomas Callaghan
Thomas Callaghan
PMPeter Mucha
Peter Mucha
MPMason A. Porter
Mason A. Porter
(2007). Random Walker Ranking for NCAA Division I-A Football. The American Mathematical Monthly: Vol. 114, No. 9, pp. 761-777.

12 January 2017 in Network Science
Verified
Journal Article
Closed access
PDF file
LJLucas G. S. Jeub
Lucas G. S. Jeub
MMMichael W. Mahoney
Michael W. Mahoney
PMPeter Mucha
Peter Mucha
MPMason A. Porter
Mason A. Porter
The analysis of multilayer networks is among the most active areas of network science, and there are several methods to detect dense “communities” of nodes in multilayer networks. One way to define a community is as a set of nodes that trap a diffusion-like dynamical process (usually a random walk) for a long time. In this view, communities are sets of nodes that create bottlenecks to the spreading of a dynamical process on a network. We analyze the local behavior of different random walks on multiplex networks (which are multilayer networks in which different layers correspond to different types of edges) and show that they have very different bottlenecks, which correspond to rather different notions of what it means for a set of nodes to be a good community. This has direct implications for the behavior of community-detection methods that are based on these random walks.

19 August 2017 in Algorithms
Verified
Journal Article
Open access
PDF file
WWWilliam Harrington Weir
William Harrington Weir
SEScott Emmons
Scott Emmons
RGRyan Gibson
Ryan Gibson
Dane TaylorDane Taylor
Dane Taylor
PMPeter Mucha
Peter Mucha
We introduce the Convex Hull of Admissible Modularity Partitions (CHAMP) algorithm to prune and prioritize different network community structures identified across multiple runs of possibly various computational heuristics. Given a set of partitions, CHAMP identifies the domain of modularity optimization for each partition—i.e., the parameter-space domain where it has the largest modularity relative to the input set—discarding partitions with empty domains to obtain the subset of partitions that are “admissible” candidate community structures that remain potentially optimal over indicated parameter domains. Importantly, CHAMP can be used for multi-dimensional parameter spaces, such as those for multilayer networks where one includes a resolution parameter and interlayer coupling. Using the results from CHAMP, a user can more appropriately select robust community structures by observing the sizes of domains of optimization and the pairwise comparisons between partitions in the admissible subset. We demonstrate the utility of CHAMP with several example networks. In these examples, CHAMP focuses attention onto pruned subsets of admissible partitions that are 20-to-1785 times smaller than the sets of unique partitions obtained by community detection heuristics that were input into CHAMP.

24 July 2015 in ACS Infectious Diseases
Verified
Journal Article
Open access
KPKaveri S. Parker
Kaveri S. Parker
JWJames D. Wilson
James D. Wilson
JMJonas Marschall
Jonas Marschall
PMPeter Mucha
Peter Mucha
JHJeffrey P. Henderson
Jeffrey P. Henderson
Increasing antibiotic resistance among uropathogenic Escherichia coli (UPEC) is driving interest in therapeutic targeting of nonconserved virulence factor (VF) genes. The ability to formulate efficacious combinations of antivirulence agents requires an improved understanding of how UPEC deploy these genes. To identify clinically relevant VF combinations, we applied contemporary network analysis and biclustering algorithms to VF profiles from a large, previously characterized inpatient clinical cohort. These mathematical approaches identified four stereotypical VF combinations with distinctive relationships to antibiotic resistance and patient sex that are independent of traditional phylogenetic grouping. Targeting resistance- or sex-associated VFs based upon these contemporary mathematical approaches may facilitate individualized anti-infective therapies and identify synergistic VF combinations in bacterial pathogens.