Person:223219: Difference between revisions

From MaRDI portal
Person:223219
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Neal Madras to Neal Madras: Duplicate
 
(No difference)

Latest revision as of 12:25, 9 December 2023

Available identifiers

zbMath Open madras.nealWikidataQ61100109 ScholiaQ61100109MaRDI QIDQ223219

List of research outcomes





PublicationDate of PublicationType
Bounds on Kemeny's constant of a graph and the Nordhaus-Gaddum problem2023-09-10Paper
Kemeny's constant and enumerating Braess edges in trees2023-09-06Paper
Adsorption of lattice polymers with quenched topologies2022-11-11Paper
Examining HIV progression mechanisms via mathematical approaches2022-10-11Paper
Bounded affine permutations I. Pattern avoidance and enumeration2022-05-10Paper
Bounded affine permutations. II: Avoidance of decreasing patterns2021-12-18Paper
Epidemic dynamics and adaptive vaccination strategy: renewal equation approach2020-09-17Paper
Temperature-driven population abundance model for \textit{Culex pipiens} and \textit{Culex restuans} (Diptera: Culicidae)2018-07-06Paper
Directed polymers on a disordered tree with a defect subtree2018-05-09Paper
Longest monotone subsequences and rare regions of pattern-avoiding permutations2017-10-16Paper
Location of the adsorption transition for lattice polymers2017-03-03Paper
Large deviations for permutations avoiding monotone patterns2017-01-18Paper
Convergence rates for a hierarchical Gibbs sampler2017-01-11Paper
Structure of random 312-avoiding permutations2016-11-09Paper
https://portal.mardi4nfdi.de/entity/Q27902982016-03-03Paper
Stability of adversarial Markov chains, with an application to adaptive MCMC algorithms2015-11-24Paper
Phase diagram of inhomogeneous percolation with a defect plane2015-06-18Paper
A Note on Diffusion State Distance2015-02-25Paper
Large Deviations and Ratio Limit Theorems for Pattern-Avoiding Permutations2014-04-16Paper
A Lower Bound for the End-to-End Distance of the Self-Avoiding Walk2014-04-02Paper
The self-avoiding walk.2012-12-17Paper
https://portal.mardi4nfdi.de/entity/Q28809372012-04-17Paper
Trees, animals, and percolation on hyperbolic lattices2011-09-09Paper
Quantitative bounds for Markov chain convergence: Wasserstein and total variation distances2011-09-02Paper
https://portal.mardi4nfdi.de/entity/Q30623582011-01-03Paper
On the number of entangled clusters2010-04-30Paper
ALMOST UNKNOTTED EMBEDDINGS OF GRAPHS IN Z3 AND HIGHER DIMENSIONAL ANALOGUES2009-09-28Paper
https://portal.mardi4nfdi.de/entity/Q34976482009-07-27Paper
Self-Avoiding Walks on Hyperbolic Graphs2005-10-18Paper
Self-averaging in finite random copolymers2004-06-09Paper
Localization of a random copolymer at an interface2004-06-09Paper
Markov chain decomposition for convergence rate analysis2003-05-06Paper
On the swapping algorithm2003-03-19Paper
Lectures on Monte Carlo methods2002-01-16Paper
Anisotropic self-avoiding walks2001-08-30Paper
A rigorous bound on the critical exponent for the number of lattice trees, animals, and polygons.2001-01-16Paper
Critical exponents, hyperscaling, and universal amplitude ratios for two- and three-dimensional self-avoiding walks.2001-01-16Paper
Importance sampling for families of distributions2000-09-04Paper
Sharp phase boundaries for a lattice flux line model2000-08-09Paper
Monte Carlo study of the \(\Theta\)-point for collapsing trees2000-06-06Paper
The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.2000-02-02Paper
Metropolis Monte Carlo simulation of lattice animals2000-01-24Paper
A pattern theorem for lattice clusters1999-12-20Paper
https://portal.mardi4nfdi.de/entity/Q42497411999-11-29Paper
https://portal.mardi4nfdi.de/entity/Q42497331999-11-10Paper
GAUSSIAN OUTPUT FROM CHAOTIC INPUT1997-11-09Paper
https://portal.mardi4nfdi.de/entity/Q43418061997-06-18Paper
https://portal.mardi4nfdi.de/entity/Q48874781997-04-15Paper
Critical behaviour of self-avoiding walks: that cross a square1996-12-16Paper
On the critical behavior of the contact process in deterministic inhomogeneous environments1995-09-27Paper
Oscillating random walk with a moving boundary1995-06-30Paper
Random-walk interpretations of classical iteration methods1995-06-12Paper
The noisy voter model1995-05-30Paper
How fair is fair queuing1994-11-13Paper
https://portal.mardi4nfdi.de/entity/Q46931771993-06-10Paper
Stability-like properties of population models1993-02-14Paper
Branching random walks on trees1992-10-04Paper
A nonlocal Monte Carlo algorithm for lattice trees1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39768141992-06-26Paper
The pivot algorithm and polygons: results on the FCC lattice1990-01-01Paper
Random walks with killing1989-01-01Paper
Monte-Carlo approximation algorithms for enumeration problems1989-01-01Paper
End patterns of self-avoiding walks1988-01-01Paper
Statistics of lattice animals1988-01-01Paper
A process in a randomly fluctuating environment1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36784481985-01-01Paper
A Nordhaus--Gaddum problem for spectral gap of a graphN/APaper

Research outcomes over time

This page was built for person: Neal Madras